/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de42.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:07:46,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:07:46,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:07:46,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:07:46,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:07:46,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:07:46,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:07:46,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:07:46,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:07:46,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:07:46,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:07:46,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:07:46,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:07:46,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:07:46,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:07:46,589 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:07:46,590 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:07:46,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:07:46,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:07:46,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:07:46,594 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:07:46,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:07:46,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:07:46,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:07:46,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:07:46,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:07:46,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:07:46,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:07:46,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:07:46,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:07:46,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:07:46,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:07:46,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:07:46,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:07:46,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:07:46,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:07:46,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:07:46,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:07:46,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:07:46,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:07:46,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:07:46,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:07:46,617 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:07:46,624 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:07:46,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:07:46,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:07:46,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:07:46,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:07:46,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:07:46,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:07:46,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:07:46,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:07:46,626 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:07:46,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:07:46,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:07:46,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:07:46,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:07:46,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:07:46,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:07:46,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:07:46,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:07:46,628 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:07:46,628 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:07:46,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:07:46,628 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:07:46,628 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 10:07:46,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:07:46,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:07:46,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:07:46,889 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:07:46,889 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:07:46,891 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-04-28 10:07:46,948 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e476e74e6/08845f2b9a854253b50d108e714c607d/FLAG77e7564ad [2022-04-28 10:07:47,389 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:07:47,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-04-28 10:07:47,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e476e74e6/08845f2b9a854253b50d108e714c607d/FLAG77e7564ad [2022-04-28 10:07:47,414 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e476e74e6/08845f2b9a854253b50d108e714c607d [2022-04-28 10:07:47,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:07:47,421 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:07:47,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:07:47,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:07:47,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:07:47,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:07:47" (1/1) ... [2022-04-28 10:07:47,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d94a8a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:07:47, skipping insertion in model container [2022-04-28 10:07:47,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:07:47" (1/1) ... [2022-04-28 10:07:47,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:07:47,453 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:07:47,654 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-de42.c[368,381] [2022-04-28 10:07:47,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:07:47,687 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:07:47,704 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-de42.c[368,381] [2022-04-28 10:07:47,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:07:47,731 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:07:47,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:07:47 WrapperNode [2022-04-28 10:07:47,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:07:47,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:07:47,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:07:47,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:07:47,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:07:47" (1/1) ... [2022-04-28 10:07:47,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:07:47" (1/1) ... [2022-04-28 10:07:47,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:07:47" (1/1) ... [2022-04-28 10:07:47,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:07:47" (1/1) ... [2022-04-28 10:07:47,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:07:47" (1/1) ... [2022-04-28 10:07:47,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:07:47" (1/1) ... [2022-04-28 10:07:47,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:07:47" (1/1) ... [2022-04-28 10:07:47,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:07:47,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:07:47,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:07:47,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:07:47,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:07:47" (1/1) ... [2022-04-28 10:07:47,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:07:47,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:47,817 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-28 10:07:47,840 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-28 10:07:47,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:07:47,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:07:47,862 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:07:47,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:07:47,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:07:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:07:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:07:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:07:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:07:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 10:07:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:07:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:07:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:07:47,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:07:47,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:07:47,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:07:47,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:07:47,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:07:47,926 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:07:47,928 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:07:48,114 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:07:48,119 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:07:48,119 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-28 10:07:48,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:07:48 BoogieIcfgContainer [2022-04-28 10:07:48,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:07:48,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:07:48,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:07:48,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:07:48,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:07:47" (1/3) ... [2022-04-28 10:07:48,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d12bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:07:48, skipping insertion in model container [2022-04-28 10:07:48,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:07:47" (2/3) ... [2022-04-28 10:07:48,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d12bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:07:48, skipping insertion in model container [2022-04-28 10:07:48,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:07:48" (3/3) ... [2022-04-28 10:07:48,132 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de42.c [2022-04-28 10:07:48,146 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:07:48,146 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:07:48,191 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:07:48,196 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@45633ca6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b4ec9bf [2022-04-28 10:07:48,197 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:07:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:07:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:07:48,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:48,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:48,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:48,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:48,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 1 times [2022-04-28 10:07:48,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:48,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [147040826] [2022-04-28 10:07:48,237 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:07:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 2 times [2022-04-28 10:07:48,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:48,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086478393] [2022-04-28 10:07:48,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:48,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:48,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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); {26#true} is VALID [2022-04-28 10:07:48,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 10:07:48,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-28 10:07:48,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:48,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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); {26#true} is VALID [2022-04-28 10:07:48,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 10:07:48,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-28 10:07:48,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret13 := main(); {26#true} is VALID [2022-04-28 10:07:48,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26#true} is VALID [2022-04-28 10:07:48,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !(~x~0 % 4294967296 > 0); {26#true} is VALID [2022-04-28 10:07:48,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} ~z~0 := ~y~0; {26#true} is VALID [2022-04-28 10:07:48,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#true} assume !(~z~0 % 4294967296 > 0); {26#true} is VALID [2022-04-28 10:07:48,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#true} assume !(~y~0 % 4294967296 > 0); {26#true} is VALID [2022-04-28 10:07:48,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-28 10:07:48,434 INFO L272 TraceCheckUtils]: 11: Hoare triple {27#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-28 10:07:48,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-28 10:07:48,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-28 10:07:48,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-28 10:07:48,437 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-28 10:07:48,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:48,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086478393] [2022-04-28 10:07:48,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086478393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:48,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:48,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:07:48,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:48,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [147040826] [2022-04-28 10:07:48,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [147040826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:48,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:48,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:07:48,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133345997] [2022-04-28 10:07:48,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:48,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:07:48,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:48,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:48,487 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-28 10:07:48,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:07:48,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:48,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:07:48,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:07:48,513 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:48,619 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 10:07:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:07:48,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:07:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-28 10:07:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-28 10:07:48,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-28 10:07:48,723 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-28 10:07:48,733 INFO L225 Difference]: With dead ends: 39 [2022-04-28 10:07:48,733 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 10:07:48,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:07:48,741 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:48,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:07:48,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 10:07:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 10:07:48,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:48,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-28 10:07:48,783 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-28 10:07:48,783 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-28 10:07:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:48,787 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-28 10:07:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-28 10:07:48,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:48,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:48,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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 16 states. [2022-04-28 10:07:48,789 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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 16 states. [2022-04-28 10:07:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:48,791 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-28 10:07:48,791 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-28 10:07:48,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:48,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:48,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:48,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-28 10:07:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-04-28 10:07:48,795 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-04-28 10:07:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:48,796 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-04-28 10:07:48,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:48,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 19 transitions. [2022-04-28 10:07:48,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-28 10:07:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:07:48,836 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:48,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:48,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:07:48,837 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:48,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:48,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 1 times [2022-04-28 10:07:48,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:48,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [726520195] [2022-04-28 10:07:48,839 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:07:48,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 2 times [2022-04-28 10:07:48,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:48,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578671429] [2022-04-28 10:07:48,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:48,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:49,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:49,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {188#(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); {176#true} is VALID [2022-04-28 10:07:49,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-28 10:07:49,388 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-28 10:07:49,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {176#true} call ULTIMATE.init(); {188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:49,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#(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); {176#true} is VALID [2022-04-28 10:07:49,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-28 10:07:49,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-28 10:07:49,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {176#true} call #t~ret13 := main(); {176#true} is VALID [2022-04-28 10:07:49,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {181#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:07:49,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {181#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:07:49,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {183#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} is VALID [2022-04-28 10:07:49,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {183#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:49,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:49,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {185#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:49,399 INFO L272 TraceCheckUtils]: 11: Hoare triple {185#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {186#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:07:49,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {186#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {187#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:07:49,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {187#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {177#false} is VALID [2022-04-28 10:07:49,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {177#false} assume !false; {177#false} is VALID [2022-04-28 10:07:49,400 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-28 10:07:49,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:49,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578671429] [2022-04-28 10:07:49,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578671429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:49,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:49,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:07:49,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:49,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [726520195] [2022-04-28 10:07:49,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [726520195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:49,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:49,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:07:49,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905971358] [2022-04-28 10:07:49,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:49,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-28 10:07:49,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:49,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-28 10:07:49,424 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-28 10:07:49,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:07:49,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:49,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:07:49,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:07:49,427 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-28 10:07:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:49,922 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-04-28 10:07:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:07:49,922 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-28 10:07:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-28 10:07:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-28 10:07:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-28 10:07:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-28 10:07:49,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-28 10:07:49,984 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-28 10:07:49,985 INFO L225 Difference]: With dead ends: 33 [2022-04-28 10:07:49,985 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:07:49,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:07:49,987 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:49,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 45 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:07:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:07:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-28 10:07:50,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:50,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,001 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,001 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:50,003 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 10:07:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 10:07:50,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:50,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:50,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 10:07:50,009 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 10:07:50,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:50,011 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 10:07:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 10:07:50,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:50,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:50,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:50,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-28 10:07:50,016 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2022-04-28 10:07:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:50,016 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-28 10:07:50,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-28 10:07:50,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 28 transitions. [2022-04-28 10:07:50,047 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-28 10:07:50,047 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 10:07:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:07:50,048 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:50,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:50,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:07:50,048 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash 971437455, now seen corresponding path program 1 times [2022-04-28 10:07:50,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:50,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1166445488] [2022-04-28 10:07:50,050 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:50,050 INFO L85 PathProgramCache]: Analyzing trace with hash 971437455, now seen corresponding path program 2 times [2022-04-28 10:07:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:50,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062364262] [2022-04-28 10:07:50,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:50,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:50,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:50,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {363#(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); {357#true} is VALID [2022-04-28 10:07:50,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-28 10:07:50,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-28 10:07:50,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:50,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#(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); {357#true} is VALID [2022-04-28 10:07:50,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-28 10:07:50,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-28 10:07:50,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret13 := main(); {357#true} is VALID [2022-04-28 10:07:50,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {362#(= main_~y~0 0)} is VALID [2022-04-28 10:07:50,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {362#(= main_~y~0 0)} is VALID [2022-04-28 10:07:50,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {362#(= main_~y~0 0)} ~z~0 := ~y~0; {362#(= main_~y~0 0)} is VALID [2022-04-28 10:07:50,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {362#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {362#(= main_~y~0 0)} is VALID [2022-04-28 10:07:50,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {358#false} is VALID [2022-04-28 10:07:50,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {358#false} assume !(~y~0 % 4294967296 > 0); {358#false} is VALID [2022-04-28 10:07:50,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {358#false} assume !(~x~0 % 4294967296 > 0); {358#false} is VALID [2022-04-28 10:07:50,099 INFO L272 TraceCheckUtils]: 12: Hoare triple {358#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {358#false} is VALID [2022-04-28 10:07:50,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2022-04-28 10:07:50,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2022-04-28 10:07:50,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-04-28 10:07:50,100 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-28 10:07:50,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:50,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062364262] [2022-04-28 10:07:50,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062364262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:50,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:50,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:07:50,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:50,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1166445488] [2022-04-28 10:07:50,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1166445488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:50,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:50,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:07:50,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649902642] [2022-04-28 10:07:50,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:50,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:07:50,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:50,103 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), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,117 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-28 10:07:50,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:07:50,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:50,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:07:50,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:07:50,119 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:50,190 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-28 10:07:50,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:07:50,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:07:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 10:07:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 10:07:50,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-28 10:07:50,229 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-28 10:07:50,229 INFO L225 Difference]: With dead ends: 33 [2022-04-28 10:07:50,230 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:07:50,230 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-28 10:07:50,231 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:50,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 23 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:07:50,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:07:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-04-28 10:07:50,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:50,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,238 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,238 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:50,240 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 10:07:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 10:07:50,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:50,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:50,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 10:07:50,241 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 10:07:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:50,242 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 10:07:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 10:07:50,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:50,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:50,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:50,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:50,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-28 10:07:50,245 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 16 [2022-04-28 10:07:50,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:50,245 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-28 10:07:50,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-28 10:07:50,273 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-28 10:07:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-28 10:07:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:07:50,274 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:50,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:50,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 10:07:50,274 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:50,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:50,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1509444864, now seen corresponding path program 1 times [2022-04-28 10:07:50,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:50,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [446656787] [2022-04-28 10:07:50,292 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:50,292 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:50,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1509444864, now seen corresponding path program 2 times [2022-04-28 10:07:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:50,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795102158] [2022-04-28 10:07:50,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:50,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:50,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:50,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {529#(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); {522#true} is VALID [2022-04-28 10:07:50,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {522#true} assume true; {522#true} is VALID [2022-04-28 10:07:50,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {522#true} {522#true} #72#return; {522#true} is VALID [2022-04-28 10:07:50,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {522#true} call ULTIMATE.init(); {529#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:50,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#(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); {522#true} is VALID [2022-04-28 10:07:50,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {522#true} assume true; {522#true} is VALID [2022-04-28 10:07:50,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {522#true} {522#true} #72#return; {522#true} is VALID [2022-04-28 10:07:50,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {522#true} call #t~ret13 := main(); {522#true} is VALID [2022-04-28 10:07:50,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {527#(= main_~y~0 0)} is VALID [2022-04-28 10:07:50,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {527#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {527#(= main_~y~0 0)} is VALID [2022-04-28 10:07:50,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {527#(= main_~y~0 0)} ~z~0 := ~y~0; {528#(= main_~z~0 0)} is VALID [2022-04-28 10:07:50,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {528#(= 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; {523#false} is VALID [2022-04-28 10:07:50,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {523#false} assume !(~z~0 % 4294967296 > 0); {523#false} is VALID [2022-04-28 10:07:50,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {523#false} assume !(~y~0 % 4294967296 > 0); {523#false} is VALID [2022-04-28 10:07:50,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {523#false} assume !(~x~0 % 4294967296 > 0); {523#false} is VALID [2022-04-28 10:07:50,388 INFO L272 TraceCheckUtils]: 12: Hoare triple {523#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {523#false} is VALID [2022-04-28 10:07:50,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {523#false} ~cond := #in~cond; {523#false} is VALID [2022-04-28 10:07:50,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {523#false} assume 0 == ~cond; {523#false} is VALID [2022-04-28 10:07:50,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {523#false} assume !false; {523#false} is VALID [2022-04-28 10:07:50,389 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-28 10:07:50,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:50,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795102158] [2022-04-28 10:07:50,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795102158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:50,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:50,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:07:50,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:50,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [446656787] [2022-04-28 10:07:50,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [446656787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:50,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:50,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:07:50,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540006312] [2022-04-28 10:07:50,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:50,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:07:50,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:50,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,419 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-28 10:07:50,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:07:50,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:50,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:07:50,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:07:50,420 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:50,539 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-28 10:07:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:07:50,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:07:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 10:07:50,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 10:07:50,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 10:07:50,574 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-28 10:07:50,575 INFO L225 Difference]: With dead ends: 27 [2022-04-28 10:07:50,575 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 10:07:50,575 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-28 10:07:50,582 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:50,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:07:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 10:07:50,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 10:07:50,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:50,591 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-28 10:07:50,592 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-28 10:07:50,592 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-28 10:07:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:50,593 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 10:07:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 10:07:50,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:50,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:50,594 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-28 10:07:50,594 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-28 10:07:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:50,603 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 10:07:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 10:07:50,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:50,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:50,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:50,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:50,604 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-28 10:07:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-28 10:07:50,605 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 16 [2022-04-28 10:07:50,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:50,605 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-28 10:07:50,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:50,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 20 transitions. [2022-04-28 10:07:50,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 10:07:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:07:50,633 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:50,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:50,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 10:07:50,634 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:50,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash 570818913, now seen corresponding path program 1 times [2022-04-28 10:07:50,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:50,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [117172931] [2022-04-28 10:07:50,640 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:50,640 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash 570818913, now seen corresponding path program 2 times [2022-04-28 10:07:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:50,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463706413] [2022-04-28 10:07:50,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:50,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:50,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:50,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {666#(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); {658#true} is VALID [2022-04-28 10:07:50,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-28 10:07:50,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {658#true} {658#true} #72#return; {658#true} is VALID [2022-04-28 10:07:50,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:50,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {666#(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); {658#true} is VALID [2022-04-28 10:07:50,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-28 10:07:50,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #72#return; {658#true} is VALID [2022-04-28 10:07:50,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {658#true} call #t~ret13 := main(); {658#true} is VALID [2022-04-28 10:07:50,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {663#(= main_~y~0 0)} is VALID [2022-04-28 10:07:50,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {663#(= 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; {664#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:50,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {664#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {664#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:50,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {664#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {665#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:07:50,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {665#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {659#false} is VALID [2022-04-28 10:07:50,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {659#false} assume !(~y~0 % 4294967296 > 0); {659#false} is VALID [2022-04-28 10:07:50,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {659#false} assume !(~x~0 % 4294967296 > 0); {659#false} is VALID [2022-04-28 10:07:50,764 INFO L272 TraceCheckUtils]: 12: Hoare triple {659#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {659#false} is VALID [2022-04-28 10:07:50,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#false} ~cond := #in~cond; {659#false} is VALID [2022-04-28 10:07:50,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#false} assume 0 == ~cond; {659#false} is VALID [2022-04-28 10:07:50,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {659#false} assume !false; {659#false} is VALID [2022-04-28 10:07:50,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:50,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:50,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463706413] [2022-04-28 10:07:50,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463706413] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:50,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012099114] [2022-04-28 10:07:50,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:50,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:50,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:50,771 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-28 10:07:50,782 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-28 10:07:50,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:50,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:50,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:07:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:50,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:51,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {658#true} is VALID [2022-04-28 10:07:51,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#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); {658#true} is VALID [2022-04-28 10:07:51,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-28 10:07:51,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #72#return; {658#true} is VALID [2022-04-28 10:07:51,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {658#true} call #t~ret13 := main(); {658#true} is VALID [2022-04-28 10:07:51,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {663#(= main_~y~0 0)} is VALID [2022-04-28 10:07:51,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {663#(= 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; {664#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:51,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {664#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {664#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:51,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {664#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {694#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:07:51,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {694#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {659#false} is VALID [2022-04-28 10:07:51,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {659#false} assume !(~y~0 % 4294967296 > 0); {659#false} is VALID [2022-04-28 10:07:51,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {659#false} assume !(~x~0 % 4294967296 > 0); {659#false} is VALID [2022-04-28 10:07:51,112 INFO L272 TraceCheckUtils]: 12: Hoare triple {659#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {659#false} is VALID [2022-04-28 10:07:51,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#false} ~cond := #in~cond; {659#false} is VALID [2022-04-28 10:07:51,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#false} assume 0 == ~cond; {659#false} is VALID [2022-04-28 10:07:51,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {659#false} assume !false; {659#false} is VALID [2022-04-28 10:07:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:51,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:51,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {659#false} assume !false; {659#false} is VALID [2022-04-28 10:07:51,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#false} assume 0 == ~cond; {659#false} is VALID [2022-04-28 10:07:51,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#false} ~cond := #in~cond; {659#false} is VALID [2022-04-28 10:07:51,207 INFO L272 TraceCheckUtils]: 12: Hoare triple {659#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {659#false} is VALID [2022-04-28 10:07:51,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {659#false} assume !(~x~0 % 4294967296 > 0); {659#false} is VALID [2022-04-28 10:07:51,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {659#false} assume !(~y~0 % 4294967296 > 0); {659#false} is VALID [2022-04-28 10:07:51,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {734#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {659#false} is VALID [2022-04-28 10:07:51,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {738#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {734#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:51,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {738#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:51,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {745#(< 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; {738#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:51,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {745#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:51,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {658#true} call #t~ret13 := main(); {658#true} is VALID [2022-04-28 10:07:51,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #72#return; {658#true} is VALID [2022-04-28 10:07:51,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-28 10:07:51,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#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); {658#true} is VALID [2022-04-28 10:07:51,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {658#true} is VALID [2022-04-28 10:07:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:51,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012099114] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:51,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:51,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 10:07:51,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:51,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [117172931] [2022-04-28 10:07:51,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [117172931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:51,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:51,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:07:51,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114670934] [2022-04-28 10:07:51,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:51,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:07:51,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:51,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:51,246 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-28 10:07:51,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:07:51,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:51,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:07:51,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:07:51,247 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:51,469 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 10:07:51,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:07:51,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:07:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-28 10:07:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-28 10:07:51,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-28 10:07:51,511 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-28 10:07:51,512 INFO L225 Difference]: With dead ends: 32 [2022-04-28 10:07:51,512 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 10:07:51,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:07:51,513 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:51,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 35 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:07:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 10:07:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-04-28 10:07:51,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:51,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:51,525 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:51,525 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:51,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:51,527 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-28 10:07:51,527 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-28 10:07:51,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:51,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:51,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 10:07:51,527 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 10:07:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:51,528 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-28 10:07:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-28 10:07:51,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:51,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:51,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:51,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:51,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-28 10:07:51,530 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 16 [2022-04-28 10:07:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:51,530 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-28 10:07:51,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:51,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-28 10:07:51,558 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-28 10:07:51,559 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 10:07:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:07:51,559 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:51,559 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:51,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 10:07:51,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:51,784 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:51,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:51,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1552222072, now seen corresponding path program 3 times [2022-04-28 10:07:51,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:51,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [970943173] [2022-04-28 10:07:51,789 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:51,789 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:51,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1552222072, now seen corresponding path program 4 times [2022-04-28 10:07:51,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:51,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658367535] [2022-04-28 10:07:51,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:51,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:51,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:51,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {941#(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); {932#true} is VALID [2022-04-28 10:07:51,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {932#true} assume true; {932#true} is VALID [2022-04-28 10:07:51,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {932#true} {932#true} #72#return; {932#true} is VALID [2022-04-28 10:07:51,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {932#true} call ULTIMATE.init(); {941#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:51,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {941#(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); {932#true} is VALID [2022-04-28 10:07:51,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {932#true} assume true; {932#true} is VALID [2022-04-28 10:07:51,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {932#true} {932#true} #72#return; {932#true} is VALID [2022-04-28 10:07:51,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {932#true} call #t~ret13 := main(); {932#true} is VALID [2022-04-28 10:07:51,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {932#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {937#(= main_~y~0 0)} is VALID [2022-04-28 10:07:51,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {937#(= 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; {938#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:51,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {938#(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; {939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:51,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:51,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {940#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:07:51,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {940#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {933#false} is VALID [2022-04-28 10:07:51,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {933#false} assume !(~y~0 % 4294967296 > 0); {933#false} is VALID [2022-04-28 10:07:51,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {933#false} assume !(~x~0 % 4294967296 > 0); {933#false} is VALID [2022-04-28 10:07:51,887 INFO L272 TraceCheckUtils]: 13: Hoare triple {933#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {933#false} is VALID [2022-04-28 10:07:51,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {933#false} ~cond := #in~cond; {933#false} is VALID [2022-04-28 10:07:51,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {933#false} assume 0 == ~cond; {933#false} is VALID [2022-04-28 10:07:51,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {933#false} assume !false; {933#false} is VALID [2022-04-28 10:07:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:51,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:51,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658367535] [2022-04-28 10:07:51,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658367535] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:51,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286708657] [2022-04-28 10:07:51,889 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:51,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:51,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:51,890 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-28 10:07:51,895 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-28 10:07:51,933 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:51,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:51,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:07:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:51,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:52,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {932#true} call ULTIMATE.init(); {932#true} is VALID [2022-04-28 10:07:52,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {932#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); {932#true} is VALID [2022-04-28 10:07:52,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {932#true} assume true; {932#true} is VALID [2022-04-28 10:07:52,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {932#true} {932#true} #72#return; {932#true} is VALID [2022-04-28 10:07:52,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {932#true} call #t~ret13 := main(); {932#true} is VALID [2022-04-28 10:07:52,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {932#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {937#(= main_~y~0 0)} is VALID [2022-04-28 10:07:52,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {937#(= 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; {938#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:52,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {938#(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; {939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:52,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:52,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {972#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:07:52,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {972#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {933#false} is VALID [2022-04-28 10:07:52,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {933#false} assume !(~y~0 % 4294967296 > 0); {933#false} is VALID [2022-04-28 10:07:52,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {933#false} assume !(~x~0 % 4294967296 > 0); {933#false} is VALID [2022-04-28 10:07:52,176 INFO L272 TraceCheckUtils]: 13: Hoare triple {933#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {933#false} is VALID [2022-04-28 10:07:52,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {933#false} ~cond := #in~cond; {933#false} is VALID [2022-04-28 10:07:52,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {933#false} assume 0 == ~cond; {933#false} is VALID [2022-04-28 10:07:52,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {933#false} assume !false; {933#false} is VALID [2022-04-28 10:07:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:52,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:52,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {933#false} assume !false; {933#false} is VALID [2022-04-28 10:07:52,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {933#false} assume 0 == ~cond; {933#false} is VALID [2022-04-28 10:07:52,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {933#false} ~cond := #in~cond; {933#false} is VALID [2022-04-28 10:07:52,298 INFO L272 TraceCheckUtils]: 13: Hoare triple {933#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {933#false} is VALID [2022-04-28 10:07:52,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {933#false} assume !(~x~0 % 4294967296 > 0); {933#false} is VALID [2022-04-28 10:07:52,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {933#false} assume !(~y~0 % 4294967296 > 0); {933#false} is VALID [2022-04-28 10:07:52,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {1012#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {933#false} is VALID [2022-04-28 10:07:52,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {1016#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1012#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:52,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {1016#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1016#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:52,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {1023#(< 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; {1016#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:52,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {1027#(< 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; {1023#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:52,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {932#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1027#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:52,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {932#true} call #t~ret13 := main(); {932#true} is VALID [2022-04-28 10:07:52,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {932#true} {932#true} #72#return; {932#true} is VALID [2022-04-28 10:07:52,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {932#true} assume true; {932#true} is VALID [2022-04-28 10:07:52,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {932#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); {932#true} is VALID [2022-04-28 10:07:52,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {932#true} call ULTIMATE.init(); {932#true} is VALID [2022-04-28 10:07:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:52,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286708657] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:52,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:52,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 10:07:52,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:52,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [970943173] [2022-04-28 10:07:52,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [970943173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:52,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:52,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:07:52,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373064194] [2022-04-28 10:07:52,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:52,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:07:52,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:52,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:52,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:07:52,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:52,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:07:52,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:07:52,330 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:52,614 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-04-28 10:07:52,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:07:52,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:07:52,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-28 10:07:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-28 10:07:52,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-28 10:07:52,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:52,666 INFO L225 Difference]: With dead ends: 39 [2022-04-28 10:07:52,666 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 10:07:52,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:07:52,667 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:52,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 39 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:07:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 10:07:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-04-28 10:07:52,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:52,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,686 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,686 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:52,687 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 10:07:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-28 10:07:52,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:52,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:52,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 10:07:52,688 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 10:07:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:52,689 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 10:07:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-28 10:07:52,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:52,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:52,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:52,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-28 10:07:52,691 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2022-04-28 10:07:52,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:52,691 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-28 10:07:52,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2022-04-28 10:07:52,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-28 10:07:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:07:52,724 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:52,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:52,747 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-28 10:07:52,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-28 10:07:52,940 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:52,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:52,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1344200880, now seen corresponding path program 1 times [2022-04-28 10:07:52,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:52,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [564045814] [2022-04-28 10:07:52,943 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:52,943 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:52,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1344200880, now seen corresponding path program 2 times [2022-04-28 10:07:52,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:52,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274257762] [2022-04-28 10:07:52,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:52,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:53,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:53,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {1261#(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); {1254#true} is VALID [2022-04-28 10:07:53,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {1254#true} assume true; {1254#true} is VALID [2022-04-28 10:07:53,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1254#true} {1254#true} #72#return; {1254#true} is VALID [2022-04-28 10:07:53,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {1254#true} call ULTIMATE.init(); {1261#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:53,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {1261#(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); {1254#true} is VALID [2022-04-28 10:07:53,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {1254#true} assume true; {1254#true} is VALID [2022-04-28 10:07:53,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1254#true} {1254#true} #72#return; {1254#true} is VALID [2022-04-28 10:07:53,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {1254#true} call #t~ret13 := main(); {1254#true} is VALID [2022-04-28 10:07:53,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {1254#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1254#true} is VALID [2022-04-28 10:07:53,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {1254#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:07:53,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:07:53,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:07:53,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:07:53,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:07:53,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:07:53,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:07:53,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1255#false} is VALID [2022-04-28 10:07:53,023 INFO L272 TraceCheckUtils]: 14: Hoare triple {1255#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1255#false} is VALID [2022-04-28 10:07:53,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {1255#false} ~cond := #in~cond; {1255#false} is VALID [2022-04-28 10:07:53,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {1255#false} assume 0 == ~cond; {1255#false} is VALID [2022-04-28 10:07:53,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {1255#false} assume !false; {1255#false} is VALID [2022-04-28 10:07:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:07:53,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:53,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274257762] [2022-04-28 10:07:53,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274257762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:53,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210898535] [2022-04-28 10:07:53,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:53,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:53,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:53,028 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-28 10:07:53,029 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-28 10:07:53,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:53,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:53,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:07:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:53,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:53,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {1254#true} call ULTIMATE.init(); {1254#true} is VALID [2022-04-28 10:07:53,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {1254#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); {1254#true} is VALID [2022-04-28 10:07:53,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {1254#true} assume true; {1254#true} is VALID [2022-04-28 10:07:53,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1254#true} {1254#true} #72#return; {1254#true} is VALID [2022-04-28 10:07:53,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {1254#true} call #t~ret13 := main(); {1254#true} is VALID [2022-04-28 10:07:53,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {1254#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1254#true} is VALID [2022-04-28 10:07:53,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {1254#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:07:53,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:07:53,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:07:53,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:07:53,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:07:53,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:07:53,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:07:53,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1255#false} is VALID [2022-04-28 10:07:53,365 INFO L272 TraceCheckUtils]: 14: Hoare triple {1255#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1255#false} is VALID [2022-04-28 10:07:53,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {1255#false} ~cond := #in~cond; {1255#false} is VALID [2022-04-28 10:07:53,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {1255#false} assume 0 == ~cond; {1255#false} is VALID [2022-04-28 10:07:53,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {1255#false} assume !false; {1255#false} is VALID [2022-04-28 10:07:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:07:53,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:53,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {1255#false} assume !false; {1255#false} is VALID [2022-04-28 10:07:53,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {1255#false} assume 0 == ~cond; {1255#false} is VALID [2022-04-28 10:07:53,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {1255#false} ~cond := #in~cond; {1255#false} is VALID [2022-04-28 10:07:53,480 INFO L272 TraceCheckUtils]: 14: Hoare triple {1255#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1255#false} is VALID [2022-04-28 10:07:53,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1255#false} is VALID [2022-04-28 10:07:53,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:07:53,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:07:53,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:07:53,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1260#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:07:53,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:07:53,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:07:53,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {1254#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:07:53,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {1254#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1254#true} is VALID [2022-04-28 10:07:53,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {1254#true} call #t~ret13 := main(); {1254#true} is VALID [2022-04-28 10:07:53,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1254#true} {1254#true} #72#return; {1254#true} is VALID [2022-04-28 10:07:53,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {1254#true} assume true; {1254#true} is VALID [2022-04-28 10:07:53,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {1254#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); {1254#true} is VALID [2022-04-28 10:07:53,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {1254#true} call ULTIMATE.init(); {1254#true} is VALID [2022-04-28 10:07:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:07:53,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210898535] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:53,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:53,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 10:07:53,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:53,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [564045814] [2022-04-28 10:07:53,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [564045814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:53,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:53,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:07:53,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384103029] [2022-04-28 10:07:53,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:53,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2022-04-28 10:07:53,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:53,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 10:07:53,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:53,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:07:53,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:53,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:07:53,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:07:53,511 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 10:07:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:53,700 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-28 10:07:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:07:53,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2022-04-28 10:07:53,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 10:07:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 10:07:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 10:07:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 10:07:53,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 10:07:53,743 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-28 10:07:53,744 INFO L225 Difference]: With dead ends: 44 [2022-04-28 10:07:53,745 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 10:07:53,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:07:53,745 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:53,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 30 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:07:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 10:07:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-04-28 10:07:53,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:53,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:53,787 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:53,787 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:53,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:53,788 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-28 10:07:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-28 10:07:53,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:53,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:53,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 10:07:53,789 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 10:07:53,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:53,791 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-28 10:07:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-28 10:07:53,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:53,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:53,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:53,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-04-28 10:07:53,793 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 18 [2022-04-28 10:07:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:53,793 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-04-28 10:07:53,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 10:07:53,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 49 transitions. [2022-04-28 10:07:53,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-04-28 10:07:53,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:07:53,847 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:53,847 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:53,863 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-28 10:07:54,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:54,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:54,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:54,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1910948929, now seen corresponding path program 5 times [2022-04-28 10:07:54,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:54,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [721023452] [2022-04-28 10:07:54,052 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:54,052 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:54,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1910948929, now seen corresponding path program 6 times [2022-04-28 10:07:54,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:54,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640864617] [2022-04-28 10:07:54,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:54,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:54,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:54,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {1623#(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); {1613#true} is VALID [2022-04-28 10:07:54,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {1613#true} assume true; {1613#true} is VALID [2022-04-28 10:07:54,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1613#true} {1613#true} #72#return; {1613#true} is VALID [2022-04-28 10:07:54,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {1613#true} call ULTIMATE.init(); {1623#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:54,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#(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); {1613#true} is VALID [2022-04-28 10:07:54,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {1613#true} assume true; {1613#true} is VALID [2022-04-28 10:07:54,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1613#true} {1613#true} #72#return; {1613#true} is VALID [2022-04-28 10:07:54,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {1613#true} call #t~ret13 := main(); {1613#true} is VALID [2022-04-28 10:07:54,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {1613#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1618#(= main_~y~0 0)} is VALID [2022-04-28 10:07:54,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {1618#(= 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; {1619#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:54,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {1619#(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; {1620#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:54,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {1620#(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; {1621#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:54,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {1621#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1621#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:54,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {1621#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1622#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:54,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {1622#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1614#false} is VALID [2022-04-28 10:07:54,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {1614#false} assume !(~y~0 % 4294967296 > 0); {1614#false} is VALID [2022-04-28 10:07:54,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {1614#false} assume !(~x~0 % 4294967296 > 0); {1614#false} is VALID [2022-04-28 10:07:54,159 INFO L272 TraceCheckUtils]: 14: Hoare triple {1614#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1614#false} is VALID [2022-04-28 10:07:54,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {1614#false} ~cond := #in~cond; {1614#false} is VALID [2022-04-28 10:07:54,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {1614#false} assume 0 == ~cond; {1614#false} is VALID [2022-04-28 10:07:54,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {1614#false} assume !false; {1614#false} is VALID [2022-04-28 10:07:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:54,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:54,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640864617] [2022-04-28 10:07:54,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640864617] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:54,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503214102] [2022-04-28 10:07:54,160 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:07:54,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:54,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:54,163 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-28 10:07:54,165 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-28 10:07:54,198 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:07:54,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:54,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:07:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:54,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:54,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {1613#true} call ULTIMATE.init(); {1613#true} is VALID [2022-04-28 10:07:54,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {1613#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); {1613#true} is VALID [2022-04-28 10:07:54,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {1613#true} assume true; {1613#true} is VALID [2022-04-28 10:07:54,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1613#true} {1613#true} #72#return; {1613#true} is VALID [2022-04-28 10:07:54,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {1613#true} call #t~ret13 := main(); {1613#true} is VALID [2022-04-28 10:07:54,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {1613#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1618#(= main_~y~0 0)} is VALID [2022-04-28 10:07:54,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {1618#(= 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; {1619#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:54,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {1619#(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; {1620#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:54,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {1620#(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; {1621#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:54,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {1621#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1621#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:54,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {1621#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1657#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:07:54,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {1657#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1614#false} is VALID [2022-04-28 10:07:54,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {1614#false} assume !(~y~0 % 4294967296 > 0); {1614#false} is VALID [2022-04-28 10:07:54,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {1614#false} assume !(~x~0 % 4294967296 > 0); {1614#false} is VALID [2022-04-28 10:07:54,425 INFO L272 TraceCheckUtils]: 14: Hoare triple {1614#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1614#false} is VALID [2022-04-28 10:07:54,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {1614#false} ~cond := #in~cond; {1614#false} is VALID [2022-04-28 10:07:54,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {1614#false} assume 0 == ~cond; {1614#false} is VALID [2022-04-28 10:07:54,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {1614#false} assume !false; {1614#false} is VALID [2022-04-28 10:07:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:54,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:54,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {1614#false} assume !false; {1614#false} is VALID [2022-04-28 10:07:54,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {1614#false} assume 0 == ~cond; {1614#false} is VALID [2022-04-28 10:07:54,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {1614#false} ~cond := #in~cond; {1614#false} is VALID [2022-04-28 10:07:54,568 INFO L272 TraceCheckUtils]: 14: Hoare triple {1614#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1614#false} is VALID [2022-04-28 10:07:54,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {1614#false} assume !(~x~0 % 4294967296 > 0); {1614#false} is VALID [2022-04-28 10:07:54,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {1614#false} assume !(~y~0 % 4294967296 > 0); {1614#false} is VALID [2022-04-28 10:07:54,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {1697#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1614#false} is VALID [2022-04-28 10:07:54,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {1701#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1697#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:54,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {1701#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1701#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:54,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {1708#(< 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; {1701#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:54,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {1712#(< 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; {1708#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:54,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {1716#(< 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; {1712#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:54,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {1613#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1716#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:54,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {1613#true} call #t~ret13 := main(); {1613#true} is VALID [2022-04-28 10:07:54,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1613#true} {1613#true} #72#return; {1613#true} is VALID [2022-04-28 10:07:54,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {1613#true} assume true; {1613#true} is VALID [2022-04-28 10:07:54,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {1613#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); {1613#true} is VALID [2022-04-28 10:07:54,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {1613#true} call ULTIMATE.init(); {1613#true} is VALID [2022-04-28 10:07:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:54,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503214102] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:54,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:54,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 10:07:54,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:54,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [721023452] [2022-04-28 10:07:54,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [721023452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:54,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:54,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:07:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460894130] [2022-04-28 10:07:54,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:54,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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 18 [2022-04-28 10:07:54,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:54,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-28 10:07:54,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:54,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:07:54,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:54,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:07:54,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:07:54,589 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-28 10:07:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:54,999 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2022-04-28 10:07:54,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:07:54,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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 18 [2022-04-28 10:07:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-28 10:07:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 10:07:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-28 10:07:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 10:07:55,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-28 10:07:55,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:55,059 INFO L225 Difference]: With dead ends: 62 [2022-04-28 10:07:55,059 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 10:07:55,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:07:55,060 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:55,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 47 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:07:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 10:07:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-04-28 10:07:55,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:55,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:55,107 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:55,107 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:55,109 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-04-28 10:07:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2022-04-28 10:07:55,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:55,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:55,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 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-28 10:07:55,110 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 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-28 10:07:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:55,112 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-04-28 10:07:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2022-04-28 10:07:55,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:55,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:55,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:55,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2022-04-28 10:07:55,114 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 18 [2022-04-28 10:07:55,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:55,114 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2022-04-28 10:07:55,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-28 10:07:55,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 59 transitions. [2022-04-28 10:07:55,183 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-28 10:07:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-04-28 10:07:55,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:07:55,185 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:55,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:55,202 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-28 10:07:55,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:55,391 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:55,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:55,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950584, now seen corresponding path program 1 times [2022-04-28 10:07:55,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:55,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1231665947] [2022-04-28 10:07:55,398 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:55,399 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:55,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950584, now seen corresponding path program 2 times [2022-04-28 10:07:55,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:55,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740367783] [2022-04-28 10:07:55,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:55,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:55,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:55,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {2079#(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); {2065#true} is VALID [2022-04-28 10:07:55,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 10:07:55,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2065#true} {2065#true} #72#return; {2065#true} is VALID [2022-04-28 10:07:55,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:55,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {2079#(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); {2065#true} is VALID [2022-04-28 10:07:55,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 10:07:55,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #72#return; {2065#true} is VALID [2022-04-28 10:07:55,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret13 := main(); {2065#true} is VALID [2022-04-28 10:07:55,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2070#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:07:55,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {2070#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2071#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 10:07:55,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {2071#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2072#(and (<= (+ main_~y~0 (* 8589934592 (div main_~x~0 4294967296)) 1) (* main_~n~0 2)) (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 10:07:55,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {2072#(and (<= (+ main_~y~0 (* 8589934592 (div main_~x~0 4294967296)) 1) (* main_~n~0 2)) (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 1)) (<= 1 main_~y~0))} ~z~0 := ~y~0; {2073#(and (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296)) 1) (* main_~n~0 2)) (<= 1 main_~z~0) (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 1)))} is VALID [2022-04-28 10:07:55,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {2073#(and (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296)) 1) (* main_~n~0 2)) (<= 1 main_~z~0) (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 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; {2074#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 0 main_~z~0))} is VALID [2022-04-28 10:07:55,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {2074#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2074#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 0 main_~z~0))} is VALID [2022-04-28 10:07:55,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {2074#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2075#(and (<= main_~n~0 (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 1 main_~z~0))} is VALID [2022-04-28 10:07:55,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {2075#(and (<= main_~n~0 (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {2075#(and (<= main_~n~0 (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 1 main_~z~0))} is VALID [2022-04-28 10:07:55,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {2075#(and (<= main_~n~0 (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 1 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2076#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:55,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {2076#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2076#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:55,757 INFO L272 TraceCheckUtils]: 15: Hoare triple {2076#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2077#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:07:55,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {2077#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2078#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:07:55,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {2078#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2066#false} is VALID [2022-04-28 10:07:55,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-28 10:07:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:55,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:55,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740367783] [2022-04-28 10:07:55,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740367783] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:55,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460325003] [2022-04-28 10:07:55,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:55,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:55,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:55,760 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-28 10:07:55,770 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-28 10:07:55,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:55,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:55,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:07:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:55,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:57,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-28 10:07:57,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#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); {2065#true} is VALID [2022-04-28 10:07:57,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 10:07:57,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #72#return; {2065#true} is VALID [2022-04-28 10:07:57,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret13 := main(); {2065#true} is VALID [2022-04-28 10:07:57,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2070#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:07:57,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {2070#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2071#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 10:07:57,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {2071#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2104#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 10:07:57,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {2104#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} ~z~0 := ~y~0; {2108#(and (<= (+ (* main_~x~0 2) main_~z~0 1) (* main_~n~0 2)) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~z~0))} is VALID [2022-04-28 10:07:57,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {2108#(and (<= (+ (* main_~x~0 2) main_~z~0 1) (* main_~n~0 2)) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~n~0 (+ main_~x~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; {2112#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} is VALID [2022-04-28 10:07:57,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {2112#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} assume !(~z~0 % 4294967296 > 0); {2112#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} is VALID [2022-04-28 10:07:57,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {2112#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2119#(and (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:07:57,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {2119#(and (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {2119#(and (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:07:57,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {2119#(and (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 1 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2126#(and (not (< 0 (mod main_~x~0 4294967296))) (<= main_~n~0 (+ main_~x~0 1)) (<= 2 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} is VALID [2022-04-28 10:07:57,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {2126#(and (not (< 0 (mod main_~x~0 4294967296))) (<= main_~n~0 (+ main_~x~0 1)) (<= 2 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} assume !(~x~0 % 4294967296 > 0); {2130#(and (<= (div (+ (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (div (* (- 1) main_~z~0) 2) main_~n~0) 4294967296)) (<= 2 main_~z~0))} is VALID [2022-04-28 10:07:57,586 INFO L272 TraceCheckUtils]: 15: Hoare triple {2130#(and (<= (div (+ (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (div (* (- 1) main_~z~0) 2) main_~n~0) 4294967296)) (<= 2 main_~z~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2134#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:07:57,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {2134#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2138#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:07:57,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {2138#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-28 10:07:57,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-28 10:07:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:57,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:58,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-28 10:07:58,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {2138#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-28 10:07:58,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {2134#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2138#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:07:58,324 INFO L272 TraceCheckUtils]: 15: Hoare triple {2076#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2134#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:07:58,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {2157#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {2076#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:58,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {2161#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2157#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:07:58,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {2161#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !(~y~0 % 4294967296 > 0); {2161#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-28 10:07:58,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {2168#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2161#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-28 10:07:58,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {2168#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !(~z~0 % 4294967296 > 0); {2168#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:07:58,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {2175#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2168#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:07:58,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {2179#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {2175#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:58,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {2179#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {2179#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:58,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {2186#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2179#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:58,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2186#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))))} is VALID [2022-04-28 10:07:58,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret13 := main(); {2065#true} is VALID [2022-04-28 10:07:58,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #72#return; {2065#true} is VALID [2022-04-28 10:07:58,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 10:07:58,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#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); {2065#true} is VALID [2022-04-28 10:07:58,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-28 10:07:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:58,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460325003] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:58,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:58,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 26 [2022-04-28 10:07:58,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:58,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1231665947] [2022-04-28 10:07:58,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1231665947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:58,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:58,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:07:58,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345895329] [2022-04-28 10:07:58,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:58,343 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 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 19 [2022-04-28 10:07:58,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:58,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 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-28 10:07:58,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:58,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:07:58,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:58,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:07:58,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:07:58,373 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 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-28 10:07:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:59,081 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-28 10:07:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:07:59,081 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 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 19 [2022-04-28 10:07:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 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-28 10:07:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-28 10:07:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 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-28 10:07:59,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-28 10:07:59,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2022-04-28 10:07:59,136 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-28 10:07:59,137 INFO L225 Difference]: With dead ends: 59 [2022-04-28 10:07:59,137 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 10:07:59,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=159, Invalid=1031, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:07:59,138 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:59,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 53 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:07:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 10:07:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-28 10:07:59,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:59,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:59,200 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:59,200 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:59,202 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-04-28 10:07:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2022-04-28 10:07:59,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:59,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:59,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-28 10:07:59,203 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-28 10:07:59,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:59,205 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-04-28 10:07:59,205 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2022-04-28 10:07:59,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:59,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:59,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:59,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2022-04-28 10:07:59,207 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 19 [2022-04-28 10:07:59,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:59,207 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2022-04-28 10:07:59,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 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-28 10:07:59,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 59 transitions. [2022-04-28 10:07:59,302 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-28 10:07:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2022-04-28 10:07:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:07:59,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:59,303 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:59,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 10:07:59,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:59,507 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:59,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:59,508 INFO L85 PathProgramCache]: Analyzing trace with hash 146579608, now seen corresponding path program 7 times [2022-04-28 10:07:59,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:59,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1571639194] [2022-04-28 10:07:59,511 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:59,511 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash 146579608, now seen corresponding path program 8 times [2022-04-28 10:07:59,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:59,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957155171] [2022-04-28 10:07:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:59,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:59,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:59,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {2540#(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); {2529#true} is VALID [2022-04-28 10:07:59,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {2529#true} assume true; {2529#true} is VALID [2022-04-28 10:07:59,629 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2529#true} {2529#true} #72#return; {2529#true} is VALID [2022-04-28 10:07:59,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {2529#true} call ULTIMATE.init(); {2540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:59,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {2540#(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); {2529#true} is VALID [2022-04-28 10:07:59,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {2529#true} assume true; {2529#true} is VALID [2022-04-28 10:07:59,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2529#true} {2529#true} #72#return; {2529#true} is VALID [2022-04-28 10:07:59,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {2529#true} call #t~ret13 := main(); {2529#true} is VALID [2022-04-28 10:07:59,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {2529#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2534#(= main_~y~0 0)} is VALID [2022-04-28 10:07:59,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {2534#(= 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; {2535#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:59,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {2535#(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; {2536#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:59,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#(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; {2537#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:59,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {2537#(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; {2538#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:59,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {2538#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2538#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:59,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {2538#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {2539#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:59,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {2539#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2530#false} is VALID [2022-04-28 10:07:59,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {2530#false} assume !(~y~0 % 4294967296 > 0); {2530#false} is VALID [2022-04-28 10:07:59,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {2530#false} assume !(~x~0 % 4294967296 > 0); {2530#false} is VALID [2022-04-28 10:07:59,636 INFO L272 TraceCheckUtils]: 15: Hoare triple {2530#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2530#false} is VALID [2022-04-28 10:07:59,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {2530#false} ~cond := #in~cond; {2530#false} is VALID [2022-04-28 10:07:59,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {2530#false} assume 0 == ~cond; {2530#false} is VALID [2022-04-28 10:07:59,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {2530#false} assume !false; {2530#false} is VALID [2022-04-28 10:07:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:59,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:59,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957155171] [2022-04-28 10:07:59,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957155171] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:59,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418757800] [2022-04-28 10:07:59,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:59,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:59,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:59,638 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-28 10:07:59,661 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-28 10:07:59,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:59,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:59,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:07:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:59,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:59,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {2529#true} call ULTIMATE.init(); {2529#true} is VALID [2022-04-28 10:07:59,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {2529#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); {2529#true} is VALID [2022-04-28 10:07:59,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {2529#true} assume true; {2529#true} is VALID [2022-04-28 10:07:59,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2529#true} {2529#true} #72#return; {2529#true} is VALID [2022-04-28 10:07:59,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {2529#true} call #t~ret13 := main(); {2529#true} is VALID [2022-04-28 10:07:59,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {2529#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2534#(= main_~y~0 0)} is VALID [2022-04-28 10:07:59,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {2534#(= 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; {2535#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:59,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {2535#(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; {2536#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:59,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#(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; {2537#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:59,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {2537#(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; {2538#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:59,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {2538#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2538#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:59,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {2538#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {2577#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:07:59,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {2577#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {2530#false} is VALID [2022-04-28 10:07:59,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {2530#false} assume !(~y~0 % 4294967296 > 0); {2530#false} is VALID [2022-04-28 10:07:59,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {2530#false} assume !(~x~0 % 4294967296 > 0); {2530#false} is VALID [2022-04-28 10:07:59,932 INFO L272 TraceCheckUtils]: 15: Hoare triple {2530#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2530#false} is VALID [2022-04-28 10:07:59,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {2530#false} ~cond := #in~cond; {2530#false} is VALID [2022-04-28 10:07:59,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {2530#false} assume 0 == ~cond; {2530#false} is VALID [2022-04-28 10:07:59,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {2530#false} assume !false; {2530#false} is VALID [2022-04-28 10:07:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:59,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:00,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {2530#false} assume !false; {2530#false} is VALID [2022-04-28 10:08:00,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {2530#false} assume 0 == ~cond; {2530#false} is VALID [2022-04-28 10:08:00,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {2530#false} ~cond := #in~cond; {2530#false} is VALID [2022-04-28 10:08:00,081 INFO L272 TraceCheckUtils]: 15: Hoare triple {2530#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2530#false} is VALID [2022-04-28 10:08:00,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {2530#false} assume !(~x~0 % 4294967296 > 0); {2530#false} is VALID [2022-04-28 10:08:00,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {2530#false} assume !(~y~0 % 4294967296 > 0); {2530#false} is VALID [2022-04-28 10:08:00,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {2617#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2530#false} is VALID [2022-04-28 10:08:00,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {2621#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {2617#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:00,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {2621#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2621#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:00,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {2628#(< 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; {2621#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:00,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {2632#(< 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; {2628#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:00,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {2636#(< 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; {2632#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:00,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {2640#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2636#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:00,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {2529#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2640#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:00,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {2529#true} call #t~ret13 := main(); {2529#true} is VALID [2022-04-28 10:08:00,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2529#true} {2529#true} #72#return; {2529#true} is VALID [2022-04-28 10:08:00,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {2529#true} assume true; {2529#true} is VALID [2022-04-28 10:08:00,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {2529#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); {2529#true} is VALID [2022-04-28 10:08:00,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {2529#true} call ULTIMATE.init(); {2529#true} is VALID [2022-04-28 10:08:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:00,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418757800] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:00,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:00,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 10:08:00,088 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:00,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1571639194] [2022-04-28 10:08:00,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1571639194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:00,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:00,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:08:00,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233648486] [2022-04-28 10:08:00,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:00,090 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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 19 [2022-04-28 10:08:00,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:00,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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-28 10:08:00,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:00,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:08:00,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:00,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:08:00,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:08:00,107 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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-28 10:08:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:00,674 INFO L93 Difference]: Finished difference Result 73 states and 103 transitions. [2022-04-28 10:08:00,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:08:00,675 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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 19 [2022-04-28 10:08:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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-28 10:08:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-04-28 10:08:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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-28 10:08:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-04-28 10:08:00,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 63 transitions. [2022-04-28 10:08:00,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:00,738 INFO L225 Difference]: With dead ends: 73 [2022-04-28 10:08:00,739 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 10:08:00,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:08:00,740 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:00,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 55 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:08:00,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 10:08:00,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2022-04-28 10:08:00,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:00,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:00,832 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:00,833 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:00,835 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-04-28 10:08:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-04-28 10:08:00,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:00,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:00,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-28 10:08:00,836 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-28 10:08:00,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:00,837 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-04-28 10:08:00,837 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-04-28 10:08:00,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:00,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:00,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:00,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2022-04-28 10:08:00,839 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 19 [2022-04-28 10:08:00,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:00,840 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2022-04-28 10:08:00,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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-28 10:08:00,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 69 transitions. [2022-04-28 10:08:00,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2022-04-28 10:08:00,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:08:00,919 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:00,920 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:00,937 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-28 10:08:01,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:01,124 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:01,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:01,124 INFO L85 PathProgramCache]: Analyzing trace with hash 95732656, now seen corresponding path program 3 times [2022-04-28 10:08:01,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:01,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [145714131] [2022-04-28 10:08:01,127 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:01,127 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:01,127 INFO L85 PathProgramCache]: Analyzing trace with hash 95732656, now seen corresponding path program 4 times [2022-04-28 10:08:01,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:01,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337577393] [2022-04-28 10:08:01,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:01,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:01,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:01,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {3060#(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); {3053#true} is VALID [2022-04-28 10:08:01,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {3053#true} assume true; {3053#true} is VALID [2022-04-28 10:08:01,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3053#true} {3053#true} #72#return; {3053#true} is VALID [2022-04-28 10:08:01,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {3053#true} call ULTIMATE.init(); {3060#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:01,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {3060#(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); {3053#true} is VALID [2022-04-28 10:08:01,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {3053#true} assume true; {3053#true} is VALID [2022-04-28 10:08:01,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3053#true} {3053#true} #72#return; {3053#true} is VALID [2022-04-28 10:08:01,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {3053#true} call #t~ret13 := main(); {3053#true} is VALID [2022-04-28 10:08:01,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {3053#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3053#true} is VALID [2022-04-28 10:08:01,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {3053#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3053#true} is VALID [2022-04-28 10:08:01,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {3053#true} assume !(~x~0 % 4294967296 > 0); {3058#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {3058#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3058#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {3058#(<= 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; {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3058#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {3058#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3054#false} is VALID [2022-04-28 10:08:01,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {3054#false} assume !(~x~0 % 4294967296 > 0); {3054#false} is VALID [2022-04-28 10:08:01,202 INFO L272 TraceCheckUtils]: 16: Hoare triple {3054#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3054#false} is VALID [2022-04-28 10:08:01,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {3054#false} ~cond := #in~cond; {3054#false} is VALID [2022-04-28 10:08:01,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {3054#false} assume 0 == ~cond; {3054#false} is VALID [2022-04-28 10:08:01,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {3054#false} assume !false; {3054#false} is VALID [2022-04-28 10:08:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:01,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:01,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337577393] [2022-04-28 10:08:01,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337577393] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:01,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278185341] [2022-04-28 10:08:01,203 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:01,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:01,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:01,204 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-28 10:08:01,205 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-28 10:08:01,234 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:01,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:01,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:08:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:01,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:01,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {3053#true} call ULTIMATE.init(); {3053#true} is VALID [2022-04-28 10:08:01,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {3053#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); {3053#true} is VALID [2022-04-28 10:08:01,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {3053#true} assume true; {3053#true} is VALID [2022-04-28 10:08:01,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3053#true} {3053#true} #72#return; {3053#true} is VALID [2022-04-28 10:08:01,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {3053#true} call #t~ret13 := main(); {3053#true} is VALID [2022-04-28 10:08:01,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {3053#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3053#true} is VALID [2022-04-28 10:08:01,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {3053#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3053#true} is VALID [2022-04-28 10:08:01,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {3053#true} assume !(~x~0 % 4294967296 > 0); {3058#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {3058#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3058#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {3058#(<= 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; {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3058#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {3058#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3054#false} is VALID [2022-04-28 10:08:01,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {3054#false} assume !(~x~0 % 4294967296 > 0); {3054#false} is VALID [2022-04-28 10:08:01,476 INFO L272 TraceCheckUtils]: 16: Hoare triple {3054#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3054#false} is VALID [2022-04-28 10:08:01,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {3054#false} ~cond := #in~cond; {3054#false} is VALID [2022-04-28 10:08:01,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {3054#false} assume 0 == ~cond; {3054#false} is VALID [2022-04-28 10:08:01,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {3054#false} assume !false; {3054#false} is VALID [2022-04-28 10:08:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:01,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:01,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {3054#false} assume !false; {3054#false} is VALID [2022-04-28 10:08:01,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {3054#false} assume 0 == ~cond; {3054#false} is VALID [2022-04-28 10:08:01,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {3054#false} ~cond := #in~cond; {3054#false} is VALID [2022-04-28 10:08:01,688 INFO L272 TraceCheckUtils]: 16: Hoare triple {3054#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3054#false} is VALID [2022-04-28 10:08:01,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {3054#false} assume !(~x~0 % 4294967296 > 0); {3054#false} is VALID [2022-04-28 10:08:01,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {3058#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3054#false} is VALID [2022-04-28 10:08:01,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3058#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {3058#(<= 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; {3059#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {3058#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3058#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {3053#true} assume !(~x~0 % 4294967296 > 0); {3058#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {3053#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3053#true} is VALID [2022-04-28 10:08:01,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {3053#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3053#true} is VALID [2022-04-28 10:08:01,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {3053#true} call #t~ret13 := main(); {3053#true} is VALID [2022-04-28 10:08:01,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3053#true} {3053#true} #72#return; {3053#true} is VALID [2022-04-28 10:08:01,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {3053#true} assume true; {3053#true} is VALID [2022-04-28 10:08:01,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {3053#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); {3053#true} is VALID [2022-04-28 10:08:01,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {3053#true} call ULTIMATE.init(); {3053#true} is VALID [2022-04-28 10:08:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:01,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278185341] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:01,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:01,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 10:08:01,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:01,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [145714131] [2022-04-28 10:08:01,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [145714131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:01,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:01,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:08:01,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999332838] [2022-04-28 10:08:01,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:01,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 20 [2022-04-28 10:08:01,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:01,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-28 10:08:01,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:01,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:08:01,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:01,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:08:01,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:08:01,714 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-28 10:08:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:01,931 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2022-04-28 10:08:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:08:01,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 20 [2022-04-28 10:08:01,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-28 10:08:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 10:08:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-28 10:08:01,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 10:08:01,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 10:08:01,972 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-28 10:08:01,973 INFO L225 Difference]: With dead ends: 62 [2022-04-28 10:08:01,973 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 10:08:01,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:08:01,974 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:01,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 10:08:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-28 10:08:02,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:02,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 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-28 10:08:02,052 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 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-28 10:08:02,052 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 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-28 10:08:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:02,054 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-28 10:08:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-28 10:08:02,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:02,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:02,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 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 49 states. [2022-04-28 10:08:02,055 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 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 49 states. [2022-04-28 10:08:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:02,056 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-28 10:08:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-28 10:08:02,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:02,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:02,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:02,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 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-28 10:08:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2022-04-28 10:08:02,057 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 20 [2022-04-28 10:08:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:02,058 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2022-04-28 10:08:02,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-28 10:08:02,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 65 transitions. [2022-04-28 10:08:02,142 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-28 10:08:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-28 10:08:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:08:02,143 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:02,143 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:02,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 10:08:02,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:02,344 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:02,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:02,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1285705505, now seen corresponding path program 9 times [2022-04-28 10:08:02,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:02,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1932980625] [2022-04-28 10:08:02,349 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:02,350 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:02,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1285705505, now seen corresponding path program 10 times [2022-04-28 10:08:02,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:02,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632130456] [2022-04-28 10:08:02,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:02,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:02,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:02,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {3516#(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); {3504#true} is VALID [2022-04-28 10:08:02,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {3504#true} assume true; {3504#true} is VALID [2022-04-28 10:08:02,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3504#true} {3504#true} #72#return; {3504#true} is VALID [2022-04-28 10:08:02,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {3504#true} call ULTIMATE.init(); {3516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:02,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {3516#(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); {3504#true} is VALID [2022-04-28 10:08:02,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {3504#true} assume true; {3504#true} is VALID [2022-04-28 10:08:02,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3504#true} {3504#true} #72#return; {3504#true} is VALID [2022-04-28 10:08:02,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {3504#true} call #t~ret13 := main(); {3504#true} is VALID [2022-04-28 10:08:02,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {3504#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3509#(= main_~y~0 0)} is VALID [2022-04-28 10:08:02,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {3509#(= 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; {3510#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:02,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {3510#(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; {3511#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:02,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {3511#(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; {3512#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:02,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {3512#(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; {3513#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:02,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {3513#(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; {3514#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:02,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {3514#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {3514#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:02,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {3514#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {3515#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:02,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {3515#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {3505#false} is VALID [2022-04-28 10:08:02,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {3505#false} assume !(~y~0 % 4294967296 > 0); {3505#false} is VALID [2022-04-28 10:08:02,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {3505#false} assume !(~x~0 % 4294967296 > 0); {3505#false} is VALID [2022-04-28 10:08:02,482 INFO L272 TraceCheckUtils]: 16: Hoare triple {3505#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3505#false} is VALID [2022-04-28 10:08:02,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {3505#false} ~cond := #in~cond; {3505#false} is VALID [2022-04-28 10:08:02,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {3505#false} assume 0 == ~cond; {3505#false} is VALID [2022-04-28 10:08:02,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {3505#false} assume !false; {3505#false} is VALID [2022-04-28 10:08:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:02,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:02,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632130456] [2022-04-28 10:08:02,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632130456] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:02,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535980738] [2022-04-28 10:08:02,484 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:02,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:02,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:02,486 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-28 10:08:02,487 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-28 10:08:02,517 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:02,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:02,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:08:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:02,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:02,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {3504#true} call ULTIMATE.init(); {3504#true} is VALID [2022-04-28 10:08:02,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {3504#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); {3504#true} is VALID [2022-04-28 10:08:02,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {3504#true} assume true; {3504#true} is VALID [2022-04-28 10:08:02,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3504#true} {3504#true} #72#return; {3504#true} is VALID [2022-04-28 10:08:02,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {3504#true} call #t~ret13 := main(); {3504#true} is VALID [2022-04-28 10:08:02,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {3504#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3509#(= main_~y~0 0)} is VALID [2022-04-28 10:08:02,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {3509#(= 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; {3510#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:02,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {3510#(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; {3511#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:02,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {3511#(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; {3512#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:02,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {3512#(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; {3513#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:02,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {3513#(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; {3514#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:02,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {3514#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {3514#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:02,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {3514#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {3556#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:02,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {3556#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3505#false} is VALID [2022-04-28 10:08:02,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {3505#false} assume !(~y~0 % 4294967296 > 0); {3505#false} is VALID [2022-04-28 10:08:02,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {3505#false} assume !(~x~0 % 4294967296 > 0); {3505#false} is VALID [2022-04-28 10:08:02,744 INFO L272 TraceCheckUtils]: 16: Hoare triple {3505#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3505#false} is VALID [2022-04-28 10:08:02,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {3505#false} ~cond := #in~cond; {3505#false} is VALID [2022-04-28 10:08:02,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {3505#false} assume 0 == ~cond; {3505#false} is VALID [2022-04-28 10:08:02,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {3505#false} assume !false; {3505#false} is VALID [2022-04-28 10:08:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:02,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:02,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {3505#false} assume !false; {3505#false} is VALID [2022-04-28 10:08:02,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {3505#false} assume 0 == ~cond; {3505#false} is VALID [2022-04-28 10:08:02,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {3505#false} ~cond := #in~cond; {3505#false} is VALID [2022-04-28 10:08:02,927 INFO L272 TraceCheckUtils]: 16: Hoare triple {3505#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3505#false} is VALID [2022-04-28 10:08:02,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {3505#false} assume !(~x~0 % 4294967296 > 0); {3505#false} is VALID [2022-04-28 10:08:02,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {3505#false} assume !(~y~0 % 4294967296 > 0); {3505#false} is VALID [2022-04-28 10:08:02,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {3596#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3505#false} is VALID [2022-04-28 10:08:02,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {3600#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {3596#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:02,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {3600#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3600#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:02,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {3607#(< 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; {3600#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:02,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {3611#(< 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; {3607#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:02,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {3615#(< 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; {3611#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:02,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {3619#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3615#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:02,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {3623#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3619#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:02,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {3504#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3623#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:02,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {3504#true} call #t~ret13 := main(); {3504#true} is VALID [2022-04-28 10:08:02,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3504#true} {3504#true} #72#return; {3504#true} is VALID [2022-04-28 10:08:02,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {3504#true} assume true; {3504#true} is VALID [2022-04-28 10:08:02,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {3504#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); {3504#true} is VALID [2022-04-28 10:08:02,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {3504#true} call ULTIMATE.init(); {3504#true} is VALID [2022-04-28 10:08:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:02,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535980738] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:02,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:02,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 10:08:02,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:02,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1932980625] [2022-04-28 10:08:02,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1932980625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:02,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:02,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:08:02,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686970736] [2022-04-28 10:08:02,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:02,935 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 20 [2022-04-28 10:08:02,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:02,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-28 10:08:02,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:02,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:08:02,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:02,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:08:02,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:08:02,950 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-28 10:08:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:03,598 INFO L93 Difference]: Finished difference Result 81 states and 117 transitions. [2022-04-28 10:08:03,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:08:03,598 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 20 [2022-04-28 10:08:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-28 10:08:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-04-28 10:08:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-28 10:08:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-04-28 10:08:03,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2022-04-28 10:08:03,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:03,658 INFO L225 Difference]: With dead ends: 81 [2022-04-28 10:08:03,659 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 10:08:03,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:08:03,660 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:03,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 60 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:08:03,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 10:08:03,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2022-04-28 10:08:03,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:03,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:03,754 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:03,754 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:03,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:03,756 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2022-04-28 10:08:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2022-04-28 10:08:03,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:03,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:03,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 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 70 states. [2022-04-28 10:08:03,757 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 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 70 states. [2022-04-28 10:08:03,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:03,758 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2022-04-28 10:08:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2022-04-28 10:08:03,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:03,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:03,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:03,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2022-04-28 10:08:03,760 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 20 [2022-04-28 10:08:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:03,760 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2022-04-28 10:08:03,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-28 10:08:03,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 75 transitions. [2022-04-28 10:08:03,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2022-04-28 10:08:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:08:03,849 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:03,849 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:03,868 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-28 10:08:04,049 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,SelfDestructingSolverStorable11 [2022-04-28 10:08:04,050 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:04,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:04,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1586904504, now seen corresponding path program 5 times [2022-04-28 10:08:04,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:04,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [670622305] [2022-04-28 10:08:04,053 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:04,053 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:04,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1586904504, now seen corresponding path program 6 times [2022-04-28 10:08:04,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:04,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65409497] [2022-04-28 10:08:04,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:04,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:04,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:04,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {4082#(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); {4072#true} is VALID [2022-04-28 10:08:04,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {4072#true} assume true; {4072#true} is VALID [2022-04-28 10:08:04,150 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4072#true} {4072#true} #72#return; {4072#true} is VALID [2022-04-28 10:08:04,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {4072#true} call ULTIMATE.init(); {4082#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:04,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {4082#(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); {4072#true} is VALID [2022-04-28 10:08:04,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {4072#true} assume true; {4072#true} is VALID [2022-04-28 10:08:04,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4072#true} {4072#true} #72#return; {4072#true} is VALID [2022-04-28 10:08:04,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {4072#true} call #t~ret13 := main(); {4072#true} is VALID [2022-04-28 10:08:04,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {4072#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4077#(= main_~y~0 0)} is VALID [2022-04-28 10:08:04,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {4077#(= 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; {4078#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:04,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {4078#(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; {4079#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:04,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {4079#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {4079#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:04,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {4079#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {4080#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:04,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {4080#(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; {4081#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:04,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {4081#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4073#false} is VALID [2022-04-28 10:08:04,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {4073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4073#false} is VALID [2022-04-28 10:08:04,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {4073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4073#false} is VALID [2022-04-28 10:08:04,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {4073#false} assume !(~y~0 % 4294967296 > 0); {4073#false} is VALID [2022-04-28 10:08:04,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {4073#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4073#false} is VALID [2022-04-28 10:08:04,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {4073#false} assume !(~x~0 % 4294967296 > 0); {4073#false} is VALID [2022-04-28 10:08:04,156 INFO L272 TraceCheckUtils]: 17: Hoare triple {4073#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4073#false} is VALID [2022-04-28 10:08:04,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {4073#false} ~cond := #in~cond; {4073#false} is VALID [2022-04-28 10:08:04,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {4073#false} assume 0 == ~cond; {4073#false} is VALID [2022-04-28 10:08:04,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {4073#false} assume !false; {4073#false} is VALID [2022-04-28 10:08:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:08:04,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:04,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65409497] [2022-04-28 10:08:04,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65409497] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:04,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546082721] [2022-04-28 10:08:04,156 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:04,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:04,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:04,158 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-28 10:08:04,158 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-28 10:08:04,190 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-28 10:08:04,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:04,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:08:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:04,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:04,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {4072#true} call ULTIMATE.init(); {4072#true} is VALID [2022-04-28 10:08:04,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {4072#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); {4072#true} is VALID [2022-04-28 10:08:04,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {4072#true} assume true; {4072#true} is VALID [2022-04-28 10:08:04,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4072#true} {4072#true} #72#return; {4072#true} is VALID [2022-04-28 10:08:04,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {4072#true} call #t~ret13 := main(); {4072#true} is VALID [2022-04-28 10:08:04,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {4072#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4077#(= main_~y~0 0)} is VALID [2022-04-28 10:08:04,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {4077#(= 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; {4078#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:04,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {4078#(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; {4079#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:04,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {4079#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {4079#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:04,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {4079#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {4113#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:04,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {4113#(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; {4117#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:04,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {4117#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {4073#false} is VALID [2022-04-28 10:08:04,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {4073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4073#false} is VALID [2022-04-28 10:08:04,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {4073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4073#false} is VALID [2022-04-28 10:08:04,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {4073#false} assume !(~y~0 % 4294967296 > 0); {4073#false} is VALID [2022-04-28 10:08:04,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {4073#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4073#false} is VALID [2022-04-28 10:08:04,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {4073#false} assume !(~x~0 % 4294967296 > 0); {4073#false} is VALID [2022-04-28 10:08:04,332 INFO L272 TraceCheckUtils]: 17: Hoare triple {4073#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4073#false} is VALID [2022-04-28 10:08:04,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {4073#false} ~cond := #in~cond; {4073#false} is VALID [2022-04-28 10:08:04,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {4073#false} assume 0 == ~cond; {4073#false} is VALID [2022-04-28 10:08:04,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {4073#false} assume !false; {4073#false} is VALID [2022-04-28 10:08:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:08:04,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:04,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {4073#false} assume !false; {4073#false} is VALID [2022-04-28 10:08:04,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {4073#false} assume 0 == ~cond; {4073#false} is VALID [2022-04-28 10:08:04,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {4073#false} ~cond := #in~cond; {4073#false} is VALID [2022-04-28 10:08:04,465 INFO L272 TraceCheckUtils]: 17: Hoare triple {4073#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4073#false} is VALID [2022-04-28 10:08:04,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {4073#false} assume !(~x~0 % 4294967296 > 0); {4073#false} is VALID [2022-04-28 10:08:04,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {4073#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4073#false} is VALID [2022-04-28 10:08:04,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {4073#false} assume !(~y~0 % 4294967296 > 0); {4073#false} is VALID [2022-04-28 10:08:04,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {4169#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4073#false} is VALID [2022-04-28 10:08:04,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {4173#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4169#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:04,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {4177#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4173#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:04,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {4181#(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; {4177#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:08:04,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {4072#true} ~z~0 := ~y~0; {4181#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:08:04,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {4072#true} assume !(~x~0 % 4294967296 > 0); {4072#true} is VALID [2022-04-28 10:08:04,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {4072#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4072#true} is VALID [2022-04-28 10:08:04,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {4072#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4072#true} is VALID [2022-04-28 10:08:04,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {4072#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4072#true} is VALID [2022-04-28 10:08:04,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {4072#true} call #t~ret13 := main(); {4072#true} is VALID [2022-04-28 10:08:04,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4072#true} {4072#true} #72#return; {4072#true} is VALID [2022-04-28 10:08:04,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {4072#true} assume true; {4072#true} is VALID [2022-04-28 10:08:04,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {4072#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); {4072#true} is VALID [2022-04-28 10:08:04,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {4072#true} call ULTIMATE.init(); {4072#true} is VALID [2022-04-28 10:08:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:08:04,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546082721] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:04,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:04,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-04-28 10:08:04,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:04,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [670622305] [2022-04-28 10:08:04,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [670622305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:04,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:04,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:08:04,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382646107] [2022-04-28 10:08:04,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:04,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 21 [2022-04-28 10:08:04,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:04,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-28 10:08:04,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:04,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:08:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:04,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:08:04,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:08:04,485 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-28 10:08:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:04,772 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-28 10:08:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:08:04,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 21 [2022-04-28 10:08:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-28 10:08:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 10:08:04,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-28 10:08:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 10:08:04,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 10:08:04,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:04,814 INFO L225 Difference]: With dead ends: 71 [2022-04-28 10:08:04,814 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 10:08:04,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:08:04,815 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:04,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 36 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:04,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 10:08:04,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-04-28 10:08:04,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:04,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:04,903 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:04,903 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:04,904 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2022-04-28 10:08:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2022-04-28 10:08:04,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:04,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:04,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 10:08:04,905 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 10:08:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:04,906 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2022-04-28 10:08:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2022-04-28 10:08:04,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:04,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:04,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:04,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2022-04-28 10:08:04,908 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 21 [2022-04-28 10:08:04,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:04,908 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2022-04-28 10:08:04,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-28 10:08:04,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 74 transitions. [2022-04-28 10:08:04,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 10:08:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:08:04,999 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:04,999 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:05,016 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-28 10:08:05,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 10:08:05,204 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:05,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:05,204 INFO L85 PathProgramCache]: Analyzing trace with hash 323810136, now seen corresponding path program 3 times [2022-04-28 10:08:05,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:05,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [149002521] [2022-04-28 10:08:05,207 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:05,207 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:05,207 INFO L85 PathProgramCache]: Analyzing trace with hash 323810136, now seen corresponding path program 4 times [2022-04-28 10:08:05,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:05,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976278005] [2022-04-28 10:08:05,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:05,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:05,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:05,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {4609#(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); {4600#true} is VALID [2022-04-28 10:08:05,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {4600#true} assume true; {4600#true} is VALID [2022-04-28 10:08:05,285 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4600#true} {4600#true} #72#return; {4600#true} is VALID [2022-04-28 10:08:05,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {4600#true} call ULTIMATE.init(); {4609#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:05,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {4609#(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); {4600#true} is VALID [2022-04-28 10:08:05,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {4600#true} assume true; {4600#true} is VALID [2022-04-28 10:08:05,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4600#true} {4600#true} #72#return; {4600#true} is VALID [2022-04-28 10:08:05,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {4600#true} call #t~ret13 := main(); {4600#true} is VALID [2022-04-28 10:08:05,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {4600#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4600#true} is VALID [2022-04-28 10:08:05,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {4600#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4605#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:05,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {4605#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4606#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:08:05,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {4606#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {4606#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:08:05,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {4606#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {4606#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:08:05,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {4606#(<= (* (div (+ main_~x~0 2) 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; {4607#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:08:05,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {4607#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4608#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:05,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {4608#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {4608#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:05,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {4608#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4608#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:05,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {4608#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4608#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:05,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {4608#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {4608#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:05,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {4608#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {4601#false} is VALID [2022-04-28 10:08:05,294 INFO L272 TraceCheckUtils]: 17: Hoare triple {4601#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4601#false} is VALID [2022-04-28 10:08:05,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {4601#false} ~cond := #in~cond; {4601#false} is VALID [2022-04-28 10:08:05,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {4601#false} assume 0 == ~cond; {4601#false} is VALID [2022-04-28 10:08:05,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {4601#false} assume !false; {4601#false} is VALID [2022-04-28 10:08:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:08:05,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:05,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976278005] [2022-04-28 10:08:05,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976278005] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:05,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495940918] [2022-04-28 10:08:05,295 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:05,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:05,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:05,297 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-28 10:08:05,326 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-28 10:08:05,348 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:05,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:05,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:08:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:05,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:05,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {4600#true} call ULTIMATE.init(); {4600#true} is VALID [2022-04-28 10:08:05,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {4600#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); {4600#true} is VALID [2022-04-28 10:08:05,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {4600#true} assume true; {4600#true} is VALID [2022-04-28 10:08:05,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4600#true} {4600#true} #72#return; {4600#true} is VALID [2022-04-28 10:08:05,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {4600#true} call #t~ret13 := main(); {4600#true} is VALID [2022-04-28 10:08:05,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {4600#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4600#true} is VALID [2022-04-28 10:08:05,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {4600#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4605#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:05,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {4605#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4634#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:05,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {4634#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {4634#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:05,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {4634#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {4634#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:05,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {4634#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4605#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:05,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {4605#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:05,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:05,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:05,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:05,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:05,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4601#false} is VALID [2022-04-28 10:08:05,584 INFO L272 TraceCheckUtils]: 17: Hoare triple {4601#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4601#false} is VALID [2022-04-28 10:08:05,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {4601#false} ~cond := #in~cond; {4601#false} is VALID [2022-04-28 10:08:05,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {4601#false} assume 0 == ~cond; {4601#false} is VALID [2022-04-28 10:08:05,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {4601#false} assume !false; {4601#false} is VALID [2022-04-28 10:08:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:08:05,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:05,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {4601#false} assume !false; {4601#false} is VALID [2022-04-28 10:08:05,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {4601#false} assume 0 == ~cond; {4601#false} is VALID [2022-04-28 10:08:05,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {4601#false} ~cond := #in~cond; {4601#false} is VALID [2022-04-28 10:08:05,812 INFO L272 TraceCheckUtils]: 17: Hoare triple {4601#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4601#false} is VALID [2022-04-28 10:08:05,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4601#false} is VALID [2022-04-28 10:08:05,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:05,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:05,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:05,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:05,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {4605#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4647#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:05,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {4634#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4605#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:05,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {4634#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {4634#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:05,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {4634#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {4634#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:05,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {4605#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4634#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:05,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {4600#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4605#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:05,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {4600#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4600#true} is VALID [2022-04-28 10:08:05,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {4600#true} call #t~ret13 := main(); {4600#true} is VALID [2022-04-28 10:08:05,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4600#true} {4600#true} #72#return; {4600#true} is VALID [2022-04-28 10:08:05,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {4600#true} assume true; {4600#true} is VALID [2022-04-28 10:08:05,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {4600#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); {4600#true} is VALID [2022-04-28 10:08:05,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {4600#true} call ULTIMATE.init(); {4600#true} is VALID [2022-04-28 10:08:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:08:05,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495940918] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:05,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:05,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2022-04-28 10:08:05,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:05,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [149002521] [2022-04-28 10:08:05,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [149002521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:05,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:05,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:08:05,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637085237] [2022-04-28 10:08:05,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:05,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 21 [2022-04-28 10:08:05,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:05,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-28 10:08:05,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:05,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:08:05,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:05,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:08:05,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:08:05,836 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-28 10:08:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:06,197 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2022-04-28 10:08:06,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:08:06,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 21 [2022-04-28 10:08:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-28 10:08:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-28 10:08:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-28 10:08:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-28 10:08:06,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-04-28 10:08:06,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:06,254 INFO L225 Difference]: With dead ends: 77 [2022-04-28 10:08:06,254 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 10:08:06,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:08:06,255 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:06,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 38 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 10:08:06,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-04-28 10:08:06,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:06,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 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-28 10:08:06,367 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 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-28 10:08:06,367 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 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-28 10:08:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:06,368 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2022-04-28 10:08:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2022-04-28 10:08:06,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:06,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:06,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 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 72 states. [2022-04-28 10:08:06,380 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 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 72 states. [2022-04-28 10:08:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:06,381 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2022-04-28 10:08:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2022-04-28 10:08:06,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:06,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:06,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:06,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:06,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 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-28 10:08:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2022-04-28 10:08:06,384 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 21 [2022-04-28 10:08:06,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:06,384 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2022-04-28 10:08:06,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-28 10:08:06,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 94 transitions. [2022-04-28 10:08:06,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2022-04-28 10:08:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:08:06,512 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:06,512 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:06,528 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-28 10:08:06,715 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,SelfDestructingSolverStorable13 [2022-04-28 10:08:06,715 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:06,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:06,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2056097352, now seen corresponding path program 11 times [2022-04-28 10:08:06,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:06,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1055087594] [2022-04-28 10:08:06,719 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:06,719 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2056097352, now seen corresponding path program 12 times [2022-04-28 10:08:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:06,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380800853] [2022-04-28 10:08:06,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:06,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:06,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:06,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {5196#(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); {5183#true} is VALID [2022-04-28 10:08:06,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {5183#true} assume true; {5183#true} is VALID [2022-04-28 10:08:06,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5183#true} {5183#true} #72#return; {5183#true} is VALID [2022-04-28 10:08:06,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {5183#true} call ULTIMATE.init(); {5196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:06,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {5196#(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); {5183#true} is VALID [2022-04-28 10:08:06,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {5183#true} assume true; {5183#true} is VALID [2022-04-28 10:08:06,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5183#true} {5183#true} #72#return; {5183#true} is VALID [2022-04-28 10:08:06,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {5183#true} call #t~ret13 := main(); {5183#true} is VALID [2022-04-28 10:08:06,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {5183#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5188#(= main_~y~0 0)} is VALID [2022-04-28 10:08:06,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {5188#(= 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; {5189#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:06,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {5189#(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; {5190#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:06,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {5190#(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; {5191#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:06,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {5191#(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; {5192#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:06,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {5192#(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; {5193#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:06,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {5193#(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; {5194#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:06,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {5194#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5194#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:06,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {5194#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {5195#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:06,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {5195#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5184#false} is VALID [2022-04-28 10:08:06,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {5184#false} assume !(~y~0 % 4294967296 > 0); {5184#false} is VALID [2022-04-28 10:08:06,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {5184#false} assume !(~x~0 % 4294967296 > 0); {5184#false} is VALID [2022-04-28 10:08:06,857 INFO L272 TraceCheckUtils]: 17: Hoare triple {5184#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5184#false} is VALID [2022-04-28 10:08:06,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {5184#false} ~cond := #in~cond; {5184#false} is VALID [2022-04-28 10:08:06,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {5184#false} assume 0 == ~cond; {5184#false} is VALID [2022-04-28 10:08:06,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {5184#false} assume !false; {5184#false} is VALID [2022-04-28 10:08:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:06,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:06,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380800853] [2022-04-28 10:08:06,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380800853] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:06,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905836823] [2022-04-28 10:08:06,858 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:06,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:06,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:06,900 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-28 10:08:06,900 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-28 10:08:06,940 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:08:06,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:06,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:08:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:06,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:07,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {5183#true} call ULTIMATE.init(); {5183#true} is VALID [2022-04-28 10:08:07,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {5183#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); {5183#true} is VALID [2022-04-28 10:08:07,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {5183#true} assume true; {5183#true} is VALID [2022-04-28 10:08:07,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5183#true} {5183#true} #72#return; {5183#true} is VALID [2022-04-28 10:08:07,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {5183#true} call #t~ret13 := main(); {5183#true} is VALID [2022-04-28 10:08:07,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {5183#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5188#(= main_~y~0 0)} is VALID [2022-04-28 10:08:07,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {5188#(= 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; {5189#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:07,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {5189#(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; {5190#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:07,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {5190#(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; {5191#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:07,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {5191#(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; {5192#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:07,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {5192#(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; {5193#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:07,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {5193#(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; {5194#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:07,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {5194#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5194#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:07,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {5194#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {5239#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:07,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {5239#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5184#false} is VALID [2022-04-28 10:08:07,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {5184#false} assume !(~y~0 % 4294967296 > 0); {5184#false} is VALID [2022-04-28 10:08:07,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {5184#false} assume !(~x~0 % 4294967296 > 0); {5184#false} is VALID [2022-04-28 10:08:07,165 INFO L272 TraceCheckUtils]: 17: Hoare triple {5184#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5184#false} is VALID [2022-04-28 10:08:07,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {5184#false} ~cond := #in~cond; {5184#false} is VALID [2022-04-28 10:08:07,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {5184#false} assume 0 == ~cond; {5184#false} is VALID [2022-04-28 10:08:07,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {5184#false} assume !false; {5184#false} is VALID [2022-04-28 10:08:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:07,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:07,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {5184#false} assume !false; {5184#false} is VALID [2022-04-28 10:08:07,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {5184#false} assume 0 == ~cond; {5184#false} is VALID [2022-04-28 10:08:07,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {5184#false} ~cond := #in~cond; {5184#false} is VALID [2022-04-28 10:08:07,360 INFO L272 TraceCheckUtils]: 17: Hoare triple {5184#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5184#false} is VALID [2022-04-28 10:08:07,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {5184#false} assume !(~x~0 % 4294967296 > 0); {5184#false} is VALID [2022-04-28 10:08:07,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {5184#false} assume !(~y~0 % 4294967296 > 0); {5184#false} is VALID [2022-04-28 10:08:07,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {5279#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5184#false} is VALID [2022-04-28 10:08:07,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {5283#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {5279#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:07,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {5283#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5283#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:07,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {5290#(< 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; {5283#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:07,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {5294#(< 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; {5290#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:07,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {5298#(< 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; {5294#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:07,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {5302#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5298#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:07,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {5306#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5302#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:07,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {5310#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5306#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:07,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {5183#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5310#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:07,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {5183#true} call #t~ret13 := main(); {5183#true} is VALID [2022-04-28 10:08:07,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5183#true} {5183#true} #72#return; {5183#true} is VALID [2022-04-28 10:08:07,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {5183#true} assume true; {5183#true} is VALID [2022-04-28 10:08:07,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {5183#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); {5183#true} is VALID [2022-04-28 10:08:07,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {5183#true} call ULTIMATE.init(); {5183#true} is VALID [2022-04-28 10:08:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:07,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905836823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:07,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:07,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:08:07,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:07,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1055087594] [2022-04-28 10:08:07,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1055087594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:07,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:07,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:08:07,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903782799] [2022-04-28 10:08:07,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:07,369 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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 21 [2022-04-28 10:08:07,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:07,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-28 10:08:07,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:07,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:08:07,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:07,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:08:07,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:08:07,385 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-28 10:08:08,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:08,182 INFO L93 Difference]: Finished difference Result 117 states and 172 transitions. [2022-04-28 10:08:08,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:08:08,182 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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 21 [2022-04-28 10:08:08,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-28 10:08:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 73 transitions. [2022-04-28 10:08:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-28 10:08:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 73 transitions. [2022-04-28 10:08:08,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 73 transitions. [2022-04-28 10:08:08,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:08,255 INFO L225 Difference]: With dead ends: 117 [2022-04-28 10:08:08,255 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 10:08:08,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:08:08,256 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:08,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 68 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:08:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 10:08:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 79. [2022-04-28 10:08:08,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:08,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:08,415 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:08,415 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:08,417 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2022-04-28 10:08:08,417 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2022-04-28 10:08:08,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:08,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:08,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 3 states have call successors, (3), 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 103 states. [2022-04-28 10:08:08,418 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 3 states have call successors, (3), 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 103 states. [2022-04-28 10:08:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:08,420 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2022-04-28 10:08:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2022-04-28 10:08:08,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:08,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:08,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:08,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 107 transitions. [2022-04-28 10:08:08,422 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 107 transitions. Word has length 21 [2022-04-28 10:08:08,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:08,422 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 107 transitions. [2022-04-28 10:08:08,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-28 10:08:08,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 107 transitions. [2022-04-28 10:08:08,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:08,590 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2022-04-28 10:08:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:08:08,590 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:08,590 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:08,607 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-28 10:08:08,791 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,SelfDestructingSolverStorable14 [2022-04-28 10:08:08,791 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:08,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:08,792 INFO L85 PathProgramCache]: Analyzing trace with hash 219580352, now seen corresponding path program 5 times [2022-04-28 10:08:08,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:08,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1822308251] [2022-04-28 10:08:08,796 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:08,796 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:08,796 INFO L85 PathProgramCache]: Analyzing trace with hash 219580352, now seen corresponding path program 6 times [2022-04-28 10:08:08,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:08,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278809318] [2022-04-28 10:08:08,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:08,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:08,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:08,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {5956#(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); {5945#true} is VALID [2022-04-28 10:08:08,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {5945#true} assume true; {5945#true} is VALID [2022-04-28 10:08:08,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5945#true} {5945#true} #72#return; {5945#true} is VALID [2022-04-28 10:08:08,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {5945#true} call ULTIMATE.init(); {5956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:08,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {5956#(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); {5945#true} is VALID [2022-04-28 10:08:08,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {5945#true} assume true; {5945#true} is VALID [2022-04-28 10:08:08,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5945#true} {5945#true} #72#return; {5945#true} is VALID [2022-04-28 10:08:08,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {5945#true} call #t~ret13 := main(); {5945#true} is VALID [2022-04-28 10:08:08,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {5945#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5950#(= main_~y~0 0)} is VALID [2022-04-28 10:08:08,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {5950#(= 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; {5951#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:08,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {5951#(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; {5952#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:08,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {5952#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {5952#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:08,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {5952#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {5953#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:08,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {5953#(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; {5954#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:08,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {5954#(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; {5955#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:08,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {5955#(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; {5946#false} is VALID [2022-04-28 10:08:08,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {5946#false} assume !(~z~0 % 4294967296 > 0); {5946#false} is VALID [2022-04-28 10:08:08,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {5946#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5946#false} is VALID [2022-04-28 10:08:08,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {5946#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5946#false} is VALID [2022-04-28 10:08:08,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {5946#false} assume !(~y~0 % 4294967296 > 0); {5946#false} is VALID [2022-04-28 10:08:08,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {5946#false} assume !(~x~0 % 4294967296 > 0); {5946#false} is VALID [2022-04-28 10:08:08,903 INFO L272 TraceCheckUtils]: 18: Hoare triple {5946#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5946#false} is VALID [2022-04-28 10:08:08,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {5946#false} ~cond := #in~cond; {5946#false} is VALID [2022-04-28 10:08:08,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {5946#false} assume 0 == ~cond; {5946#false} is VALID [2022-04-28 10:08:08,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {5946#false} assume !false; {5946#false} is VALID [2022-04-28 10:08:08,903 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-28 10:08:08,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:08,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278809318] [2022-04-28 10:08:08,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278809318] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:08,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003652699] [2022-04-28 10:08:08,904 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:08,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:08,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:08,905 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-28 10:08:08,906 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-28 10:08:08,948 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:08:08,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:08,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:08:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:08,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:09,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {5945#true} call ULTIMATE.init(); {5945#true} is VALID [2022-04-28 10:08:09,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {5945#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); {5945#true} is VALID [2022-04-28 10:08:09,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {5945#true} assume true; {5945#true} is VALID [2022-04-28 10:08:09,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5945#true} {5945#true} #72#return; {5945#true} is VALID [2022-04-28 10:08:09,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {5945#true} call #t~ret13 := main(); {5945#true} is VALID [2022-04-28 10:08:09,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {5945#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5950#(= main_~y~0 0)} is VALID [2022-04-28 10:08:09,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {5950#(= 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; {5951#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:09,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {5951#(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; {5952#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:09,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {5952#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {5952#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:09,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {5952#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {5987#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:09,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {5987#(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; {5991#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:09,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {5991#(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; {5995#(and (= main_~y~0 (+ main_~z~0 2)) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:09,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {5995#(and (= main_~y~0 (+ main_~z~0 2)) (<= 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; {5946#false} is VALID [2022-04-28 10:08:09,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {5946#false} assume !(~z~0 % 4294967296 > 0); {5946#false} is VALID [2022-04-28 10:08:09,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {5946#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5946#false} is VALID [2022-04-28 10:08:09,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {5946#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5946#false} is VALID [2022-04-28 10:08:09,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {5946#false} assume !(~y~0 % 4294967296 > 0); {5946#false} is VALID [2022-04-28 10:08:09,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {5946#false} assume !(~x~0 % 4294967296 > 0); {5946#false} is VALID [2022-04-28 10:08:09,083 INFO L272 TraceCheckUtils]: 18: Hoare triple {5946#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5946#false} is VALID [2022-04-28 10:08:09,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {5946#false} ~cond := #in~cond; {5946#false} is VALID [2022-04-28 10:08:09,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {5946#false} assume 0 == ~cond; {5946#false} is VALID [2022-04-28 10:08:09,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {5946#false} assume !false; {5946#false} is VALID [2022-04-28 10:08:09,084 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-28 10:08:09,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:09,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {5946#false} assume !false; {5946#false} is VALID [2022-04-28 10:08:09,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {5946#false} assume 0 == ~cond; {5946#false} is VALID [2022-04-28 10:08:09,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {5946#false} ~cond := #in~cond; {5946#false} is VALID [2022-04-28 10:08:09,254 INFO L272 TraceCheckUtils]: 18: Hoare triple {5946#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5946#false} is VALID [2022-04-28 10:08:09,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {5946#false} assume !(~x~0 % 4294967296 > 0); {5946#false} is VALID [2022-04-28 10:08:09,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {6041#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5946#false} is VALID [2022-04-28 10:08:09,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {6045#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6041#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:09,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {6049#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6045#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:09,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {6049#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6049#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:09,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {6056#(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; {6049#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:09,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {6060#(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; {6056#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:08:09,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {6064#(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; {6060#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:08:09,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {5945#true} ~z~0 := ~y~0; {6064#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:08:09,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {5945#true} assume !(~x~0 % 4294967296 > 0); {5945#true} is VALID [2022-04-28 10:08:09,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {5945#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5945#true} is VALID [2022-04-28 10:08:09,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {5945#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5945#true} is VALID [2022-04-28 10:08:09,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {5945#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5945#true} is VALID [2022-04-28 10:08:09,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {5945#true} call #t~ret13 := main(); {5945#true} is VALID [2022-04-28 10:08:09,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5945#true} {5945#true} #72#return; {5945#true} is VALID [2022-04-28 10:08:09,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {5945#true} assume true; {5945#true} is VALID [2022-04-28 10:08:09,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {5945#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); {5945#true} is VALID [2022-04-28 10:08:09,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {5945#true} call ULTIMATE.init(); {5945#true} is VALID [2022-04-28 10:08:09,260 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-28 10:08:09,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003652699] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:09,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:09,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 10:08:09,261 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:09,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1822308251] [2022-04-28 10:08:09,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1822308251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:09,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:09,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:08:09,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343379054] [2022-04-28 10:08:09,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:09,262 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 22 [2022-04-28 10:08:09,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:09,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-28 10:08:09,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:09,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:08:09,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:09,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:08:09,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:08:09,277 INFO L87 Difference]: Start difference. First operand 79 states and 107 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-28 10:08:09,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:09,741 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2022-04-28 10:08:09,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:08:09,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 22 [2022-04-28 10:08:09,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-28 10:08:09,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2022-04-28 10:08:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-28 10:08:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2022-04-28 10:08:09,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 45 transitions. [2022-04-28 10:08:09,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:09,793 INFO L225 Difference]: With dead ends: 95 [2022-04-28 10:08:09,793 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 10:08:09,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:08:09,794 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:09,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 46 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:09,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 10:08:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2022-04-28 10:08:09,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:09,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:09,932 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:09,932 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:09,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:09,933 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. [2022-04-28 10:08:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2022-04-28 10:08:09,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:09,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:09,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-28 10:08:09,934 INFO L87 Difference]: Start difference. First operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-28 10:08:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:09,936 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. [2022-04-28 10:08:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2022-04-28 10:08:09,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:09,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:09,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:09,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2022-04-28 10:08:09,938 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 22 [2022-04-28 10:08:09,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:09,938 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2022-04-28 10:08:09,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-28 10:08:09,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 104 transitions. [2022-04-28 10:08:10,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2022-04-28 10:08:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:08:10,081 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:10,081 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:10,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 10:08:10,283 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,SelfDestructingSolverStorable15 [2022-04-28 10:08:10,284 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:10,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:10,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1722196481, now seen corresponding path program 13 times [2022-04-28 10:08:10,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:10,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1725290342] [2022-04-28 10:08:10,288 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:10,288 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:10,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1722196481, now seen corresponding path program 14 times [2022-04-28 10:08:10,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:10,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645849726] [2022-04-28 10:08:10,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:10,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:10,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:10,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {6643#(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); {6629#true} is VALID [2022-04-28 10:08:10,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {6629#true} assume true; {6629#true} is VALID [2022-04-28 10:08:10,447 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6629#true} {6629#true} #72#return; {6629#true} is VALID [2022-04-28 10:08:10,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {6629#true} call ULTIMATE.init(); {6643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:10,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {6643#(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); {6629#true} is VALID [2022-04-28 10:08:10,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {6629#true} assume true; {6629#true} is VALID [2022-04-28 10:08:10,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6629#true} {6629#true} #72#return; {6629#true} is VALID [2022-04-28 10:08:10,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {6629#true} call #t~ret13 := main(); {6629#true} is VALID [2022-04-28 10:08:10,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {6629#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6634#(= main_~y~0 0)} is VALID [2022-04-28 10:08:10,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {6634#(= 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; {6635#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:10,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {6635#(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; {6636#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:10,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {6636#(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; {6637#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:10,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {6637#(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; {6638#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:10,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {6638#(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; {6639#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:10,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {6639#(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; {6640#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:10,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {6640#(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; {6641#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:10,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {6641#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {6641#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:10,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {6641#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {6642#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:10,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {6642#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {6630#false} is VALID [2022-04-28 10:08:10,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {6630#false} assume !(~y~0 % 4294967296 > 0); {6630#false} is VALID [2022-04-28 10:08:10,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {6630#false} assume !(~x~0 % 4294967296 > 0); {6630#false} is VALID [2022-04-28 10:08:10,454 INFO L272 TraceCheckUtils]: 18: Hoare triple {6630#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {6630#false} is VALID [2022-04-28 10:08:10,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {6630#false} ~cond := #in~cond; {6630#false} is VALID [2022-04-28 10:08:10,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {6630#false} assume 0 == ~cond; {6630#false} is VALID [2022-04-28 10:08:10,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {6630#false} assume !false; {6630#false} is VALID [2022-04-28 10:08:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:10,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:10,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645849726] [2022-04-28 10:08:10,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645849726] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:10,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793093249] [2022-04-28 10:08:10,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:10,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:10,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:10,460 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-28 10:08:10,461 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-28 10:08:10,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:10,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:10,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:08:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:10,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:10,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {6629#true} call ULTIMATE.init(); {6629#true} is VALID [2022-04-28 10:08:10,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {6629#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); {6629#true} is VALID [2022-04-28 10:08:10,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {6629#true} assume true; {6629#true} is VALID [2022-04-28 10:08:10,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6629#true} {6629#true} #72#return; {6629#true} is VALID [2022-04-28 10:08:10,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {6629#true} call #t~ret13 := main(); {6629#true} is VALID [2022-04-28 10:08:10,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {6629#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6634#(= main_~y~0 0)} is VALID [2022-04-28 10:08:10,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {6634#(= 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; {6635#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:10,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {6635#(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; {6636#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:10,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {6636#(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; {6637#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:10,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {6637#(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; {6638#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:10,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {6638#(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; {6639#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:10,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {6639#(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; {6640#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:10,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {6640#(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; {6641#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:10,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {6641#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {6641#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:10,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {6641#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {6689#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:10,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {6689#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6630#false} is VALID [2022-04-28 10:08:10,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {6630#false} assume !(~y~0 % 4294967296 > 0); {6630#false} is VALID [2022-04-28 10:08:10,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {6630#false} assume !(~x~0 % 4294967296 > 0); {6630#false} is VALID [2022-04-28 10:08:10,709 INFO L272 TraceCheckUtils]: 18: Hoare triple {6630#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {6630#false} is VALID [2022-04-28 10:08:10,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {6630#false} ~cond := #in~cond; {6630#false} is VALID [2022-04-28 10:08:10,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {6630#false} assume 0 == ~cond; {6630#false} is VALID [2022-04-28 10:08:10,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {6630#false} assume !false; {6630#false} is VALID [2022-04-28 10:08:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:10,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:10,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {6630#false} assume !false; {6630#false} is VALID [2022-04-28 10:08:10,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {6630#false} assume 0 == ~cond; {6630#false} is VALID [2022-04-28 10:08:10,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {6630#false} ~cond := #in~cond; {6630#false} is VALID [2022-04-28 10:08:10,920 INFO L272 TraceCheckUtils]: 18: Hoare triple {6630#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {6630#false} is VALID [2022-04-28 10:08:10,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {6630#false} assume !(~x~0 % 4294967296 > 0); {6630#false} is VALID [2022-04-28 10:08:10,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {6630#false} assume !(~y~0 % 4294967296 > 0); {6630#false} is VALID [2022-04-28 10:08:10,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {6729#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6630#false} is VALID [2022-04-28 10:08:10,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {6733#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {6729#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:10,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {6733#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6733#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:10,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {6740#(< 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; {6733#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:10,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {6744#(< 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; {6740#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:10,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {6748#(< 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; {6744#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:10,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {6752#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6748#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:10,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {6756#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6752#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:10,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {6760#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6756#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:10,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {6764#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6760#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:10,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {6629#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6764#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:10,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {6629#true} call #t~ret13 := main(); {6629#true} is VALID [2022-04-28 10:08:10,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6629#true} {6629#true} #72#return; {6629#true} is VALID [2022-04-28 10:08:10,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {6629#true} assume true; {6629#true} is VALID [2022-04-28 10:08:10,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {6629#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); {6629#true} is VALID [2022-04-28 10:08:10,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {6629#true} call ULTIMATE.init(); {6629#true} is VALID [2022-04-28 10:08:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:10,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793093249] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:10,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:10,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:08:10,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:10,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1725290342] [2022-04-28 10:08:10,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1725290342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:10,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:10,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:08:10,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126865110] [2022-04-28 10:08:10,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:10,929 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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 22 [2022-04-28 10:08:10,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:10,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:08:10,944 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-28 10:08:10,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:08:10,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:10,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:08:10,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:08:10,945 INFO L87 Difference]: Start difference. First operand 78 states and 104 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:08:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:11,904 INFO L93 Difference]: Finished difference Result 128 states and 188 transitions. [2022-04-28 10:08:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:08:11,904 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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 22 [2022-04-28 10:08:11,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:08:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2022-04-28 10:08:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:08:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2022-04-28 10:08:11,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 80 transitions. [2022-04-28 10:08:11,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:11,979 INFO L225 Difference]: With dead ends: 128 [2022-04-28 10:08:11,979 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 10:08:11,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:08:11,981 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 66 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:11,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 76 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:08:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 10:08:12,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2022-04-28 10:08:12,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:12,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:12,139 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:12,140 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:12,142 INFO L93 Difference]: Finished difference Result 114 states and 145 transitions. [2022-04-28 10:08:12,142 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 145 transitions. [2022-04-28 10:08:12,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:12,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:12,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-28 10:08:12,143 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-28 10:08:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:12,163 INFO L93 Difference]: Finished difference Result 114 states and 145 transitions. [2022-04-28 10:08:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 145 transitions. [2022-04-28 10:08:12,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:12,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:12,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:12,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2022-04-28 10:08:12,165 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 22 [2022-04-28 10:08:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:12,166 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2022-04-28 10:08:12,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:08:12,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 117 transitions. [2022-04-28 10:08:12,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2022-04-28 10:08:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:08:12,328 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:12,329 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:12,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 10:08:12,529 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,SelfDestructingSolverStorable16 [2022-04-28 10:08:12,529 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:12,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:12,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1247228840, now seen corresponding path program 7 times [2022-04-28 10:08:12,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:12,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [731542649] [2022-04-28 10:08:12,538 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:12,538 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:12,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1247228840, now seen corresponding path program 8 times [2022-04-28 10:08:12,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:12,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277438341] [2022-04-28 10:08:12,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:12,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:12,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:12,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {7478#(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); {7461#true} is VALID [2022-04-28 10:08:12,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {7461#true} assume true; {7461#true} is VALID [2022-04-28 10:08:12,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7461#true} {7461#true} #72#return; {7461#true} is VALID [2022-04-28 10:08:12,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {7461#true} call ULTIMATE.init(); {7478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:12,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {7478#(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); {7461#true} is VALID [2022-04-28 10:08:12,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {7461#true} assume true; {7461#true} is VALID [2022-04-28 10:08:12,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7461#true} {7461#true} #72#return; {7461#true} is VALID [2022-04-28 10:08:12,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {7461#true} call #t~ret13 := main(); {7461#true} is VALID [2022-04-28 10:08:12,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {7461#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7466#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:08:12,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {7466#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7467#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 10:08:12,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {7467#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 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; {7468#(and (<= 2 main_~y~0) (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:08:12,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {7468#(and (<= 2 main_~y~0) (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {7469#(and (<= main_~n~0 (+ 2 (* 4294967296 (div main_~x~0 4294967296)))) (<= 2 main_~y~0) (<= (+ main_~y~0 2 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)))} is VALID [2022-04-28 10:08:12,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {7469#(and (<= main_~n~0 (+ 2 (* 4294967296 (div main_~x~0 4294967296)))) (<= 2 main_~y~0) (<= (+ main_~y~0 2 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)))} ~z~0 := ~y~0; {7470#(and (<= main_~n~0 (+ 2 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~z~0 2 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:12,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {7470#(and (<= main_~n~0 (+ 2 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~z~0 2 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~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; {7471#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 2147483648))) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:12,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {7471#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 2147483648))) (<= 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; {7472#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296) 2147483648))) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:12,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {7472#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296) 2147483648))) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7472#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296) 2147483648))) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:12,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {7472#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296) 2147483648))) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7471#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 2147483648))) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:12,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {7471#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 2147483648))) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7473#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 2)) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:12,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {7473#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 2)) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {7473#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 2)) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:12,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {7473#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 2)) (<= 2 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {7474#(and (<= 3 main_~z~0) (<= main_~n~0 (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 2)))} is VALID [2022-04-28 10:08:12,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {7474#(and (<= 3 main_~z~0) (<= main_~n~0 (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {7475#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:12,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {7475#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {7475#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:12,874 INFO L272 TraceCheckUtils]: 19: Hoare triple {7475#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {7476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:08:12,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {7476#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7477#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:08:12,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {7477#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7462#false} is VALID [2022-04-28 10:08:12,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {7462#false} assume !false; {7462#false} is VALID [2022-04-28 10:08:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:12,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:12,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277438341] [2022-04-28 10:08:12,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277438341] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:12,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271858124] [2022-04-28 10:08:12,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:12,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:12,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:12,877 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-28 10:08:12,878 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-28 10:08:12,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:12,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:12,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:08:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:12,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:41,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {7461#true} call ULTIMATE.init(); {7461#true} is VALID [2022-04-28 10:08:41,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {7461#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); {7461#true} is VALID [2022-04-28 10:08:41,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {7461#true} assume true; {7461#true} is VALID [2022-04-28 10:08:41,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7461#true} {7461#true} #72#return; {7461#true} is VALID [2022-04-28 10:08:41,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {7461#true} call #t~ret13 := main(); {7461#true} is VALID [2022-04-28 10:08:41,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {7461#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7466#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:08:41,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {7466#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7467#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 10:08:41,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {7467#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 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; {7468#(and (<= 2 main_~y~0) (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:08:41,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {7468#(and (<= 2 main_~y~0) (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {7468#(and (<= 2 main_~y~0) (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:08:41,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {7468#(and (<= 2 main_~y~0) (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 2)))} ~z~0 := ~y~0; {7509#(and (<= (+ (* main_~x~0 2) main_~z~0 2) (* main_~n~0 2)) (<= 2 main_~z~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:08:41,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {7509#(and (<= (+ (* main_~x~0 2) main_~z~0 2) (* main_~n~0 2)) (<= 2 main_~z~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7513#(and (<= (+ (* main_~x~0 2) main_~z~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:41,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {7513#(and (<= (+ (* main_~x~0 2) main_~z~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~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; {7517#(and (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} is VALID [2022-04-28 10:08:41,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {7517#(and (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} assume !(~z~0 % 4294967296 > 0); {7517#(and (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} is VALID [2022-04-28 10:08:41,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {7517#(and (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7524#(and (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (<= main_~n~0 main_~x~0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:41,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {7524#(and (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (<= main_~n~0 main_~x~0) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7528#(and (<= main_~n~0 main_~x~0) (<= (+ (* main_~x~0 2) main_~z~0) (+ 2 (* main_~n~0 2))) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:41,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {7528#(and (<= main_~n~0 main_~x~0) (<= (+ (* main_~x~0 2) main_~z~0) (+ 2 (* main_~n~0 2))) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {7528#(and (<= main_~n~0 main_~x~0) (<= (+ (* main_~x~0 2) main_~z~0) (+ 2 (* main_~n~0 2))) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:41,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {7528#(and (<= main_~n~0 main_~x~0) (<= (+ (* main_~x~0 2) main_~z~0) (+ 2 (* main_~n~0 2))) (<= 2 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {7535#(and (<= 3 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-28 10:08:41,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {7535#(and (<= 3 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {7539#(and (<= 4 main_~z~0) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~n~0 (+ main_~x~0 2)) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} is VALID [2022-04-28 10:08:41,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {7539#(and (<= 4 main_~z~0) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~n~0 (+ main_~x~0 2)) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} assume !(~x~0 % 4294967296 > 0); {7543#(and (<= 4 main_~z~0) (< (+ (div (+ 4294967296 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 4294967294) (* (- 1) main_~n~0)) (- 4294967296))) (+ (div (+ main_~n~0 (- 4294967296) (div (+ 8589934592 (* (- 1) main_~z~0)) 2)) 4294967296) (div (+ main_~n~0 (div (+ 8589934592 (* (- 1) main_~z~0)) 2)) 4294967296) 1)))} is VALID [2022-04-28 10:08:41,121 INFO L272 TraceCheckUtils]: 19: Hoare triple {7543#(and (<= 4 main_~z~0) (< (+ (div (+ 4294967296 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 4294967294) (* (- 1) main_~n~0)) (- 4294967296))) (+ (div (+ main_~n~0 (- 4294967296) (div (+ 8589934592 (* (- 1) main_~z~0)) 2)) 4294967296) (div (+ main_~n~0 (div (+ 8589934592 (* (- 1) main_~z~0)) 2)) 4294967296) 1)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {7547#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:41,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {7547#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7551#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:41,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {7551#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7462#false} is VALID [2022-04-28 10:08:41,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {7462#false} assume !false; {7462#false} is VALID [2022-04-28 10:08:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:41,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:42,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {7462#false} assume !false; {7462#false} is VALID [2022-04-28 10:08:42,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {7551#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7462#false} is VALID [2022-04-28 10:08:42,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {7547#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7551#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:42,472 INFO L272 TraceCheckUtils]: 19: Hoare triple {7475#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {7547#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:42,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {7570#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {7475#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:42,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {7574#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {7570#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:08:42,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {7578#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {7574#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-28 10:08:42,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {7578#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !(~y~0 % 4294967296 > 0); {7578#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:08:42,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {7585#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7578#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:08:42,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {7589#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7585#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:08:42,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {7589#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7589#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:08:42,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {7596#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7589#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:08:42,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {7600#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~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; {7596#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} is VALID [2022-04-28 10:08:42,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {7604#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {7600#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:08:42,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {7604#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {7604#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:42,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {7611#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~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; {7604#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:42,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {7615#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7611#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:42,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {7461#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7615#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} is VALID [2022-04-28 10:08:42,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {7461#true} call #t~ret13 := main(); {7461#true} is VALID [2022-04-28 10:08:42,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7461#true} {7461#true} #72#return; {7461#true} is VALID [2022-04-28 10:08:42,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {7461#true} assume true; {7461#true} is VALID [2022-04-28 10:08:42,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {7461#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); {7461#true} is VALID [2022-04-28 10:08:42,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {7461#true} call ULTIMATE.init(); {7461#true} is VALID [2022-04-28 10:08:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:42,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271858124] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:42,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:42,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 35 [2022-04-28 10:08:42,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:42,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [731542649] [2022-04-28 10:08:42,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [731542649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:42,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:42,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:08:42,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926526464] [2022-04-28 10:08:42,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:42,491 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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 23 [2022-04-28 10:08:42,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:42,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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-28 10:08:42,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:42,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:08:42,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:42,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:08:42,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1094, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:08:42,515 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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-28 10:08:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:43,836 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2022-04-28 10:08:43,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:08:43,836 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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 23 [2022-04-28 10:08:43,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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-28 10:08:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 38 transitions. [2022-04-28 10:08:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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-28 10:08:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 38 transitions. [2022-04-28 10:08:43,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 38 transitions. [2022-04-28 10:08:43,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:43,897 INFO L225 Difference]: With dead ends: 98 [2022-04-28 10:08:43,897 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 10:08:43,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=191, Invalid=2065, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:08:43,898 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:43,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 68 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:08:43,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 10:08:44,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-04-28 10:08:44,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:44,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:44,126 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:44,126 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:44,128 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-28 10:08:44,128 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-28 10:08:44,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:44,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:44,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 3 states have call successors, (3), 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 93 states. [2022-04-28 10:08:44,129 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 3 states have call successors, (3), 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 93 states. [2022-04-28 10:08:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:44,130 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-28 10:08:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-28 10:08:44,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:44,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:44,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:44,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2022-04-28 10:08:44,132 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 23 [2022-04-28 10:08:44,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:44,132 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2022-04-28 10:08:44,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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-28 10:08:44,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 121 transitions. [2022-04-28 10:08:44,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:44,358 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2022-04-28 10:08:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:08:44,358 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:44,359 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:44,363 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-28 10:08:44,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:44,559 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:44,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:44,560 INFO L85 PathProgramCache]: Analyzing trace with hash -610073592, now seen corresponding path program 9 times [2022-04-28 10:08:44,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:44,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1406102218] [2022-04-28 10:08:44,572 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:44,572 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:44,572 INFO L85 PathProgramCache]: Analyzing trace with hash -610073592, now seen corresponding path program 10 times [2022-04-28 10:08:44,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:44,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772729970] [2022-04-28 10:08:44,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:44,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:44,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:44,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {8237#(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); {8226#true} is VALID [2022-04-28 10:08:44,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {8226#true} assume true; {8226#true} is VALID [2022-04-28 10:08:44,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8226#true} {8226#true} #72#return; {8226#true} is VALID [2022-04-28 10:08:44,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {8226#true} call ULTIMATE.init(); {8237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:44,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {8237#(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); {8226#true} is VALID [2022-04-28 10:08:44,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {8226#true} assume true; {8226#true} is VALID [2022-04-28 10:08:44,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8226#true} {8226#true} #72#return; {8226#true} is VALID [2022-04-28 10:08:44,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {8226#true} call #t~ret13 := main(); {8226#true} is VALID [2022-04-28 10:08:44,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {8226#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8231#(= main_~y~0 0)} is VALID [2022-04-28 10:08:44,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {8231#(= 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; {8232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:44,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {8232#(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; {8233#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:44,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {8233#(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; {8234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:44,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {8234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:44,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {8234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {8235#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:44,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {8235#(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; {8236#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:44,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {8236#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {8227#false} is VALID [2022-04-28 10:08:44,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {8227#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8227#false} is VALID [2022-04-28 10:08:44,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {8227#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8227#false} is VALID [2022-04-28 10:08:44,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {8227#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8227#false} is VALID [2022-04-28 10:08:44,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {8227#false} assume !(~y~0 % 4294967296 > 0); {8227#false} is VALID [2022-04-28 10:08:44,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {8227#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8227#false} is VALID [2022-04-28 10:08:44,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {8227#false} assume !(~x~0 % 4294967296 > 0); {8227#false} is VALID [2022-04-28 10:08:44,695 INFO L272 TraceCheckUtils]: 19: Hoare triple {8227#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {8227#false} is VALID [2022-04-28 10:08:44,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {8227#false} ~cond := #in~cond; {8227#false} is VALID [2022-04-28 10:08:44,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {8227#false} assume 0 == ~cond; {8227#false} is VALID [2022-04-28 10:08:44,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {8227#false} assume !false; {8227#false} is VALID [2022-04-28 10:08:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 10:08:44,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:44,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772729970] [2022-04-28 10:08:44,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772729970] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:44,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020592661] [2022-04-28 10:08:44,696 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:44,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:44,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:44,700 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-28 10:08:44,701 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-28 10:08:44,740 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:44,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:44,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:08:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:44,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:44,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {8226#true} call ULTIMATE.init(); {8226#true} is VALID [2022-04-28 10:08:44,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {8226#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); {8226#true} is VALID [2022-04-28 10:08:44,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {8226#true} assume true; {8226#true} is VALID [2022-04-28 10:08:44,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8226#true} {8226#true} #72#return; {8226#true} is VALID [2022-04-28 10:08:44,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {8226#true} call #t~ret13 := main(); {8226#true} is VALID [2022-04-28 10:08:44,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {8226#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8231#(= main_~y~0 0)} is VALID [2022-04-28 10:08:44,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {8231#(= 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; {8232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:44,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {8232#(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; {8233#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:44,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {8233#(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; {8234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:44,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {8234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:44,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {8234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {8271#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:44,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {8271#(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; {8275#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:44,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {8275#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {8227#false} is VALID [2022-04-28 10:08:44,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {8227#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8227#false} is VALID [2022-04-28 10:08:44,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {8227#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8227#false} is VALID [2022-04-28 10:08:44,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {8227#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8227#false} is VALID [2022-04-28 10:08:44,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {8227#false} assume !(~y~0 % 4294967296 > 0); {8227#false} is VALID [2022-04-28 10:08:44,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {8227#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8227#false} is VALID [2022-04-28 10:08:44,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {8227#false} assume !(~x~0 % 4294967296 > 0); {8227#false} is VALID [2022-04-28 10:08:44,900 INFO L272 TraceCheckUtils]: 19: Hoare triple {8227#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {8227#false} is VALID [2022-04-28 10:08:44,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {8227#false} ~cond := #in~cond; {8227#false} is VALID [2022-04-28 10:08:44,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {8227#false} assume 0 == ~cond; {8227#false} is VALID [2022-04-28 10:08:44,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {8227#false} assume !false; {8227#false} is VALID [2022-04-28 10:08:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 10:08:44,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:45,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {8227#false} assume !false; {8227#false} is VALID [2022-04-28 10:08:45,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {8227#false} assume 0 == ~cond; {8227#false} is VALID [2022-04-28 10:08:45,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {8227#false} ~cond := #in~cond; {8227#false} is VALID [2022-04-28 10:08:45,041 INFO L272 TraceCheckUtils]: 19: Hoare triple {8227#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {8227#false} is VALID [2022-04-28 10:08:45,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {8227#false} assume !(~x~0 % 4294967296 > 0); {8227#false} is VALID [2022-04-28 10:08:45,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {8227#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8227#false} is VALID [2022-04-28 10:08:45,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {8227#false} assume !(~y~0 % 4294967296 > 0); {8227#false} is VALID [2022-04-28 10:08:45,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {8227#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8227#false} is VALID [2022-04-28 10:08:45,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {8333#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8227#false} is VALID [2022-04-28 10:08:45,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {8337#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8333#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:45,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {8341#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8337#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:45,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {8345#(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; {8341#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:08:45,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {8226#true} ~z~0 := ~y~0; {8345#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:08:45,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {8226#true} assume !(~x~0 % 4294967296 > 0); {8226#true} is VALID [2022-04-28 10:08:45,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {8226#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8226#true} is VALID [2022-04-28 10:08:45,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {8226#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8226#true} is VALID [2022-04-28 10:08:45,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {8226#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8226#true} is VALID [2022-04-28 10:08:45,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {8226#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8226#true} is VALID [2022-04-28 10:08:45,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {8226#true} call #t~ret13 := main(); {8226#true} is VALID [2022-04-28 10:08:45,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8226#true} {8226#true} #72#return; {8226#true} is VALID [2022-04-28 10:08:45,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {8226#true} assume true; {8226#true} is VALID [2022-04-28 10:08:45,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {8226#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); {8226#true} is VALID [2022-04-28 10:08:45,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {8226#true} call ULTIMATE.init(); {8226#true} is VALID [2022-04-28 10:08:45,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 10:08:45,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020592661] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:45,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:45,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15 [2022-04-28 10:08:45,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:45,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1406102218] [2022-04-28 10:08:45,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1406102218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:45,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:45,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:08:45,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879232985] [2022-04-28 10:08:45,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:45,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 23 [2022-04-28 10:08:45,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:45,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-28 10:08:45,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:45,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:08:45,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:45,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:08:45,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:08:45,071 INFO L87 Difference]: Start difference. First operand 91 states and 121 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-28 10:08:45,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:45,598 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2022-04-28 10:08:45,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:08:45,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 23 [2022-04-28 10:08:45,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-28 10:08:45,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 10:08:45,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-28 10:08:45,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 10:08:45,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-28 10:08:45,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:45,646 INFO L225 Difference]: With dead ends: 114 [2022-04-28 10:08:45,646 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 10:08:45,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:08:45,647 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:45,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 45 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 10:08:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2022-04-28 10:08:45,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:45,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:45,848 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:45,848 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:45,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:45,850 INFO L93 Difference]: Finished difference Result 103 states and 133 transitions. [2022-04-28 10:08:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2022-04-28 10:08:45,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:45,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:45,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 3 states have call successors, (3), 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 103 states. [2022-04-28 10:08:45,850 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 3 states have call successors, (3), 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 103 states. [2022-04-28 10:08:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:45,855 INFO L93 Difference]: Finished difference Result 103 states and 133 transitions. [2022-04-28 10:08:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2022-04-28 10:08:45,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:45,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:45,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:45,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2022-04-28 10:08:45,859 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 23 [2022-04-28 10:08:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:45,859 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2022-04-28 10:08:45,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-28 10:08:45,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 120 transitions. [2022-04-28 10:08:46,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2022-04-28 10:08:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:08:46,088 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:46,088 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:46,109 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-28 10:08:46,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:46,300 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:46,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:46,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1409778984, now seen corresponding path program 15 times [2022-04-28 10:08:46,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:46,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1843927468] [2022-04-28 10:08:46,302 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:46,302 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1409778984, now seen corresponding path program 16 times [2022-04-28 10:08:46,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:46,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976395159] [2022-04-28 10:08:46,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:46,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:46,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:46,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {9026#(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); {9011#true} is VALID [2022-04-28 10:08:46,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {9011#true} assume true; {9011#true} is VALID [2022-04-28 10:08:46,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9011#true} {9011#true} #72#return; {9011#true} is VALID [2022-04-28 10:08:46,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {9011#true} call ULTIMATE.init(); {9026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:46,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {9026#(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); {9011#true} is VALID [2022-04-28 10:08:46,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {9011#true} assume true; {9011#true} is VALID [2022-04-28 10:08:46,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9011#true} {9011#true} #72#return; {9011#true} is VALID [2022-04-28 10:08:46,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {9011#true} call #t~ret13 := main(); {9011#true} is VALID [2022-04-28 10:08:46,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {9011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9016#(= main_~y~0 0)} is VALID [2022-04-28 10:08:46,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {9016#(= 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; {9017#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:46,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {9017#(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; {9018#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:46,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {9018#(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; {9019#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:46,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {9019#(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; {9020#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:46,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {9020#(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; {9021#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:46,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {9021#(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; {9022#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:46,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {9022#(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; {9023#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:46,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {9023#(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; {9024#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:46,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {9024#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9024#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:46,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {9024#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {9025#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:46,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {9025#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {9012#false} is VALID [2022-04-28 10:08:46,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {9012#false} assume !(~y~0 % 4294967296 > 0); {9012#false} is VALID [2022-04-28 10:08:46,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {9012#false} assume !(~x~0 % 4294967296 > 0); {9012#false} is VALID [2022-04-28 10:08:46,506 INFO L272 TraceCheckUtils]: 19: Hoare triple {9012#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {9012#false} is VALID [2022-04-28 10:08:46,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {9012#false} ~cond := #in~cond; {9012#false} is VALID [2022-04-28 10:08:46,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {9012#false} assume 0 == ~cond; {9012#false} is VALID [2022-04-28 10:08:46,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {9012#false} assume !false; {9012#false} is VALID [2022-04-28 10:08:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:46,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:46,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976395159] [2022-04-28 10:08:46,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976395159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:46,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602392888] [2022-04-28 10:08:46,507 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:46,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:46,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:46,508 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-28 10:08:46,509 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-28 10:08:46,548 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:46,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:46,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:08:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:46,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:46,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {9011#true} call ULTIMATE.init(); {9011#true} is VALID [2022-04-28 10:08:46,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {9011#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); {9011#true} is VALID [2022-04-28 10:08:46,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {9011#true} assume true; {9011#true} is VALID [2022-04-28 10:08:46,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9011#true} {9011#true} #72#return; {9011#true} is VALID [2022-04-28 10:08:46,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {9011#true} call #t~ret13 := main(); {9011#true} is VALID [2022-04-28 10:08:46,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {9011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9016#(= main_~y~0 0)} is VALID [2022-04-28 10:08:46,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {9016#(= 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; {9017#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:46,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {9017#(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; {9018#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:46,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {9018#(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; {9019#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:46,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {9019#(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; {9020#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:46,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {9020#(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; {9021#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:46,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {9021#(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; {9022#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:46,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {9022#(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; {9023#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:46,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {9023#(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; {9024#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:46,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {9024#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9024#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:46,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {9024#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {9075#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:08:46,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {9075#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {9012#false} is VALID [2022-04-28 10:08:46,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {9012#false} assume !(~y~0 % 4294967296 > 0); {9012#false} is VALID [2022-04-28 10:08:46,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {9012#false} assume !(~x~0 % 4294967296 > 0); {9012#false} is VALID [2022-04-28 10:08:46,795 INFO L272 TraceCheckUtils]: 19: Hoare triple {9012#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {9012#false} is VALID [2022-04-28 10:08:46,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {9012#false} ~cond := #in~cond; {9012#false} is VALID [2022-04-28 10:08:46,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {9012#false} assume 0 == ~cond; {9012#false} is VALID [2022-04-28 10:08:46,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {9012#false} assume !false; {9012#false} is VALID [2022-04-28 10:08:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:46,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:47,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {9012#false} assume !false; {9012#false} is VALID [2022-04-28 10:08:47,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {9012#false} assume 0 == ~cond; {9012#false} is VALID [2022-04-28 10:08:47,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {9012#false} ~cond := #in~cond; {9012#false} is VALID [2022-04-28 10:08:47,047 INFO L272 TraceCheckUtils]: 19: Hoare triple {9012#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {9012#false} is VALID [2022-04-28 10:08:47,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {9012#false} assume !(~x~0 % 4294967296 > 0); {9012#false} is VALID [2022-04-28 10:08:47,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {9012#false} assume !(~y~0 % 4294967296 > 0); {9012#false} is VALID [2022-04-28 10:08:47,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {9115#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9012#false} is VALID [2022-04-28 10:08:47,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {9119#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {9115#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:47,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {9119#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9119#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:47,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {9126#(< 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; {9119#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:47,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {9130#(< 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; {9126#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:47,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {9134#(< 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; {9130#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:47,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {9138#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9134#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:47,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {9142#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9138#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:47,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {9146#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9142#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:47,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {9150#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9146#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:47,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {9154#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9150#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:47,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {9011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9154#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:08:47,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {9011#true} call #t~ret13 := main(); {9011#true} is VALID [2022-04-28 10:08:47,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9011#true} {9011#true} #72#return; {9011#true} is VALID [2022-04-28 10:08:47,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {9011#true} assume true; {9011#true} is VALID [2022-04-28 10:08:47,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {9011#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); {9011#true} is VALID [2022-04-28 10:08:47,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {9011#true} call ULTIMATE.init(); {9011#true} is VALID [2022-04-28 10:08:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:47,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602392888] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:47,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:47,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:08:47,056 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:47,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1843927468] [2022-04-28 10:08:47,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1843927468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:47,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:47,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:08:47,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769669911] [2022-04-28 10:08:47,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:47,056 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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 23 [2022-04-28 10:08:47,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:47,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:08:47,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:47,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:08:47,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:47,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:08:47,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:08:47,076 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:08:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:48,363 INFO L93 Difference]: Finished difference Result 144 states and 210 transitions. [2022-04-28 10:08:48,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:08:48,363 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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 23 [2022-04-28 10:08:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:08:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 87 transitions. [2022-04-28 10:08:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:08:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 87 transitions. [2022-04-28 10:08:48,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 87 transitions. [2022-04-28 10:08:48,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:48,466 INFO L225 Difference]: With dead ends: 144 [2022-04-28 10:08:48,466 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 10:08:48,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:08:48,467 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 74 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:48,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 84 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:08:48,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 10:08:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 100. [2022-04-28 10:08:48,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:48,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:48,651 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:48,651 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:48,653 INFO L93 Difference]: Finished difference Result 130 states and 164 transitions. [2022-04-28 10:08:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2022-04-28 10:08:48,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:48,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:48,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-28 10:08:48,654 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-28 10:08:48,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:48,656 INFO L93 Difference]: Finished difference Result 130 states and 164 transitions. [2022-04-28 10:08:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2022-04-28 10:08:48,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:48,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:48,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:48,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 133 transitions. [2022-04-28 10:08:48,659 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 133 transitions. Word has length 23 [2022-04-28 10:08:48,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:48,659 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 133 transitions. [2022-04-28 10:08:48,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:08:48,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 133 transitions. [2022-04-28 10:08:48,886 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-28 10:08:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 133 transitions. [2022-04-28 10:08:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:08:48,887 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:48,887 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:48,903 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-28 10:08:49,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:49,087 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:49,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:49,088 INFO L85 PathProgramCache]: Analyzing trace with hash 25106720, now seen corresponding path program 11 times [2022-04-28 10:08:49,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:49,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1876675188] [2022-04-28 10:08:49,096 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:49,096 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash 25106720, now seen corresponding path program 12 times [2022-04-28 10:08:49,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:49,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342093063] [2022-04-28 10:08:49,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:49,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:49,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:49,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {9951#(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); {9943#true} is VALID [2022-04-28 10:08:49,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {9943#true} assume true; {9943#true} is VALID [2022-04-28 10:08:49,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9943#true} {9943#true} #72#return; {9943#true} is VALID [2022-04-28 10:08:49,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {9943#true} call ULTIMATE.init(); {9951#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:49,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {9951#(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); {9943#true} is VALID [2022-04-28 10:08:49,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {9943#true} assume true; {9943#true} is VALID [2022-04-28 10:08:49,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9943#true} {9943#true} #72#return; {9943#true} is VALID [2022-04-28 10:08:49,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {9943#true} call #t~ret13 := main(); {9943#true} is VALID [2022-04-28 10:08:49,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {9943#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9943#true} is VALID [2022-04-28 10:08:49,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {9943#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9943#true} is VALID [2022-04-28 10:08:49,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {9943#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9943#true} is VALID [2022-04-28 10:08:49,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {9943#true} assume !(~x~0 % 4294967296 > 0); {9948#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:49,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {9948#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9948#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:49,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {9948#(<= 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; {9949#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:49,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {9949#(<= 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; {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:49,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:49,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:49,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:49,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:49,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {9949#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:49,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {9949#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {9948#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:49,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {9948#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {9944#false} is VALID [2022-04-28 10:08:49,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {9944#false} assume !(~x~0 % 4294967296 > 0); {9944#false} is VALID [2022-04-28 10:08:49,186 INFO L272 TraceCheckUtils]: 20: Hoare triple {9944#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {9944#false} is VALID [2022-04-28 10:08:49,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {9944#false} ~cond := #in~cond; {9944#false} is VALID [2022-04-28 10:08:49,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {9944#false} assume 0 == ~cond; {9944#false} is VALID [2022-04-28 10:08:49,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {9944#false} assume !false; {9944#false} is VALID [2022-04-28 10:08:49,186 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-28 10:08:49,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:49,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342093063] [2022-04-28 10:08:49,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342093063] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:49,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233161274] [2022-04-28 10:08:49,187 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:49,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:49,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:49,188 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-28 10:08:49,188 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-28 10:08:49,223 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:08:49,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:49,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:08:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:49,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:49,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {9943#true} call ULTIMATE.init(); {9943#true} is VALID [2022-04-28 10:08:49,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {9943#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); {9943#true} is VALID [2022-04-28 10:08:49,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {9943#true} assume true; {9943#true} is VALID [2022-04-28 10:08:49,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9943#true} {9943#true} #72#return; {9943#true} is VALID [2022-04-28 10:08:49,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {9943#true} call #t~ret13 := main(); {9943#true} is VALID [2022-04-28 10:08:49,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {9943#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9943#true} is VALID [2022-04-28 10:08:49,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {9943#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9943#true} is VALID [2022-04-28 10:08:49,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {9943#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9943#true} is VALID [2022-04-28 10:08:49,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {9943#true} assume !(~x~0 % 4294967296 > 0); {9948#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:49,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {9948#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9948#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:49,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {9948#(<= 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; {9949#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:49,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {9949#(<= 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; {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:49,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:49,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:49,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:49,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:49,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {9949#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:49,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {9949#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {9948#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:49,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {9948#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {9944#false} is VALID [2022-04-28 10:08:49,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {9944#false} assume !(~x~0 % 4294967296 > 0); {9944#false} is VALID [2022-04-28 10:08:49,481 INFO L272 TraceCheckUtils]: 20: Hoare triple {9944#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {9944#false} is VALID [2022-04-28 10:08:49,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {9944#false} ~cond := #in~cond; {9944#false} is VALID [2022-04-28 10:08:49,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {9944#false} assume 0 == ~cond; {9944#false} is VALID [2022-04-28 10:08:49,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {9944#false} assume !false; {9944#false} is VALID [2022-04-28 10:08:49,482 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-28 10:08:49,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:49,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {9944#false} assume !false; {9944#false} is VALID [2022-04-28 10:08:49,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {9944#false} assume 0 == ~cond; {9944#false} is VALID [2022-04-28 10:08:49,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {9944#false} ~cond := #in~cond; {9944#false} is VALID [2022-04-28 10:08:49,705 INFO L272 TraceCheckUtils]: 20: Hoare triple {9944#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {9944#false} is VALID [2022-04-28 10:08:49,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {9944#false} assume !(~x~0 % 4294967296 > 0); {9944#false} is VALID [2022-04-28 10:08:49,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {9948#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {9944#false} is VALID [2022-04-28 10:08:49,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {9949#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {9948#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:49,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {9949#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:49,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:49,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:49,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:49,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:49,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {9949#(<= 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; {9950#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:49,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {9948#(<= 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; {9949#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:49,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {9948#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9948#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:49,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {9943#true} assume !(~x~0 % 4294967296 > 0); {9948#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:49,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {9943#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9943#true} is VALID [2022-04-28 10:08:49,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {9943#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9943#true} is VALID [2022-04-28 10:08:49,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {9943#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9943#true} is VALID [2022-04-28 10:08:49,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {9943#true} call #t~ret13 := main(); {9943#true} is VALID [2022-04-28 10:08:49,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9943#true} {9943#true} #72#return; {9943#true} is VALID [2022-04-28 10:08:49,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {9943#true} assume true; {9943#true} is VALID [2022-04-28 10:08:49,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {9943#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); {9943#true} is VALID [2022-04-28 10:08:49,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {9943#true} call ULTIMATE.init(); {9943#true} is VALID [2022-04-28 10:08:49,712 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-28 10:08:49,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233161274] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:49,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:49,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-28 10:08:49,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:49,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1876675188] [2022-04-28 10:08:49,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1876675188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:49,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:49,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:08:49,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506971274] [2022-04-28 10:08:49,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:49,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 24 [2022-04-28 10:08:49,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:49,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-28 10:08:49,737 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-28 10:08:49,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:08:49,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:49,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:08:49,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:08:49,737 INFO L87 Difference]: Start difference. First operand 100 states and 133 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-28 10:08:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:50,139 INFO L93 Difference]: Finished difference Result 109 states and 143 transitions. [2022-04-28 10:08:50,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:08:50,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 24 [2022-04-28 10:08:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-28 10:08:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-28 10:08:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-28 10:08:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-28 10:08:50,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-28 10:08:50,182 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-28 10:08:50,183 INFO L225 Difference]: With dead ends: 109 [2022-04-28 10:08:50,183 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 10:08:50,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:08:50,184 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:50,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 40 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:50,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 10:08:50,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-04-28 10:08:50,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:50,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:50,361 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:50,361 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:50,363 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2022-04-28 10:08:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2022-04-28 10:08:50,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:50,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:50,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 3 states have call successors, (3), 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 93 states. [2022-04-28 10:08:50,363 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 3 states have call successors, (3), 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 93 states. [2022-04-28 10:08:50,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:50,364 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2022-04-28 10:08:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2022-04-28 10:08:50,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:50,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:50,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:50,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2022-04-28 10:08:50,367 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 24 [2022-04-28 10:08:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:50,367 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2022-04-28 10:08:50,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-28 10:08:50,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 123 transitions. [2022-04-28 10:08:50,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2022-04-28 10:08:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:08:50,606 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:50,606 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:50,623 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-28 10:08:50,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:50,807 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:50,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:50,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1347388208, now seen corresponding path program 7 times [2022-04-28 10:08:50,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:50,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1727285760] [2022-04-28 10:08:50,810 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:50,810 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1347388208, now seen corresponding path program 8 times [2022-04-28 10:08:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:50,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361676710] [2022-04-28 10:08:50,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:50,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:50,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:50,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {10698#(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); {10687#true} is VALID [2022-04-28 10:08:50,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {10687#true} assume true; {10687#true} is VALID [2022-04-28 10:08:50,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10687#true} {10687#true} #72#return; {10687#true} is VALID [2022-04-28 10:08:50,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {10687#true} call ULTIMATE.init(); {10698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:50,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {10698#(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); {10687#true} is VALID [2022-04-28 10:08:50,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {10687#true} assume true; {10687#true} is VALID [2022-04-28 10:08:50,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10687#true} {10687#true} #72#return; {10687#true} is VALID [2022-04-28 10:08:50,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {10687#true} call #t~ret13 := main(); {10687#true} is VALID [2022-04-28 10:08:50,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {10687#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10687#true} is VALID [2022-04-28 10:08:50,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {10687#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10692#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:50,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {10692#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10693#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:08:50,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {10693#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10694#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:08:50,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {10694#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {10694#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:08:50,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {10694#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {10694#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:08:50,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {10694#(<= (* 4294967296 (div (+ main_~x~0 3) 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; {10695#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:08:50,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {10695#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10696#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:08:50,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {10696#(<= (+ 2 (* (div (+ main_~x~0 1) 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; {10697#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:50,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {10697#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {10697#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:50,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {10697#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10697#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:50,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {10697#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10697#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:50,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {10697#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10697#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:50,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {10697#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {10697#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:50,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {10697#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {10688#false} is VALID [2022-04-28 10:08:50,936 INFO L272 TraceCheckUtils]: 20: Hoare triple {10688#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {10688#false} is VALID [2022-04-28 10:08:50,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {10688#false} ~cond := #in~cond; {10688#false} is VALID [2022-04-28 10:08:50,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {10688#false} assume 0 == ~cond; {10688#false} is VALID [2022-04-28 10:08:50,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {10688#false} assume !false; {10688#false} is VALID [2022-04-28 10:08:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:08:50,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:50,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361676710] [2022-04-28 10:08:50,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361676710] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:50,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936699996] [2022-04-28 10:08:50,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:50,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:50,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:50,938 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-28 10:08:50,939 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-28 10:08:50,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:50,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:50,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:08:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:50,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:51,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {10687#true} call ULTIMATE.init(); {10687#true} is VALID [2022-04-28 10:08:51,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {10687#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); {10687#true} is VALID [2022-04-28 10:08:51,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {10687#true} assume true; {10687#true} is VALID [2022-04-28 10:08:51,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10687#true} {10687#true} #72#return; {10687#true} is VALID [2022-04-28 10:08:51,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {10687#true} call #t~ret13 := main(); {10687#true} is VALID [2022-04-28 10:08:51,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {10687#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10687#true} is VALID [2022-04-28 10:08:51,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {10687#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10692#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:51,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {10692#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10723#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:51,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {10723#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10727#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {10727#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10727#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {10727#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {10727#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {10727#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {10723#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:51,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {10723#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10692#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:51,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {10692#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10688#false} is VALID [2022-04-28 10:08:51,254 INFO L272 TraceCheckUtils]: 20: Hoare triple {10688#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {10688#false} is VALID [2022-04-28 10:08:51,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {10688#false} ~cond := #in~cond; {10688#false} is VALID [2022-04-28 10:08:51,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {10688#false} assume 0 == ~cond; {10688#false} is VALID [2022-04-28 10:08:51,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {10688#false} assume !false; {10688#false} is VALID [2022-04-28 10:08:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:08:51,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:51,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {10688#false} assume !false; {10688#false} is VALID [2022-04-28 10:08:51,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {10688#false} assume 0 == ~cond; {10688#false} is VALID [2022-04-28 10:08:51,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {10688#false} ~cond := #in~cond; {10688#false} is VALID [2022-04-28 10:08:51,480 INFO L272 TraceCheckUtils]: 20: Hoare triple {10688#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {10688#false} is VALID [2022-04-28 10:08:51,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10688#false} is VALID [2022-04-28 10:08:51,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {10692#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10743#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {10723#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10692#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:51,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {10727#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {10723#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:51,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {10727#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {10727#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {10727#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10727#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {10723#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10727#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:51,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {10692#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10723#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:51,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {10687#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10692#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:51,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {10687#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10687#true} is VALID [2022-04-28 10:08:51,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {10687#true} call #t~ret13 := main(); {10687#true} is VALID [2022-04-28 10:08:51,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10687#true} {10687#true} #72#return; {10687#true} is VALID [2022-04-28 10:08:51,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {10687#true} assume true; {10687#true} is VALID [2022-04-28 10:08:51,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {10687#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); {10687#true} is VALID [2022-04-28 10:08:51,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {10687#true} call ULTIMATE.init(); {10687#true} is VALID [2022-04-28 10:08:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:08:51,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936699996] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:51,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:51,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-04-28 10:08:51,489 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:51,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1727285760] [2022-04-28 10:08:51,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1727285760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:51,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:51,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:08:51,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092753271] [2022-04-28 10:08:51,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:51,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 24 [2022-04-28 10:08:51,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:51,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-28 10:08:51,509 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-28 10:08:51,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:08:51,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:51,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:08:51,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:08:51,510 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-28 10:08:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:52,173 INFO L93 Difference]: Finished difference Result 119 states and 164 transitions. [2022-04-28 10:08:52,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:08:52,173 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 24 [2022-04-28 10:08:52,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-28 10:08:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 10:08:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-28 10:08:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 10:08:52,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-28 10:08:52,254 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-28 10:08:52,256 INFO L225 Difference]: With dead ends: 119 [2022-04-28 10:08:52,256 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 10:08:52,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:08:52,257 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:52,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 56 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:08:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 10:08:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2022-04-28 10:08:52,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:52,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:52,555 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:52,555 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:52,558 INFO L93 Difference]: Finished difference Result 114 states and 157 transitions. [2022-04-28 10:08:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 157 transitions. [2022-04-28 10:08:52,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:52,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:52,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-28 10:08:52,559 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-28 10:08:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:52,561 INFO L93 Difference]: Finished difference Result 114 states and 157 transitions. [2022-04-28 10:08:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 157 transitions. [2022-04-28 10:08:52,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:52,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:52,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:52,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 151 transitions. [2022-04-28 10:08:52,564 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 151 transitions. Word has length 24 [2022-04-28 10:08:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:52,564 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 151 transitions. [2022-04-28 10:08:52,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-28 10:08:52,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 151 transitions. [2022-04-28 10:08:52,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:52,829 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 151 transitions. [2022-04-28 10:08:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:08:52,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:52,829 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:52,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 10:08:53,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:53,030 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:53,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:53,030 INFO L85 PathProgramCache]: Analyzing trace with hash 283229409, now seen corresponding path program 17 times [2022-04-28 10:08:53,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:53,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1747377636] [2022-04-28 10:08:53,032 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:53,032 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:53,033 INFO L85 PathProgramCache]: Analyzing trace with hash 283229409, now seen corresponding path program 18 times [2022-04-28 10:08:53,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:53,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491647825] [2022-04-28 10:08:53,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:53,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:53,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:53,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {11561#(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); {11545#true} is VALID [2022-04-28 10:08:53,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {11545#true} assume true; {11545#true} is VALID [2022-04-28 10:08:53,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11545#true} {11545#true} #72#return; {11545#true} is VALID [2022-04-28 10:08:53,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {11545#true} call ULTIMATE.init(); {11561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:53,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {11561#(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); {11545#true} is VALID [2022-04-28 10:08:53,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {11545#true} assume true; {11545#true} is VALID [2022-04-28 10:08:53,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11545#true} {11545#true} #72#return; {11545#true} is VALID [2022-04-28 10:08:53,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {11545#true} call #t~ret13 := main(); {11545#true} is VALID [2022-04-28 10:08:53,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {11545#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11550#(= main_~y~0 0)} is VALID [2022-04-28 10:08:53,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {11550#(= 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; {11551#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:53,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {11551#(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; {11552#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:53,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {11552#(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; {11553#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:53,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {11553#(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; {11554#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:53,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {11554#(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; {11555#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:53,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {11555#(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; {11556#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:53,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {11556#(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; {11557#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:53,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {11557#(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; {11558#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:53,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {11558#(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; {11559#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:53,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {11559#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {11559#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:53,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {11559#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {11560#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:53,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {11560#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {11546#false} is VALID [2022-04-28 10:08:53,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {11546#false} assume !(~y~0 % 4294967296 > 0); {11546#false} is VALID [2022-04-28 10:08:53,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {11546#false} assume !(~x~0 % 4294967296 > 0); {11546#false} is VALID [2022-04-28 10:08:53,254 INFO L272 TraceCheckUtils]: 20: Hoare triple {11546#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {11546#false} is VALID [2022-04-28 10:08:53,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {11546#false} ~cond := #in~cond; {11546#false} is VALID [2022-04-28 10:08:53,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {11546#false} assume 0 == ~cond; {11546#false} is VALID [2022-04-28 10:08:53,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {11546#false} assume !false; {11546#false} is VALID [2022-04-28 10:08:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:53,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:53,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491647825] [2022-04-28 10:08:53,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491647825] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:53,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948345892] [2022-04-28 10:08:53,255 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:53,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:53,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:53,256 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-28 10:08:53,258 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-28 10:08:53,322 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:08:53,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:53,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:08:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:53,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:53,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {11545#true} call ULTIMATE.init(); {11545#true} is VALID [2022-04-28 10:08:53,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {11545#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); {11545#true} is VALID [2022-04-28 10:08:53,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {11545#true} assume true; {11545#true} is VALID [2022-04-28 10:08:53,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11545#true} {11545#true} #72#return; {11545#true} is VALID [2022-04-28 10:08:53,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {11545#true} call #t~ret13 := main(); {11545#true} is VALID [2022-04-28 10:08:53,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {11545#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11550#(= main_~y~0 0)} is VALID [2022-04-28 10:08:53,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {11550#(= 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; {11551#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:53,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {11551#(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; {11552#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:53,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {11552#(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; {11553#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:53,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {11553#(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; {11554#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:53,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {11554#(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; {11555#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:53,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {11555#(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; {11556#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:53,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {11556#(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; {11557#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:53,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {11557#(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; {11558#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:53,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {11558#(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; {11559#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:53,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {11559#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {11559#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:53,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {11559#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {11613#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:53,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {11613#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {11546#false} is VALID [2022-04-28 10:08:53,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {11546#false} assume !(~y~0 % 4294967296 > 0); {11546#false} is VALID [2022-04-28 10:08:53,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {11546#false} assume !(~x~0 % 4294967296 > 0); {11546#false} is VALID [2022-04-28 10:08:53,572 INFO L272 TraceCheckUtils]: 20: Hoare triple {11546#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {11546#false} is VALID [2022-04-28 10:08:53,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {11546#false} ~cond := #in~cond; {11546#false} is VALID [2022-04-28 10:08:53,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {11546#false} assume 0 == ~cond; {11546#false} is VALID [2022-04-28 10:08:53,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {11546#false} assume !false; {11546#false} is VALID [2022-04-28 10:08:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:53,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:53,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {11546#false} assume !false; {11546#false} is VALID [2022-04-28 10:08:53,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {11546#false} assume 0 == ~cond; {11546#false} is VALID [2022-04-28 10:08:53,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {11546#false} ~cond := #in~cond; {11546#false} is VALID [2022-04-28 10:08:53,853 INFO L272 TraceCheckUtils]: 20: Hoare triple {11546#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {11546#false} is VALID [2022-04-28 10:08:53,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {11546#false} assume !(~x~0 % 4294967296 > 0); {11546#false} is VALID [2022-04-28 10:08:53,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {11546#false} assume !(~y~0 % 4294967296 > 0); {11546#false} is VALID [2022-04-28 10:08:53,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {11653#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11546#false} is VALID [2022-04-28 10:08:53,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {11657#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {11653#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:53,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {11657#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11657#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:53,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {11664#(< 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; {11657#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:53,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {11668#(< 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; {11664#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:53,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {11672#(< 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; {11668#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:53,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {11676#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11672#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:53,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {11680#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11676#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:53,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {11684#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11680#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:53,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {11688#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11684#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:53,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {11692#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11688#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:53,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {11696#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11692#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:08:53,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {11545#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11696#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:08:53,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {11545#true} call #t~ret13 := main(); {11545#true} is VALID [2022-04-28 10:08:53,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11545#true} {11545#true} #72#return; {11545#true} is VALID [2022-04-28 10:08:53,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {11545#true} assume true; {11545#true} is VALID [2022-04-28 10:08:53,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {11545#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); {11545#true} is VALID [2022-04-28 10:08:53,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {11545#true} call ULTIMATE.init(); {11545#true} is VALID [2022-04-28 10:08:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:53,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948345892] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:53,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:53,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:08:53,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:53,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1747377636] [2022-04-28 10:08:53,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1747377636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:53,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:53,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:08:53,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588037755] [2022-04-28 10:08:53,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:53,862 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 24 [2022-04-28 10:08:53,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:53,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:08:53,878 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-28 10:08:53,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:08:53,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:53,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:08:53,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:08:53,879 INFO L87 Difference]: Start difference. First operand 111 states and 151 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:08:55,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:55,381 INFO L93 Difference]: Finished difference Result 183 states and 275 transitions. [2022-04-28 10:08:55,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:08:55,381 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 24 [2022-04-28 10:08:55,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:08:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 90 transitions. [2022-04-28 10:08:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:08:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 90 transitions. [2022-04-28 10:08:55,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 90 transitions. [2022-04-28 10:08:55,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:55,484 INFO L225 Difference]: With dead ends: 183 [2022-04-28 10:08:55,484 INFO L226 Difference]: Without dead ends: 166 [2022-04-28 10:08:55,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:08:55,485 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 74 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:55,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 89 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:08:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-28 10:08:55,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 122. [2022-04-28 10:08:55,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:55,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:55,801 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:55,801 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:55,804 INFO L93 Difference]: Finished difference Result 166 states and 212 transitions. [2022-04-28 10:08:55,804 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2022-04-28 10:08:55,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:55,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:55,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 3 states have call successors, (3), 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 166 states. [2022-04-28 10:08:55,805 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 3 states have call successors, (3), 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 166 states. [2022-04-28 10:08:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:55,808 INFO L93 Difference]: Finished difference Result 166 states and 212 transitions. [2022-04-28 10:08:55,808 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2022-04-28 10:08:55,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:55,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:55,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:55,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:55,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 167 transitions. [2022-04-28 10:08:55,811 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 167 transitions. Word has length 24 [2022-04-28 10:08:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:55,811 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 167 transitions. [2022-04-28 10:08:55,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:08:55,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 167 transitions. [2022-04-28 10:08:56,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 167 transitions. [2022-04-28 10:08:56,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:08:56,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:56,170 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:56,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-28 10:08:56,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:56,370 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:56,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:56,371 INFO L85 PathProgramCache]: Analyzing trace with hash 467119846, now seen corresponding path program 13 times [2022-04-28 10:08:56,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:56,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2015957015] [2022-04-28 10:08:56,373 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:56,373 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:56,373 INFO L85 PathProgramCache]: Analyzing trace with hash 467119846, now seen corresponding path program 14 times [2022-04-28 10:08:56,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:56,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080660555] [2022-04-28 10:08:56,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:56,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:56,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:56,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {12693#(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); {12681#true} is VALID [2022-04-28 10:08:56,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {12681#true} assume true; {12681#true} is VALID [2022-04-28 10:08:56,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12681#true} {12681#true} #72#return; {12681#true} is VALID [2022-04-28 10:08:56,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {12681#true} call ULTIMATE.init(); {12693#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:56,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {12693#(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); {12681#true} is VALID [2022-04-28 10:08:56,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {12681#true} assume true; {12681#true} is VALID [2022-04-28 10:08:56,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12681#true} {12681#true} #72#return; {12681#true} is VALID [2022-04-28 10:08:56,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {12681#true} call #t~ret13 := main(); {12681#true} is VALID [2022-04-28 10:08:56,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {12681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12686#(= main_~y~0 0)} is VALID [2022-04-28 10:08:56,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {12686#(= 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; {12687#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:56,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {12687#(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; {12688#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:56,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {12688#(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; {12689#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:56,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {12689#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12689#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:56,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {12689#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {12690#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:56,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {12690#(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; {12691#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:56,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {12691#(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; {12692#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:56,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {12692#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {12682#false} is VALID [2022-04-28 10:08:56,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {12682#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12682#false} is VALID [2022-04-28 10:08:56,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {12682#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12682#false} is VALID [2022-04-28 10:08:56,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {12682#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12682#false} is VALID [2022-04-28 10:08:56,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {12682#false} assume !(~y~0 % 4294967296 > 0); {12682#false} is VALID [2022-04-28 10:08:56,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {12682#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12682#false} is VALID [2022-04-28 10:08:56,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {12682#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12682#false} is VALID [2022-04-28 10:08:56,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {12682#false} assume !(~x~0 % 4294967296 > 0); {12682#false} is VALID [2022-04-28 10:08:56,504 INFO L272 TraceCheckUtils]: 21: Hoare triple {12682#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {12682#false} is VALID [2022-04-28 10:08:56,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {12682#false} ~cond := #in~cond; {12682#false} is VALID [2022-04-28 10:08:56,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {12682#false} assume 0 == ~cond; {12682#false} is VALID [2022-04-28 10:08:56,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {12682#false} assume !false; {12682#false} is VALID [2022-04-28 10:08:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:08:56,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:56,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080660555] [2022-04-28 10:08:56,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080660555] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:56,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079839945] [2022-04-28 10:08:56,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:56,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:56,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:56,508 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-28 10:08:56,532 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-28 10:08:56,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:56,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:56,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 10:08:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:56,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:56,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {12681#true} call ULTIMATE.init(); {12681#true} is VALID [2022-04-28 10:08:56,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {12681#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); {12681#true} is VALID [2022-04-28 10:08:56,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {12681#true} assume true; {12681#true} is VALID [2022-04-28 10:08:56,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12681#true} {12681#true} #72#return; {12681#true} is VALID [2022-04-28 10:08:56,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {12681#true} call #t~ret13 := main(); {12681#true} is VALID [2022-04-28 10:08:56,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {12681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12686#(= main_~y~0 0)} is VALID [2022-04-28 10:08:56,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {12686#(= 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; {12687#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:56,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {12687#(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; {12688#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:56,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {12688#(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; {12689#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:56,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {12689#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12689#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:56,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {12689#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {12727#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:56,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {12727#(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; {12731#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:56,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {12731#(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; {12735#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:56,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {12735#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {12682#false} is VALID [2022-04-28 10:08:56,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {12682#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12682#false} is VALID [2022-04-28 10:08:56,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {12682#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12682#false} is VALID [2022-04-28 10:08:56,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {12682#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12682#false} is VALID [2022-04-28 10:08:56,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {12682#false} assume !(~y~0 % 4294967296 > 0); {12682#false} is VALID [2022-04-28 10:08:56,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {12682#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12682#false} is VALID [2022-04-28 10:08:56,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {12682#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12682#false} is VALID [2022-04-28 10:08:56,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {12682#false} assume !(~x~0 % 4294967296 > 0); {12682#false} is VALID [2022-04-28 10:08:56,708 INFO L272 TraceCheckUtils]: 21: Hoare triple {12682#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {12682#false} is VALID [2022-04-28 10:08:56,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {12682#false} ~cond := #in~cond; {12682#false} is VALID [2022-04-28 10:08:56,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {12682#false} assume 0 == ~cond; {12682#false} is VALID [2022-04-28 10:08:56,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {12682#false} assume !false; {12682#false} is VALID [2022-04-28 10:08:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:08:56,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:56,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {12682#false} assume !false; {12682#false} is VALID [2022-04-28 10:08:56,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {12682#false} assume 0 == ~cond; {12682#false} is VALID [2022-04-28 10:08:56,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {12682#false} ~cond := #in~cond; {12682#false} is VALID [2022-04-28 10:08:56,879 INFO L272 TraceCheckUtils]: 21: Hoare triple {12682#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {12682#false} is VALID [2022-04-28 10:08:56,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {12682#false} assume !(~x~0 % 4294967296 > 0); {12682#false} is VALID [2022-04-28 10:08:56,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {12682#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12682#false} is VALID [2022-04-28 10:08:56,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {12682#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12682#false} is VALID [2022-04-28 10:08:56,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {12682#false} assume !(~y~0 % 4294967296 > 0); {12682#false} is VALID [2022-04-28 10:08:56,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {12796#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12682#false} is VALID [2022-04-28 10:08:56,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {12800#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12796#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:56,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {12804#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12800#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:56,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {12808#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {12804#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:08:56,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {12812#(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; {12808#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:08:56,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {12816#(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; {12812#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:56,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {12681#true} ~z~0 := ~y~0; {12816#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:08:56,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {12681#true} assume !(~x~0 % 4294967296 > 0); {12681#true} is VALID [2022-04-28 10:08:56,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {12681#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12681#true} is VALID [2022-04-28 10:08:56,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {12681#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12681#true} is VALID [2022-04-28 10:08:56,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {12681#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12681#true} is VALID [2022-04-28 10:08:56,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {12681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12681#true} is VALID [2022-04-28 10:08:56,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {12681#true} call #t~ret13 := main(); {12681#true} is VALID [2022-04-28 10:08:56,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12681#true} {12681#true} #72#return; {12681#true} is VALID [2022-04-28 10:08:56,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {12681#true} assume true; {12681#true} is VALID [2022-04-28 10:08:56,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {12681#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); {12681#true} is VALID [2022-04-28 10:08:56,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {12681#true} call ULTIMATE.init(); {12681#true} is VALID [2022-04-28 10:08:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:08:56,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079839945] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:56,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:56,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-04-28 10:08:56,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:56,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2015957015] [2022-04-28 10:08:56,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2015957015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:56,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:56,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:08:56,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977084643] [2022-04-28 10:08:56,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:56,886 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 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 25 [2022-04-28 10:08:56,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:56,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:56,902 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-28 10:08:56,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:08:56,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:56,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:08:56,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:08:56,903 INFO L87 Difference]: Start difference. First operand 122 states and 167 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:57,519 INFO L93 Difference]: Finished difference Result 147 states and 192 transitions. [2022-04-28 10:08:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:08:57,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 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 25 [2022-04-28 10:08:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-04-28 10:08:57,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-04-28 10:08:57,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 46 transitions. [2022-04-28 10:08:57,572 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-28 10:08:57,574 INFO L225 Difference]: With dead ends: 147 [2022-04-28 10:08:57,574 INFO L226 Difference]: Without dead ends: 135 [2022-04-28 10:08:57,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:08:57,575 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:57,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 43 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:57,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-28 10:08:57,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 122. [2022-04-28 10:08:57,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:57,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 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-28 10:08:57,939 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 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-28 10:08:57,939 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 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-28 10:08:57,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:57,941 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2022-04-28 10:08:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2022-04-28 10:08:57,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:57,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:57,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 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 135 states. [2022-04-28 10:08:57,942 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 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 135 states. [2022-04-28 10:08:57,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:57,944 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2022-04-28 10:08:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2022-04-28 10:08:57,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:57,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:57,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:57,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 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-28 10:08:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 166 transitions. [2022-04-28 10:08:57,947 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 166 transitions. Word has length 25 [2022-04-28 10:08:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:57,947 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 166 transitions. [2022-04-28 10:08:57,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:57,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 166 transitions. [2022-04-28 10:08:58,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:58,352 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2022-04-28 10:08:58,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:08:58,352 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:58,352 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:58,375 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-28 10:08:58,553 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,SelfDestructingSolverStorable23 [2022-04-28 10:08:58,553 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:58,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:58,553 INFO L85 PathProgramCache]: Analyzing trace with hash -782542170, now seen corresponding path program 9 times [2022-04-28 10:08:58,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:58,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1929174939] [2022-04-28 10:08:58,556 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:58,556 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:58,557 INFO L85 PathProgramCache]: Analyzing trace with hash -782542170, now seen corresponding path program 10 times [2022-04-28 10:08:58,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:58,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16566429] [2022-04-28 10:08:58,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:58,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:58,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:58,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {13687#(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); {13674#true} is VALID [2022-04-28 10:08:58,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {13674#true} assume true; {13674#true} is VALID [2022-04-28 10:08:58,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13674#true} {13674#true} #72#return; {13674#true} is VALID [2022-04-28 10:08:58,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {13674#true} call ULTIMATE.init(); {13687#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:58,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {13687#(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); {13674#true} is VALID [2022-04-28 10:08:58,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {13674#true} assume true; {13674#true} is VALID [2022-04-28 10:08:58,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13674#true} {13674#true} #72#return; {13674#true} is VALID [2022-04-28 10:08:58,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {13674#true} call #t~ret13 := main(); {13674#true} is VALID [2022-04-28 10:08:58,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {13674#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13679#(= main_~y~0 0)} is VALID [2022-04-28 10:08:58,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {13679#(= 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; {13680#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:58,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {13680#(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; {13681#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:58,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {13681#(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; {13682#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:58,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {13682#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13682#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:58,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {13682#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {13683#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:58,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {13683#(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; {13684#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:58,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {13684#(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; {13685#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:58,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {13685#(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; {13686#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:58,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {13686#(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; {13675#false} is VALID [2022-04-28 10:08:58,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {13675#false} assume !(~z~0 % 4294967296 > 0); {13675#false} is VALID [2022-04-28 10:08:58,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {13675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13675#false} is VALID [2022-04-28 10:08:58,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {13675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13675#false} is VALID [2022-04-28 10:08:58,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {13675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13675#false} is VALID [2022-04-28 10:08:58,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {13675#false} assume !(~y~0 % 4294967296 > 0); {13675#false} is VALID [2022-04-28 10:08:58,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {13675#false} assume !(~x~0 % 4294967296 > 0); {13675#false} is VALID [2022-04-28 10:08:58,698 INFO L272 TraceCheckUtils]: 21: Hoare triple {13675#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {13675#false} is VALID [2022-04-28 10:08:58,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {13675#false} ~cond := #in~cond; {13675#false} is VALID [2022-04-28 10:08:58,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {13675#false} assume 0 == ~cond; {13675#false} is VALID [2022-04-28 10:08:58,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {13675#false} assume !false; {13675#false} is VALID [2022-04-28 10:08:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:08:58,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:58,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16566429] [2022-04-28 10:08:58,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16566429] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:58,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595558444] [2022-04-28 10:08:58,699 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:58,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:58,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:58,704 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-28 10:08:58,711 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-28 10:08:58,753 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:58,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:58,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:08:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:58,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:58,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {13674#true} call ULTIMATE.init(); {13674#true} is VALID [2022-04-28 10:08:58,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {13674#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); {13674#true} is VALID [2022-04-28 10:08:58,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {13674#true} assume true; {13674#true} is VALID [2022-04-28 10:08:58,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13674#true} {13674#true} #72#return; {13674#true} is VALID [2022-04-28 10:08:58,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {13674#true} call #t~ret13 := main(); {13674#true} is VALID [2022-04-28 10:08:58,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {13674#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13679#(= main_~y~0 0)} is VALID [2022-04-28 10:08:58,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {13679#(= 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; {13680#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:58,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {13680#(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; {13681#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:58,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {13681#(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; {13682#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:58,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {13682#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13682#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:58,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {13682#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {13721#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:58,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {13721#(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; {13725#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:58,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {13725#(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; {13729#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:08:58,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {13729#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ 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; {13733#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:58,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {13733#(and (= (+ main_~z~0 2) (+ (- 1) 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; {13675#false} is VALID [2022-04-28 10:08:58,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {13675#false} assume !(~z~0 % 4294967296 > 0); {13675#false} is VALID [2022-04-28 10:08:58,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {13675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13675#false} is VALID [2022-04-28 10:08:58,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {13675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13675#false} is VALID [2022-04-28 10:08:58,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {13675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13675#false} is VALID [2022-04-28 10:08:58,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {13675#false} assume !(~y~0 % 4294967296 > 0); {13675#false} is VALID [2022-04-28 10:08:58,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {13675#false} assume !(~x~0 % 4294967296 > 0); {13675#false} is VALID [2022-04-28 10:08:58,960 INFO L272 TraceCheckUtils]: 21: Hoare triple {13675#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {13675#false} is VALID [2022-04-28 10:08:58,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {13675#false} ~cond := #in~cond; {13675#false} is VALID [2022-04-28 10:08:58,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {13675#false} assume 0 == ~cond; {13675#false} is VALID [2022-04-28 10:08:58,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {13675#false} assume !false; {13675#false} is VALID [2022-04-28 10:08:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:08:58,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:59,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {13675#false} assume !false; {13675#false} is VALID [2022-04-28 10:08:59,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {13675#false} assume 0 == ~cond; {13675#false} is VALID [2022-04-28 10:08:59,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {13675#false} ~cond := #in~cond; {13675#false} is VALID [2022-04-28 10:08:59,216 INFO L272 TraceCheckUtils]: 21: Hoare triple {13675#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {13675#false} is VALID [2022-04-28 10:08:59,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {13675#false} assume !(~x~0 % 4294967296 > 0); {13675#false} is VALID [2022-04-28 10:08:59,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {13782#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {13675#false} is VALID [2022-04-28 10:08:59,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {13786#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13782#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:59,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {13790#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13786#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:59,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {13794#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13790#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:59,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {13794#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {13794#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:08:59,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {13801#(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; {13794#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:08:59,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {13805#(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; {13801#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:08:59,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {13809#(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; {13805#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:08:59,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {13813#(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; {13809#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:08:59,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {13674#true} ~z~0 := ~y~0; {13813#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:08:59,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {13674#true} assume !(~x~0 % 4294967296 > 0); {13674#true} is VALID [2022-04-28 10:08:59,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {13674#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13674#true} is VALID [2022-04-28 10:08:59,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {13674#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13674#true} is VALID [2022-04-28 10:08:59,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {13674#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13674#true} is VALID [2022-04-28 10:08:59,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {13674#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13674#true} is VALID [2022-04-28 10:08:59,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {13674#true} call #t~ret13 := main(); {13674#true} is VALID [2022-04-28 10:08:59,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13674#true} {13674#true} #72#return; {13674#true} is VALID [2022-04-28 10:08:59,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {13674#true} assume true; {13674#true} is VALID [2022-04-28 10:08:59,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {13674#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); {13674#true} is VALID [2022-04-28 10:08:59,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {13674#true} call ULTIMATE.init(); {13674#true} is VALID [2022-04-28 10:08:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:08:59,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595558444] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:59,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:59,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-28 10:08:59,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:59,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1929174939] [2022-04-28 10:08:59,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1929174939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:59,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:59,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:08:59,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178839970] [2022-04-28 10:08:59,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:59,226 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 25 [2022-04-28 10:08:59,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:59,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-28 10:08:59,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:59,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:08:59,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:59,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:08:59,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:08:59,244 INFO L87 Difference]: Start difference. First operand 122 states and 166 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-28 10:09:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,009 INFO L93 Difference]: Finished difference Result 141 states and 186 transitions. [2022-04-28 10:09:00,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:09:00,009 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 25 [2022-04-28 10:09:00,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-28 10:09:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 48 transitions. [2022-04-28 10:09:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-28 10:09:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 48 transitions. [2022-04-28 10:09:00,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 48 transitions. [2022-04-28 10:09:00,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:00,050 INFO L225 Difference]: With dead ends: 141 [2022-04-28 10:09:00,050 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 10:09:00,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:09:00,051 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:00,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 58 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 10:09:00,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2022-04-28 10:09:00,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:00,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,345 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,345 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,347 INFO L93 Difference]: Finished difference Result 130 states and 173 transitions. [2022-04-28 10:09:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 173 transitions. [2022-04-28 10:09:00,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:00,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:00,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-28 10:09:00,348 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-28 10:09:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,349 INFO L93 Difference]: Finished difference Result 130 states and 173 transitions. [2022-04-28 10:09:00,349 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 173 transitions. [2022-04-28 10:09:00,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:00,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:00,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:00,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 163 transitions. [2022-04-28 10:09:00,352 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 163 transitions. Word has length 25 [2022-04-28 10:09:00,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:00,352 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 163 transitions. [2022-04-28 10:09:00,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-28 10:09:00,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 163 transitions. [2022-04-28 10:09:02,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 162 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:02,677 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 163 transitions. [2022-04-28 10:09:02,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:09:02,679 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:02,679 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:02,698 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-28 10:09:02,891 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,SelfDestructingSolverStorable24 [2022-04-28 10:09:02,891 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:02,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:02,892 INFO L85 PathProgramCache]: Analyzing trace with hash -216257032, now seen corresponding path program 15 times [2022-04-28 10:09:02,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:02,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [843716616] [2022-04-28 10:09:02,894 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:02,894 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:02,894 INFO L85 PathProgramCache]: Analyzing trace with hash -216257032, now seen corresponding path program 16 times [2022-04-28 10:09:02,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:02,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222769058] [2022-04-28 10:09:02,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:02,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {14667#(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); {14655#true} is VALID [2022-04-28 10:09:03,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {14655#true} assume true; {14655#true} is VALID [2022-04-28 10:09:03,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14655#true} {14655#true} #72#return; {14655#true} is VALID [2022-04-28 10:09:03,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {14655#true} call ULTIMATE.init(); {14667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:03,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {14667#(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); {14655#true} is VALID [2022-04-28 10:09:03,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {14655#true} assume true; {14655#true} is VALID [2022-04-28 10:09:03,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14655#true} {14655#true} #72#return; {14655#true} is VALID [2022-04-28 10:09:03,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {14655#true} call #t~ret13 := main(); {14655#true} is VALID [2022-04-28 10:09:03,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {14655#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14660#(= main_~y~0 0)} is VALID [2022-04-28 10:09:03,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {14660#(= 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; {14661#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:03,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {14661#(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; {14662#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:03,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {14662#(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; {14663#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:03,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {14663#(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; {14664#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:03,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {14664#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14664#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:03,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {14664#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {14665#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:03,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {14665#(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; {14666#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:03,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {14666#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {14656#false} is VALID [2022-04-28 10:09:03,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {14656#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14656#false} is VALID [2022-04-28 10:09:03,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {14656#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14656#false} is VALID [2022-04-28 10:09:03,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {14656#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14656#false} is VALID [2022-04-28 10:09:03,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {14656#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14656#false} is VALID [2022-04-28 10:09:03,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {14656#false} assume !(~y~0 % 4294967296 > 0); {14656#false} is VALID [2022-04-28 10:09:03,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {14656#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {14656#false} is VALID [2022-04-28 10:09:03,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {14656#false} assume !(~x~0 % 4294967296 > 0); {14656#false} is VALID [2022-04-28 10:09:03,024 INFO L272 TraceCheckUtils]: 21: Hoare triple {14656#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {14656#false} is VALID [2022-04-28 10:09:03,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {14656#false} ~cond := #in~cond; {14656#false} is VALID [2022-04-28 10:09:03,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {14656#false} assume 0 == ~cond; {14656#false} is VALID [2022-04-28 10:09:03,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {14656#false} assume !false; {14656#false} is VALID [2022-04-28 10:09:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:09:03,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:03,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222769058] [2022-04-28 10:09:03,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222769058] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:03,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299178326] [2022-04-28 10:09:03,025 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:03,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:03,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:03,028 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-28 10:09:03,053 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-28 10:09:03,075 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:03,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:03,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:09:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:03,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {14655#true} call ULTIMATE.init(); {14655#true} is VALID [2022-04-28 10:09:03,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {14655#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); {14655#true} is VALID [2022-04-28 10:09:03,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {14655#true} assume true; {14655#true} is VALID [2022-04-28 10:09:03,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14655#true} {14655#true} #72#return; {14655#true} is VALID [2022-04-28 10:09:03,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {14655#true} call #t~ret13 := main(); {14655#true} is VALID [2022-04-28 10:09:03,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {14655#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14660#(= main_~y~0 0)} is VALID [2022-04-28 10:09:03,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {14660#(= 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; {14661#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:03,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {14661#(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; {14662#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:03,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {14662#(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; {14663#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:03,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {14663#(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; {14664#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:03,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {14664#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14664#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:03,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {14664#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {14704#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:03,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {14704#(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; {14708#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:03,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {14708#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {14656#false} is VALID [2022-04-28 10:09:03,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {14656#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14656#false} is VALID [2022-04-28 10:09:03,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {14656#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14656#false} is VALID [2022-04-28 10:09:03,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {14656#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14656#false} is VALID [2022-04-28 10:09:03,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {14656#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14656#false} is VALID [2022-04-28 10:09:03,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {14656#false} assume !(~y~0 % 4294967296 > 0); {14656#false} is VALID [2022-04-28 10:09:03,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {14656#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {14656#false} is VALID [2022-04-28 10:09:03,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {14656#false} assume !(~x~0 % 4294967296 > 0); {14656#false} is VALID [2022-04-28 10:09:03,216 INFO L272 TraceCheckUtils]: 21: Hoare triple {14656#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {14656#false} is VALID [2022-04-28 10:09:03,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {14656#false} ~cond := #in~cond; {14656#false} is VALID [2022-04-28 10:09:03,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {14656#false} assume 0 == ~cond; {14656#false} is VALID [2022-04-28 10:09:03,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {14656#false} assume !false; {14656#false} is VALID [2022-04-28 10:09:03,216 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:09:03,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:03,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {14656#false} assume !false; {14656#false} is VALID [2022-04-28 10:09:03,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {14656#false} assume 0 == ~cond; {14656#false} is VALID [2022-04-28 10:09:03,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {14656#false} ~cond := #in~cond; {14656#false} is VALID [2022-04-28 10:09:03,350 INFO L272 TraceCheckUtils]: 21: Hoare triple {14656#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {14656#false} is VALID [2022-04-28 10:09:03,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {14656#false} assume !(~x~0 % 4294967296 > 0); {14656#false} is VALID [2022-04-28 10:09:03,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {14656#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {14656#false} is VALID [2022-04-28 10:09:03,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {14656#false} assume !(~y~0 % 4294967296 > 0); {14656#false} is VALID [2022-04-28 10:09:03,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {14656#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14656#false} is VALID [2022-04-28 10:09:03,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {14656#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14656#false} is VALID [2022-04-28 10:09:03,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {14772#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14656#false} is VALID [2022-04-28 10:09:03,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {14776#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14772#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:03,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {14780#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14776#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:03,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {14784#(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; {14780#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:09:03,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {14655#true} ~z~0 := ~y~0; {14784#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:09:03,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {14655#true} assume !(~x~0 % 4294967296 > 0); {14655#true} is VALID [2022-04-28 10:09:03,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {14655#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14655#true} is VALID [2022-04-28 10:09:03,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {14655#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14655#true} is VALID [2022-04-28 10:09:03,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {14655#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14655#true} is VALID [2022-04-28 10:09:03,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {14655#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14655#true} is VALID [2022-04-28 10:09:03,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {14655#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14655#true} is VALID [2022-04-28 10:09:03,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {14655#true} call #t~ret13 := main(); {14655#true} is VALID [2022-04-28 10:09:03,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14655#true} {14655#true} #72#return; {14655#true} is VALID [2022-04-28 10:09:03,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {14655#true} assume true; {14655#true} is VALID [2022-04-28 10:09:03,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {14655#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); {14655#true} is VALID [2022-04-28 10:09:03,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {14655#true} call ULTIMATE.init(); {14655#true} is VALID [2022-04-28 10:09:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 10:09:03,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299178326] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:03,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:03,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 16 [2022-04-28 10:09:03,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:03,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [843716616] [2022-04-28 10:09:03,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [843716616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:03,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:03,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:09:03,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359589829] [2022-04-28 10:09:03,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:03,355 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 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 25 [2022-04-28 10:09:03,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:03,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:03,370 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-28 10:09:03,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:09:03,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:03,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:09:03,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:09:03,371 INFO L87 Difference]: Start difference. First operand 121 states and 163 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:04,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:04,108 INFO L93 Difference]: Finished difference Result 156 states and 198 transitions. [2022-04-28 10:09:04,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:09:04,108 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 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 25 [2022-04-28 10:09:04,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-28 10:09:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-28 10:09:04,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-28 10:09:04,151 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-28 10:09:04,153 INFO L225 Difference]: With dead ends: 156 [2022-04-28 10:09:04,153 INFO L226 Difference]: Without dead ends: 144 [2022-04-28 10:09:04,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:09:04,154 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:04,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 55 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:04,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-28 10:09:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 121. [2022-04-28 10:09:04,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:04,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:04,426 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:04,426 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:04,428 INFO L93 Difference]: Finished difference Result 144 states and 186 transitions. [2022-04-28 10:09:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2022-04-28 10:09:04,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:04,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:04,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-28 10:09:04,429 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-28 10:09:04,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:04,431 INFO L93 Difference]: Finished difference Result 144 states and 186 transitions. [2022-04-28 10:09:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2022-04-28 10:09:04,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:04,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:04,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:04,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 162 transitions. [2022-04-28 10:09:04,433 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 162 transitions. Word has length 25 [2022-04-28 10:09:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:04,433 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 162 transitions. [2022-04-28 10:09:04,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:04,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 162 transitions. [2022-04-28 10:09:04,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 162 transitions. [2022-04-28 10:09:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:09:04,788 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:04,788 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:04,804 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-28 10:09:04,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 10:09:04,991 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:04,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:04,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1226882040, now seen corresponding path program 19 times [2022-04-28 10:09:04,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:04,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [985069630] [2022-04-28 10:09:04,994 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:04,994 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:04,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1226882040, now seen corresponding path program 20 times [2022-04-28 10:09:04,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:04,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631603664] [2022-04-28 10:09:04,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:04,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:05,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {15698#(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); {15681#true} is VALID [2022-04-28 10:09:05,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {15681#true} assume true; {15681#true} is VALID [2022-04-28 10:09:05,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15681#true} {15681#true} #72#return; {15681#true} is VALID [2022-04-28 10:09:05,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {15681#true} call ULTIMATE.init(); {15698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:05,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {15698#(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); {15681#true} is VALID [2022-04-28 10:09:05,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {15681#true} assume true; {15681#true} is VALID [2022-04-28 10:09:05,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15681#true} {15681#true} #72#return; {15681#true} is VALID [2022-04-28 10:09:05,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {15681#true} call #t~ret13 := main(); {15681#true} is VALID [2022-04-28 10:09:05,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {15681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15686#(= main_~y~0 0)} is VALID [2022-04-28 10:09:05,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {15686#(= 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; {15687#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:05,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {15687#(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; {15688#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:05,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {15688#(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; {15689#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:05,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {15689#(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; {15690#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:05,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {15690#(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; {15691#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:05,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {15691#(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; {15692#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:05,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {15692#(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; {15693#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:05,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {15693#(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; {15694#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:05,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {15694#(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; {15695#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:05,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {15695#(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; {15696#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:05,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {15696#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15696#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:05,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {15696#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {15697#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:05,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {15697#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {15682#false} is VALID [2022-04-28 10:09:05,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {15682#false} assume !(~y~0 % 4294967296 > 0); {15682#false} is VALID [2022-04-28 10:09:05,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {15682#false} assume !(~x~0 % 4294967296 > 0); {15682#false} is VALID [2022-04-28 10:09:05,199 INFO L272 TraceCheckUtils]: 21: Hoare triple {15682#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {15682#false} is VALID [2022-04-28 10:09:05,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {15682#false} ~cond := #in~cond; {15682#false} is VALID [2022-04-28 10:09:05,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {15682#false} assume 0 == ~cond; {15682#false} is VALID [2022-04-28 10:09:05,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {15682#false} assume !false; {15682#false} is VALID [2022-04-28 10:09:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:05,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:05,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631603664] [2022-04-28 10:09:05,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631603664] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:05,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796390086] [2022-04-28 10:09:05,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:05,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:05,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:05,201 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-28 10:09:05,201 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-28 10:09:05,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:05,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:05,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:09:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:05,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:05,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {15681#true} call ULTIMATE.init(); {15681#true} is VALID [2022-04-28 10:09:05,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {15681#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); {15681#true} is VALID [2022-04-28 10:09:05,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {15681#true} assume true; {15681#true} is VALID [2022-04-28 10:09:05,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15681#true} {15681#true} #72#return; {15681#true} is VALID [2022-04-28 10:09:05,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {15681#true} call #t~ret13 := main(); {15681#true} is VALID [2022-04-28 10:09:05,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {15681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15686#(= main_~y~0 0)} is VALID [2022-04-28 10:09:05,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {15686#(= 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; {15687#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:05,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {15687#(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; {15688#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:05,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {15688#(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; {15689#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:05,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {15689#(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; {15690#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:05,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {15690#(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; {15691#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:05,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {15691#(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; {15692#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:05,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {15692#(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; {15693#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:05,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {15693#(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; {15694#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:05,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {15694#(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; {15695#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:05,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {15695#(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; {15696#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:05,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {15696#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15696#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:05,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {15696#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {15753#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:05,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {15753#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {15682#false} is VALID [2022-04-28 10:09:05,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {15682#false} assume !(~y~0 % 4294967296 > 0); {15682#false} is VALID [2022-04-28 10:09:05,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {15682#false} assume !(~x~0 % 4294967296 > 0); {15682#false} is VALID [2022-04-28 10:09:05,470 INFO L272 TraceCheckUtils]: 21: Hoare triple {15682#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {15682#false} is VALID [2022-04-28 10:09:05,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {15682#false} ~cond := #in~cond; {15682#false} is VALID [2022-04-28 10:09:05,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {15682#false} assume 0 == ~cond; {15682#false} is VALID [2022-04-28 10:09:05,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {15682#false} assume !false; {15682#false} is VALID [2022-04-28 10:09:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:05,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:05,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {15682#false} assume !false; {15682#false} is VALID [2022-04-28 10:09:05,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {15682#false} assume 0 == ~cond; {15682#false} is VALID [2022-04-28 10:09:05,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {15682#false} ~cond := #in~cond; {15682#false} is VALID [2022-04-28 10:09:05,789 INFO L272 TraceCheckUtils]: 21: Hoare triple {15682#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {15682#false} is VALID [2022-04-28 10:09:05,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {15682#false} assume !(~x~0 % 4294967296 > 0); {15682#false} is VALID [2022-04-28 10:09:05,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {15682#false} assume !(~y~0 % 4294967296 > 0); {15682#false} is VALID [2022-04-28 10:09:05,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {15793#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15682#false} is VALID [2022-04-28 10:09:05,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {15797#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {15793#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:05,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {15797#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {15797#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:05,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {15804#(< 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; {15797#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:05,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {15808#(< 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; {15804#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:05,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {15812#(< 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; {15808#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:05,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {15816#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15812#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:05,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {15820#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15816#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:05,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {15824#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15820#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:05,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {15828#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15824#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:05,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {15832#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15828#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:05,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {15836#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15832#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:05,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {15840#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15836#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:05,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {15681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15840#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:05,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {15681#true} call #t~ret13 := main(); {15681#true} is VALID [2022-04-28 10:09:05,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15681#true} {15681#true} #72#return; {15681#true} is VALID [2022-04-28 10:09:05,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {15681#true} assume true; {15681#true} is VALID [2022-04-28 10:09:05,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {15681#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); {15681#true} is VALID [2022-04-28 10:09:05,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {15681#true} call ULTIMATE.init(); {15681#true} is VALID [2022-04-28 10:09:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:05,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796390086] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:05,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:05,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:09:05,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:05,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [985069630] [2022-04-28 10:09:05,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [985069630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:05,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:05,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:09:05,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953689556] [2022-04-28 10:09:05,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:05,799 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 25 [2022-04-28 10:09:05,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:05,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:09:05,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:05,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:09:05,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:05,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:09:05,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:09:05,816 INFO L87 Difference]: Start difference. First operand 121 states and 162 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:09:07,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:07,634 INFO L93 Difference]: Finished difference Result 197 states and 294 transitions. [2022-04-28 10:09:07,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:09:07,634 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 25 [2022-04-28 10:09:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:09:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 97 transitions. [2022-04-28 10:09:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:09:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 97 transitions. [2022-04-28 10:09:07,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 97 transitions. [2022-04-28 10:09:07,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:07,718 INFO L225 Difference]: With dead ends: 197 [2022-04-28 10:09:07,718 INFO L226 Difference]: Without dead ends: 180 [2022-04-28 10:09:07,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:09:07,719 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 81 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:07,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 99 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:09:07,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-28 10:09:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 132. [2022-04-28 10:09:08,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:08,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:08,018 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:08,018 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:08,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:08,020 INFO L93 Difference]: Finished difference Result 180 states and 227 transitions. [2022-04-28 10:09:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 227 transitions. [2022-04-28 10:09:08,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:08,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:08,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-28 10:09:08,021 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-28 10:09:08,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:08,024 INFO L93 Difference]: Finished difference Result 180 states and 227 transitions. [2022-04-28 10:09:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 227 transitions. [2022-04-28 10:09:08,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:08,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:08,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:08,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:08,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 178 transitions. [2022-04-28 10:09:08,026 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 178 transitions. Word has length 25 [2022-04-28 10:09:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:08,027 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 178 transitions. [2022-04-28 10:09:08,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:09:08,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 178 transitions. [2022-04-28 10:09:08,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:08,329 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 178 transitions. [2022-04-28 10:09:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:09:08,329 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:08,330 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:08,346 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-28 10:09:08,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:08,531 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:08,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash 415342529, now seen corresponding path program 21 times [2022-04-28 10:09:08,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:08,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1871481580] [2022-04-28 10:09:08,534 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:08,534 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:08,534 INFO L85 PathProgramCache]: Analyzing trace with hash 415342529, now seen corresponding path program 22 times [2022-04-28 10:09:08,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:08,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632873763] [2022-04-28 10:09:08,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:08,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:08,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:08,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {16921#(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); {16903#true} is VALID [2022-04-28 10:09:08,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {16903#true} assume true; {16903#true} is VALID [2022-04-28 10:09:08,780 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16903#true} {16903#true} #72#return; {16903#true} is VALID [2022-04-28 10:09:08,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {16903#true} call ULTIMATE.init(); {16921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:08,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {16921#(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); {16903#true} is VALID [2022-04-28 10:09:08,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {16903#true} assume true; {16903#true} is VALID [2022-04-28 10:09:08,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16903#true} {16903#true} #72#return; {16903#true} is VALID [2022-04-28 10:09:08,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {16903#true} call #t~ret13 := main(); {16903#true} is VALID [2022-04-28 10:09:08,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {16903#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16908#(= main_~y~0 0)} is VALID [2022-04-28 10:09:08,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {16908#(= 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; {16909#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:08,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {16909#(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; {16910#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:08,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {16910#(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; {16911#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:08,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {16911#(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; {16912#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:08,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {16912#(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; {16913#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:08,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {16913#(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; {16914#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:08,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {16914#(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; {16915#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:08,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {16915#(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; {16916#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:08,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {16916#(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; {16917#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:08,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {16917#(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; {16918#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:08,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {16918#(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; {16919#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:08,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {16919#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16919#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:08,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {16919#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {16920#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:08,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {16920#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {16904#false} is VALID [2022-04-28 10:09:08,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {16904#false} assume !(~y~0 % 4294967296 > 0); {16904#false} is VALID [2022-04-28 10:09:08,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {16904#false} assume !(~x~0 % 4294967296 > 0); {16904#false} is VALID [2022-04-28 10:09:08,791 INFO L272 TraceCheckUtils]: 22: Hoare triple {16904#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {16904#false} is VALID [2022-04-28 10:09:08,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {16904#false} ~cond := #in~cond; {16904#false} is VALID [2022-04-28 10:09:08,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {16904#false} assume 0 == ~cond; {16904#false} is VALID [2022-04-28 10:09:08,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {16904#false} assume !false; {16904#false} is VALID [2022-04-28 10:09:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:08,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:08,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632873763] [2022-04-28 10:09:08,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632873763] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:08,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342788346] [2022-04-28 10:09:08,792 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:08,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:08,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:08,796 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-28 10:09:08,821 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-28 10:09:08,844 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:08,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:08,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:09:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:08,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:09,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {16903#true} call ULTIMATE.init(); {16903#true} is VALID [2022-04-28 10:09:09,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {16903#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); {16903#true} is VALID [2022-04-28 10:09:09,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {16903#true} assume true; {16903#true} is VALID [2022-04-28 10:09:09,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16903#true} {16903#true} #72#return; {16903#true} is VALID [2022-04-28 10:09:09,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {16903#true} call #t~ret13 := main(); {16903#true} is VALID [2022-04-28 10:09:09,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {16903#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16908#(= main_~y~0 0)} is VALID [2022-04-28 10:09:09,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {16908#(= 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; {16909#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:09,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {16909#(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; {16910#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:09,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {16910#(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; {16911#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:09,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {16911#(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; {16912#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:09,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {16912#(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; {16913#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:09,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {16913#(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; {16914#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:09,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {16914#(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; {16915#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:09,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {16915#(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; {16916#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:09,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {16916#(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; {16917#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:09,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {16917#(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; {16918#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:09,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {16918#(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; {16919#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:09,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {16919#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16919#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:09,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {16919#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {16979#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:09,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {16979#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {16904#false} is VALID [2022-04-28 10:09:09,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {16904#false} assume !(~y~0 % 4294967296 > 0); {16904#false} is VALID [2022-04-28 10:09:09,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {16904#false} assume !(~x~0 % 4294967296 > 0); {16904#false} is VALID [2022-04-28 10:09:09,104 INFO L272 TraceCheckUtils]: 22: Hoare triple {16904#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {16904#false} is VALID [2022-04-28 10:09:09,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {16904#false} ~cond := #in~cond; {16904#false} is VALID [2022-04-28 10:09:09,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {16904#false} assume 0 == ~cond; {16904#false} is VALID [2022-04-28 10:09:09,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {16904#false} assume !false; {16904#false} is VALID [2022-04-28 10:09:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:09,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:09,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {16904#false} assume !false; {16904#false} is VALID [2022-04-28 10:09:09,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {16904#false} assume 0 == ~cond; {16904#false} is VALID [2022-04-28 10:09:09,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {16904#false} ~cond := #in~cond; {16904#false} is VALID [2022-04-28 10:09:09,478 INFO L272 TraceCheckUtils]: 22: Hoare triple {16904#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {16904#false} is VALID [2022-04-28 10:09:09,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {16904#false} assume !(~x~0 % 4294967296 > 0); {16904#false} is VALID [2022-04-28 10:09:09,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {16904#false} assume !(~y~0 % 4294967296 > 0); {16904#false} is VALID [2022-04-28 10:09:09,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {17019#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {16904#false} is VALID [2022-04-28 10:09:09,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {17023#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {17019#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:09,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {17023#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {17023#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:09,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {17030#(< 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; {17023#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:09,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {17034#(< 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; {17030#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:09,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {17038#(< 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; {17034#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:09,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {17042#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17038#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:09,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {17046#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17042#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:09,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {17050#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17046#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:09,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {17054#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17050#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:09,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {17058#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17054#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:09,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {17062#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17058#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:09,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {17066#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17062#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:09,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {17070#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17066#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:09,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {16903#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17070#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:09:09,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {16903#true} call #t~ret13 := main(); {16903#true} is VALID [2022-04-28 10:09:09,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16903#true} {16903#true} #72#return; {16903#true} is VALID [2022-04-28 10:09:09,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {16903#true} assume true; {16903#true} is VALID [2022-04-28 10:09:09,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {16903#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); {16903#true} is VALID [2022-04-28 10:09:09,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {16903#true} call ULTIMATE.init(); {16903#true} is VALID [2022-04-28 10:09:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:09,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342788346] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:09,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:09,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:09:09,489 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:09,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1871481580] [2022-04-28 10:09:09,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1871481580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:09,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:09,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:09:09,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867405476] [2022-04-28 10:09:09,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:09,489 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 26 [2022-04-28 10:09:09,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:09,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:09:09,507 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-28 10:09:09,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:09:09,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:09,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:09:09,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:09:09,508 INFO L87 Difference]: Start difference. First operand 132 states and 178 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:09:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:11,469 INFO L93 Difference]: Finished difference Result 212 states and 318 transitions. [2022-04-28 10:09:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:09:11,469 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 26 [2022-04-28 10:09:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:09:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 104 transitions. [2022-04-28 10:09:11,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:09:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 104 transitions. [2022-04-28 10:09:11,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 104 transitions. [2022-04-28 10:09:11,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:11,557 INFO L225 Difference]: With dead ends: 212 [2022-04-28 10:09:11,557 INFO L226 Difference]: Without dead ends: 195 [2022-04-28 10:09:11,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:09:11,558 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 90 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:11,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 105 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:09:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-04-28 10:09:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 143. [2022-04-28 10:09:11,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:11,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:11,868 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:11,869 INFO L87 Difference]: Start difference. First operand 195 states. Second operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:11,871 INFO L93 Difference]: Finished difference Result 195 states and 247 transitions. [2022-04-28 10:09:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 247 transitions. [2022-04-28 10:09:11,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:11,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:11,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 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 195 states. [2022-04-28 10:09:11,872 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 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 195 states. [2022-04-28 10:09:11,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:11,874 INFO L93 Difference]: Finished difference Result 195 states and 247 transitions. [2022-04-28 10:09:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 247 transitions. [2022-04-28 10:09:11,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:11,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:11,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:11,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 194 transitions. [2022-04-28 10:09:11,878 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 194 transitions. Word has length 26 [2022-04-28 10:09:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:11,878 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 194 transitions. [2022-04-28 10:09:11,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:09:11,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 194 transitions. [2022-04-28 10:09:12,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 194 transitions. [2022-04-28 10:09:12,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:09:12,274 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:12,274 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:12,290 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-28 10:09:12,474 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,SelfDestructingSolverStorable27 [2022-04-28 10:09:12,474 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:12,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:12,475 INFO L85 PathProgramCache]: Analyzing trace with hash -828351928, now seen corresponding path program 17 times [2022-04-28 10:09:12,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:12,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1822475497] [2022-04-28 10:09:12,478 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:12,478 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:12,478 INFO L85 PathProgramCache]: Analyzing trace with hash -828351928, now seen corresponding path program 18 times [2022-04-28 10:09:12,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:12,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385062659] [2022-04-28 10:09:12,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:12,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:12,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:12,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {18237#(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); {18217#true} is VALID [2022-04-28 10:09:12,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {18217#true} assume true; {18217#true} is VALID [2022-04-28 10:09:12,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18217#true} {18217#true} #72#return; {18217#true} is VALID [2022-04-28 10:09:12,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {18217#true} call ULTIMATE.init(); {18237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:12,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {18237#(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); {18217#true} is VALID [2022-04-28 10:09:12,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {18217#true} assume true; {18217#true} is VALID [2022-04-28 10:09:12,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18217#true} {18217#true} #72#return; {18217#true} is VALID [2022-04-28 10:09:12,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {18217#true} call #t~ret13 := main(); {18217#true} is VALID [2022-04-28 10:09:12,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {18217#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18222#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:09:12,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {18222#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18223#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)))} is VALID [2022-04-28 10:09:12,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {18223#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~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; {18224#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 2)))} is VALID [2022-04-28 10:09:12,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {18224#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) 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; {18225#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} is VALID [2022-04-28 10:09:12,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {18225#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} assume !(~x~0 % 4294967296 > 0); {18226#(and (<= (* main_~n~0 2) (+ main_~y~0 3 (* 8589934592 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 3 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)))} is VALID [2022-04-28 10:09:12,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {18226#(and (<= (* main_~n~0 2) (+ main_~y~0 3 (* 8589934592 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 3 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)))} ~z~0 := ~y~0; {18227#(and (<= (+ main_~z~0 3 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ main_~z~0 3 (* 8589934592 (div main_~x~0 4294967296)))))} is VALID [2022-04-28 10:09:12,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {18227#(and (<= (+ main_~z~0 3 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ main_~z~0 3 (* 8589934592 (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; {18228#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} is VALID [2022-04-28 10:09:12,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {18228#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) 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; {18229#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 10:09:12,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {18229#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) 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; {18230#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:12,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {18230#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {18230#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:12,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {18230#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18229#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 10:09:12,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {18229#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18228#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} is VALID [2022-04-28 10:09:12,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {18228#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18231#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:12,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {18231#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {18231#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:12,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {18231#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {18232#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} is VALID [2022-04-28 10:09:12,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {18232#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {18233#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} is VALID [2022-04-28 10:09:12,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {18233#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {18234#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:12,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {18234#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {18234#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:12,897 INFO L272 TraceCheckUtils]: 23: Hoare triple {18234#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {18235#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:09:12,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {18235#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {18236#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:09:12,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {18236#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18218#false} is VALID [2022-04-28 10:09:12,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {18218#false} assume !false; {18218#false} is VALID [2022-04-28 10:09:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:12,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:12,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385062659] [2022-04-28 10:09:12,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385062659] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:12,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65586189] [2022-04-28 10:09:12,899 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:12,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:12,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:12,900 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-28 10:09:12,900 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-28 10:09:13,407 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:09:13,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:13,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-28 10:09:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:13,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:14,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {18217#true} call ULTIMATE.init(); {18217#true} is VALID [2022-04-28 10:09:14,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {18217#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); {18217#true} is VALID [2022-04-28 10:09:14,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {18217#true} assume true; {18217#true} is VALID [2022-04-28 10:09:14,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18217#true} {18217#true} #72#return; {18217#true} is VALID [2022-04-28 10:09:14,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {18217#true} call #t~ret13 := main(); {18217#true} is VALID [2022-04-28 10:09:14,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {18217#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18222#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:09:14,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {18222#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18259#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} is VALID [2022-04-28 10:09:14,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {18259#(and (= (+ main_~x~0 1) main_~n~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; {18263#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:09:14,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {18263#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18267#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3))} is VALID [2022-04-28 10:09:14,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {18267#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3))} assume !(~x~0 % 4294967296 > 0); {18271#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:14,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {18271#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3) (not (< 0 (mod main_~x~0 4294967296))))} ~z~0 := ~y~0; {18275#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (not (< 0 (mod main_~x~0 4294967296))) (= main_~z~0 3))} is VALID [2022-04-28 10:09:14,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {18275#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (not (< 0 (mod main_~x~0 4294967296))) (= 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; {18279#(and (= 3 (+ main_~z~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ (- 2) main_~n~0) main_~x~0))} is VALID [2022-04-28 10:09:14,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {18279#(and (= 3 (+ main_~z~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ (- 2) main_~n~0) 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; {18283#(and (= main_~x~0 (+ (- 1) main_~n~0)) (= 3 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:09:14,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {18283#(and (= main_~x~0 (+ (- 1) main_~n~0)) (= 3 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18287#(and (= main_~n~0 main_~x~0) (= (+ main_~z~0 1) 1) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:09:14,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {18287#(and (= main_~n~0 main_~x~0) (= (+ main_~z~0 1) 1) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {18287#(and (= main_~n~0 main_~x~0) (= (+ main_~z~0 1) 1) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:09:14,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {18287#(and (= main_~n~0 main_~x~0) (= (+ main_~z~0 1) 1) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18294#(and (= main_~n~0 main_~x~0) (= main_~z~0 1) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:09:14,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {18294#(and (= main_~n~0 main_~x~0) (= main_~z~0 1) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18298#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))) (= main_~z~0 2))} is VALID [2022-04-28 10:09:14,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {18298#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))) (= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18302#(and (= main_~n~0 main_~x~0) (= 2 (+ (- 1) main_~z~0)) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:09:14,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {18302#(and (= main_~n~0 main_~x~0) (= 2 (+ (- 1) main_~z~0)) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {18302#(and (= main_~n~0 main_~x~0) (= 2 (+ (- 1) main_~z~0)) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:09:14,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {18302#(and (= main_~n~0 main_~x~0) (= 2 (+ (- 1) main_~z~0)) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {18309#(and (= (+ main_~x~0 1) main_~n~0) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0) (= main_~z~0 4))} is VALID [2022-04-28 10:09:14,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {18309#(and (= (+ main_~x~0 1) main_~n~0) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0) (= main_~z~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {18313#(and (= main_~n~0 (+ main_~x~0 2)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0) (= 5 main_~z~0))} is VALID [2022-04-28 10:09:14,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {18313#(and (= main_~n~0 (+ main_~x~0 2)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0) (= 5 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {18317#(and (= (+ main_~x~0 3) main_~n~0) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0) (= main_~z~0 6))} is VALID [2022-04-28 10:09:14,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {18317#(and (= (+ main_~x~0 3) main_~n~0) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0) (= main_~z~0 6))} assume !(~x~0 % 4294967296 > 0); {18321#(and (<= (mod (+ main_~n~0 4294967293) 4294967296) 0) (= main_~z~0 6))} is VALID [2022-04-28 10:09:14,253 INFO L272 TraceCheckUtils]: 23: Hoare triple {18321#(and (<= (mod (+ main_~n~0 4294967293) 4294967296) 0) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {18325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:14,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {18325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:14,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {18329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18218#false} is VALID [2022-04-28 10:09:14,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {18218#false} assume !false; {18218#false} is VALID [2022-04-28 10:09:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:14,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:15,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {18218#false} assume !false; {18218#false} is VALID [2022-04-28 10:09:15,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {18329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18218#false} is VALID [2022-04-28 10:09:15,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {18325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:15,558 INFO L272 TraceCheckUtils]: 23: Hoare triple {18234#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {18325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:15,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {18348#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {18234#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:15,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {18352#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {18348#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:09:15,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {18356#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {18352#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-28 10:09:15,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {18360#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {18356#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:09:15,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {18360#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} assume !(~y~0 % 4294967296 > 0); {18360#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} is VALID [2022-04-28 10:09:15,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {18367#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18360#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} is VALID [2022-04-28 10:09:15,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {18371#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18367#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))))} is VALID [2022-04-28 10:09:15,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {18375#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18371#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:09:15,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {18375#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !(~z~0 % 4294967296 > 0); {18375#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:09:15,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {18382#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~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; {18375#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:09:15,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {18386#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 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; {18382#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:09:15,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {18390#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18386#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))))} is VALID [2022-04-28 10:09:15,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {18394#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {18390#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:15,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {18394#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {18394#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:15,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {18401#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18394#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:15,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {18405#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18401#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} is VALID [2022-04-28 10:09:15,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {18409#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6) (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18405#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:09:15,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {18217#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18409#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6) (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:09:15,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {18217#true} call #t~ret13 := main(); {18217#true} is VALID [2022-04-28 10:09:15,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18217#true} {18217#true} #72#return; {18217#true} is VALID [2022-04-28 10:09:15,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {18217#true} assume true; {18217#true} is VALID [2022-04-28 10:09:15,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {18217#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); {18217#true} is VALID [2022-04-28 10:09:15,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {18217#true} call ULTIMATE.init(); {18217#true} is VALID [2022-04-28 10:09:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:15,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65586189] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:15,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:15,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 19] total 49 [2022-04-28 10:09:15,587 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:15,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1822475497] [2022-04-28 10:09:15,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1822475497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:15,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:15,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:09:15,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930798165] [2022-04-28 10:09:15,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:15,587 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 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 27 [2022-04-28 10:09:15,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:15,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:15,637 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-28 10:09:15,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:09:15,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:15,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:09:15,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2089, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:09:15,639 INFO L87 Difference]: Start difference. First operand 143 states and 194 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:17,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:17,319 INFO L93 Difference]: Finished difference Result 156 states and 207 transitions. [2022-04-28 10:09:17,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:09:17,319 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 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 27 [2022-04-28 10:09:17,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 42 transitions. [2022-04-28 10:09:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 42 transitions. [2022-04-28 10:09:17,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 42 transitions. [2022-04-28 10:09:17,365 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-28 10:09:17,366 INFO L225 Difference]: With dead ends: 156 [2022-04-28 10:09:17,366 INFO L226 Difference]: Without dead ends: 151 [2022-04-28 10:09:17,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=401, Invalid=3889, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 10:09:17,368 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:17,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 88 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:09:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-28 10:09:17,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2022-04-28 10:09:17,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:17,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:17,717 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:17,717 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:17,719 INFO L93 Difference]: Finished difference Result 151 states and 202 transitions. [2022-04-28 10:09:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 202 transitions. [2022-04-28 10:09:17,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:17,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:17,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 3 states have call successors, (3), 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 151 states. [2022-04-28 10:09:17,720 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 3 states have call successors, (3), 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 151 states. [2022-04-28 10:09:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:17,722 INFO L93 Difference]: Finished difference Result 151 states and 202 transitions. [2022-04-28 10:09:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 202 transitions. [2022-04-28 10:09:17,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:17,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:17,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:17,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 199 transitions. [2022-04-28 10:09:17,725 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 199 transitions. Word has length 27 [2022-04-28 10:09:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:17,725 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 199 transitions. [2022-04-28 10:09:17,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:17,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 199 transitions. [2022-04-28 10:09:18,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 199 transitions. [2022-04-28 10:09:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:09:18,089 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:18,089 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:18,095 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-28 10:09:18,289 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,SelfDestructingSolverStorable28 [2022-04-28 10:09:18,290 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:18,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:18,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1740747864, now seen corresponding path program 19 times [2022-04-28 10:09:18,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:18,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [101555230] [2022-04-28 10:09:18,293 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:18,293 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:18,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1740747864, now seen corresponding path program 20 times [2022-04-28 10:09:18,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:18,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948820954] [2022-04-28 10:09:18,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:18,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:18,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:18,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {19387#(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); {19374#true} is VALID [2022-04-28 10:09:18,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {19374#true} assume true; {19374#true} is VALID [2022-04-28 10:09:18,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19374#true} {19374#true} #72#return; {19374#true} is VALID [2022-04-28 10:09:18,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {19374#true} call ULTIMATE.init(); {19387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:18,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {19387#(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); {19374#true} is VALID [2022-04-28 10:09:18,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {19374#true} assume true; {19374#true} is VALID [2022-04-28 10:09:18,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19374#true} {19374#true} #72#return; {19374#true} is VALID [2022-04-28 10:09:18,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {19374#true} call #t~ret13 := main(); {19374#true} is VALID [2022-04-28 10:09:18,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {19374#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19379#(= main_~y~0 0)} is VALID [2022-04-28 10:09:18,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {19379#(= 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; {19380#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:18,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {19380#(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; {19381#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:18,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {19381#(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; {19382#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:18,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {19382#(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; {19383#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:18,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {19383#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19383#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:18,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {19383#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {19384#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:18,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {19384#(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; {19385#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:18,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {19385#(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; {19386#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:18,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {19386#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {19375#false} is VALID [2022-04-28 10:09:18,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {19375#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19375#false} is VALID [2022-04-28 10:09:18,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {19375#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19375#false} is VALID [2022-04-28 10:09:18,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {19375#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19375#false} is VALID [2022-04-28 10:09:18,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {19375#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19375#false} is VALID [2022-04-28 10:09:18,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {19375#false} assume !(~y~0 % 4294967296 > 0); {19375#false} is VALID [2022-04-28 10:09:18,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {19375#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19375#false} is VALID [2022-04-28 10:09:18,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {19375#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19375#false} is VALID [2022-04-28 10:09:18,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {19375#false} assume !(~x~0 % 4294967296 > 0); {19375#false} is VALID [2022-04-28 10:09:18,449 INFO L272 TraceCheckUtils]: 23: Hoare triple {19375#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {19375#false} is VALID [2022-04-28 10:09:18,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {19375#false} ~cond := #in~cond; {19375#false} is VALID [2022-04-28 10:09:18,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {19375#false} assume 0 == ~cond; {19375#false} is VALID [2022-04-28 10:09:18,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {19375#false} assume !false; {19375#false} is VALID [2022-04-28 10:09:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 10:09:18,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:18,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948820954] [2022-04-28 10:09:18,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948820954] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:18,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016535720] [2022-04-28 10:09:18,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:18,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:18,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:18,451 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-28 10:09:18,453 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-28 10:09:18,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:18,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:18,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 10:09:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:18,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:18,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {19374#true} call ULTIMATE.init(); {19374#true} is VALID [2022-04-28 10:09:18,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {19374#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); {19374#true} is VALID [2022-04-28 10:09:18,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {19374#true} assume true; {19374#true} is VALID [2022-04-28 10:09:18,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19374#true} {19374#true} #72#return; {19374#true} is VALID [2022-04-28 10:09:18,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {19374#true} call #t~ret13 := main(); {19374#true} is VALID [2022-04-28 10:09:18,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {19374#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19379#(= main_~y~0 0)} is VALID [2022-04-28 10:09:18,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {19379#(= 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; {19380#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:18,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {19380#(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; {19381#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:18,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {19381#(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; {19382#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:18,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {19382#(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; {19383#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:18,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {19383#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19383#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:18,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {19383#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {19424#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:18,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {19424#(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; {19428#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:18,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {19428#(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; {19432#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:18,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {19432#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {19375#false} is VALID [2022-04-28 10:09:18,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {19375#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19375#false} is VALID [2022-04-28 10:09:18,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {19375#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19375#false} is VALID [2022-04-28 10:09:18,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {19375#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19375#false} is VALID [2022-04-28 10:09:18,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {19375#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19375#false} is VALID [2022-04-28 10:09:18,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {19375#false} assume !(~y~0 % 4294967296 > 0); {19375#false} is VALID [2022-04-28 10:09:18,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {19375#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19375#false} is VALID [2022-04-28 10:09:18,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {19375#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19375#false} is VALID [2022-04-28 10:09:18,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {19375#false} assume !(~x~0 % 4294967296 > 0); {19375#false} is VALID [2022-04-28 10:09:18,669 INFO L272 TraceCheckUtils]: 23: Hoare triple {19375#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {19375#false} is VALID [2022-04-28 10:09:18,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {19375#false} ~cond := #in~cond; {19375#false} is VALID [2022-04-28 10:09:18,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {19375#false} assume 0 == ~cond; {19375#false} is VALID [2022-04-28 10:09:18,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {19375#false} assume !false; {19375#false} is VALID [2022-04-28 10:09:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 10:09:18,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:18,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {19375#false} assume !false; {19375#false} is VALID [2022-04-28 10:09:18,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {19375#false} assume 0 == ~cond; {19375#false} is VALID [2022-04-28 10:09:18,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {19375#false} ~cond := #in~cond; {19375#false} is VALID [2022-04-28 10:09:18,835 INFO L272 TraceCheckUtils]: 23: Hoare triple {19375#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {19375#false} is VALID [2022-04-28 10:09:18,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {19375#false} assume !(~x~0 % 4294967296 > 0); {19375#false} is VALID [2022-04-28 10:09:18,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {19375#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19375#false} is VALID [2022-04-28 10:09:18,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {19375#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19375#false} is VALID [2022-04-28 10:09:18,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {19375#false} assume !(~y~0 % 4294967296 > 0); {19375#false} is VALID [2022-04-28 10:09:18,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {19375#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19375#false} is VALID [2022-04-28 10:09:18,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {19499#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19375#false} is VALID [2022-04-28 10:09:18,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {19503#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19499#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:18,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {19507#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19503#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:18,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {19511#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {19507#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:09:18,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {19515#(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; {19511#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:09:18,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {19519#(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; {19515#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:18,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {19374#true} ~z~0 := ~y~0; {19519#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:09:18,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {19374#true} assume !(~x~0 % 4294967296 > 0); {19374#true} is VALID [2022-04-28 10:09:18,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {19374#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19374#true} is VALID [2022-04-28 10:09:18,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {19374#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19374#true} is VALID [2022-04-28 10:09:18,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {19374#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19374#true} is VALID [2022-04-28 10:09:18,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {19374#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19374#true} is VALID [2022-04-28 10:09:18,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {19374#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19374#true} is VALID [2022-04-28 10:09:18,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {19374#true} call #t~ret13 := main(); {19374#true} is VALID [2022-04-28 10:09:18,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19374#true} {19374#true} #72#return; {19374#true} is VALID [2022-04-28 10:09:18,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {19374#true} assume true; {19374#true} is VALID [2022-04-28 10:09:18,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {19374#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); {19374#true} is VALID [2022-04-28 10:09:18,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {19374#true} call ULTIMATE.init(); {19374#true} is VALID [2022-04-28 10:09:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 10:09:18,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016535720] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:18,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:18,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 20 [2022-04-28 10:09:18,841 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:18,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [101555230] [2022-04-28 10:09:18,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [101555230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:18,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:18,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:09:18,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878623025] [2022-04-28 10:09:18,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:18,842 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 27 [2022-04-28 10:09:18,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:18,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-28 10:09:18,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:18,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:09:18,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:18,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:09:18,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:09:18,862 INFO L87 Difference]: Start difference. First operand 148 states and 199 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-28 10:09:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:19,712 INFO L93 Difference]: Finished difference Result 176 states and 227 transitions. [2022-04-28 10:09:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:09:19,713 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 27 [2022-04-28 10:09:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-28 10:09:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-28 10:09:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-28 10:09:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-28 10:09:19,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2022-04-28 10:09:19,756 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-28 10:09:19,757 INFO L225 Difference]: With dead ends: 176 [2022-04-28 10:09:19,757 INFO L226 Difference]: Without dead ends: 163 [2022-04-28 10:09:19,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:09:19,758 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:19,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 58 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:19,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-28 10:09:20,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 148. [2022-04-28 10:09:20,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:20,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:20,116 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:20,116 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:20,118 INFO L93 Difference]: Finished difference Result 163 states and 214 transitions. [2022-04-28 10:09:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 214 transitions. [2022-04-28 10:09:20,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:20,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:20,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 3 states have call successors, (3), 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 163 states. [2022-04-28 10:09:20,119 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 3 states have call successors, (3), 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 163 states. [2022-04-28 10:09:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:20,121 INFO L93 Difference]: Finished difference Result 163 states and 214 transitions. [2022-04-28 10:09:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 214 transitions. [2022-04-28 10:09:20,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:20,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:20,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:20,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 198 transitions. [2022-04-28 10:09:20,124 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 198 transitions. Word has length 27 [2022-04-28 10:09:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:20,124 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 198 transitions. [2022-04-28 10:09:20,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-28 10:09:20,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 198 transitions. [2022-04-28 10:09:20,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 198 transitions. [2022-04-28 10:09:20,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:09:20,528 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:20,528 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:20,544 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-28 10:09:20,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:20,729 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:20,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:20,729 INFO L85 PathProgramCache]: Analyzing trace with hash -734568360, now seen corresponding path program 11 times [2022-04-28 10:09:20,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:20,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1054121826] [2022-04-28 10:09:20,731 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:20,732 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:20,732 INFO L85 PathProgramCache]: Analyzing trace with hash -734568360, now seen corresponding path program 12 times [2022-04-28 10:09:20,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:20,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365709995] [2022-04-28 10:09:20,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:20,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:20,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:20,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {20565#(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); {20552#true} is VALID [2022-04-28 10:09:20,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {20552#true} assume true; {20552#true} is VALID [2022-04-28 10:09:20,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20552#true} {20552#true} #72#return; {20552#true} is VALID [2022-04-28 10:09:20,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {20552#true} call ULTIMATE.init(); {20565#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:20,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {20565#(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); {20552#true} is VALID [2022-04-28 10:09:20,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {20552#true} assume true; {20552#true} is VALID [2022-04-28 10:09:20,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20552#true} {20552#true} #72#return; {20552#true} is VALID [2022-04-28 10:09:20,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {20552#true} call #t~ret13 := main(); {20552#true} is VALID [2022-04-28 10:09:20,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {20552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20552#true} is VALID [2022-04-28 10:09:20,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {20552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:20,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {20557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20558#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:09:20,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {20558#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20559#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:20,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {20559#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20560#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:20,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {20560#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {20560#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:20,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {20560#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {20560#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:20,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {20560#(<= (* (div (+ main_~x~0 4) 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; {20561#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:20,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {20561#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20562#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:20,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {20562#(<= (+ 2 (* (div (+ main_~x~0 2) 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; {20563#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:20,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {20563#(<= (+ 3 (* (div (+ main_~x~0 1) 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; {20564#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:20,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {20564#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {20564#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:20,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {20564#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20564#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:20,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {20564#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20564#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:20,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {20564#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20564#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:20,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {20564#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20564#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:20,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {20564#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {20564#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:20,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {20564#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {20553#false} is VALID [2022-04-28 10:09:20,889 INFO L272 TraceCheckUtils]: 23: Hoare triple {20553#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {20553#false} is VALID [2022-04-28 10:09:20,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {20553#false} ~cond := #in~cond; {20553#false} is VALID [2022-04-28 10:09:20,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {20553#false} assume 0 == ~cond; {20553#false} is VALID [2022-04-28 10:09:20,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {20553#false} assume !false; {20553#false} is VALID [2022-04-28 10:09:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:09:20,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:20,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365709995] [2022-04-28 10:09:20,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365709995] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:20,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617202914] [2022-04-28 10:09:20,890 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:20,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:20,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:20,891 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-28 10:09:20,892 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-28 10:09:20,935 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:09:20,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:20,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:09:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:20,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:21,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {20552#true} call ULTIMATE.init(); {20552#true} is VALID [2022-04-28 10:09:21,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {20552#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); {20552#true} is VALID [2022-04-28 10:09:21,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {20552#true} assume true; {20552#true} is VALID [2022-04-28 10:09:21,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20552#true} {20552#true} #72#return; {20552#true} is VALID [2022-04-28 10:09:21,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {20552#true} call #t~ret13 := main(); {20552#true} is VALID [2022-04-28 10:09:21,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {20552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20552#true} is VALID [2022-04-28 10:09:21,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {20552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:21,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {20557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20590#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:21,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {20590#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20594#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {20594#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20598#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:21,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {20598#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {20598#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:21,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {20598#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {20598#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:21,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {20598#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20594#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {20594#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {20590#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:21,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {20590#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:21,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {20557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20553#false} is VALID [2022-04-28 10:09:21,209 INFO L272 TraceCheckUtils]: 23: Hoare triple {20553#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {20553#false} is VALID [2022-04-28 10:09:21,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {20553#false} ~cond := #in~cond; {20553#false} is VALID [2022-04-28 10:09:21,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {20553#false} assume 0 == ~cond; {20553#false} is VALID [2022-04-28 10:09:21,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {20553#false} assume !false; {20553#false} is VALID [2022-04-28 10:09:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:09:21,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:21,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {20553#false} assume !false; {20553#false} is VALID [2022-04-28 10:09:21,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {20553#false} assume 0 == ~cond; {20553#false} is VALID [2022-04-28 10:09:21,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {20553#false} ~cond := #in~cond; {20553#false} is VALID [2022-04-28 10:09:21,439 INFO L272 TraceCheckUtils]: 23: Hoare triple {20553#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {20553#false} is VALID [2022-04-28 10:09:21,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20553#false} is VALID [2022-04-28 10:09:21,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {20557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20617#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {20590#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:21,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {20594#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {20590#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:21,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {20598#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20594#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {20598#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {20598#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:21,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {20598#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {20598#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:21,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {20594#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20598#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:21,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {20590#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20594#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:21,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {20557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20590#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:21,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {20552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:21,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {20552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20552#true} is VALID [2022-04-28 10:09:21,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {20552#true} call #t~ret13 := main(); {20552#true} is VALID [2022-04-28 10:09:21,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20552#true} {20552#true} #72#return; {20552#true} is VALID [2022-04-28 10:09:21,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {20552#true} assume true; {20552#true} is VALID [2022-04-28 10:09:21,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {20552#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); {20552#true} is VALID [2022-04-28 10:09:21,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {20552#true} call ULTIMATE.init(); {20552#true} is VALID [2022-04-28 10:09:21,448 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:09:21,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617202914] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:21,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:21,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2022-04-28 10:09:21,449 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:21,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1054121826] [2022-04-28 10:09:21,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1054121826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:21,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:21,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:09:21,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750999561] [2022-04-28 10:09:21,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:21,450 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 27 [2022-04-28 10:09:21,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:21,450 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), 10 states have internal predecessors, (20), 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-28 10:09:21,469 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-28 10:09:21,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:09:21,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:21,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:09:21,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:09:21,470 INFO L87 Difference]: Start difference. First operand 148 states and 198 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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-28 10:09:22,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:22,456 INFO L93 Difference]: Finished difference Result 186 states and 253 transitions. [2022-04-28 10:09:22,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:09:22,456 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 27 [2022-04-28 10:09:22,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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-28 10:09:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 10:09:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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-28 10:09:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 10:09:22,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-28 10:09:22,527 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-28 10:09:22,529 INFO L225 Difference]: With dead ends: 186 [2022-04-28 10:09:22,529 INFO L226 Difference]: Without dead ends: 181 [2022-04-28 10:09:22,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:09:22,530 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 61 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:22,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 49 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-28 10:09:22,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 166. [2022-04-28 10:09:22,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:22,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:22,969 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:22,969 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:22,970 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2022-04-28 10:09:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 245 transitions. [2022-04-28 10:09:22,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:22,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:22,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 3 states have call successors, (3), 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 181 states. [2022-04-28 10:09:22,971 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 3 states have call successors, (3), 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 181 states. [2022-04-28 10:09:22,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:22,974 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2022-04-28 10:09:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 245 transitions. [2022-04-28 10:09:22,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:22,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:22,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:22,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2022-04-28 10:09:22,977 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 27 [2022-04-28 10:09:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:22,977 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2022-04-28 10:09:22,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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-28 10:09:22,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 226 transitions. [2022-04-28 10:09:23,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:23,537 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2022-04-28 10:09:23,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:09:23,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:23,538 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:23,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:23,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:23,739 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:23,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:23,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1224419256, now seen corresponding path program 21 times [2022-04-28 10:09:23,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:23,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [835224664] [2022-04-28 10:09:23,742 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:23,742 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:23,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1224419256, now seen corresponding path program 22 times [2022-04-28 10:09:23,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:23,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618033643] [2022-04-28 10:09:23,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:23,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:23,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {21826#(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); {21813#true} is VALID [2022-04-28 10:09:23,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {21813#true} assume true; {21813#true} is VALID [2022-04-28 10:09:23,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21813#true} {21813#true} #72#return; {21813#true} is VALID [2022-04-28 10:09:23,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {21813#true} call ULTIMATE.init(); {21826#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:23,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {21826#(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); {21813#true} is VALID [2022-04-28 10:09:23,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {21813#true} assume true; {21813#true} is VALID [2022-04-28 10:09:23,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21813#true} {21813#true} #72#return; {21813#true} is VALID [2022-04-28 10:09:23,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {21813#true} call #t~ret13 := main(); {21813#true} is VALID [2022-04-28 10:09:23,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {21813#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21818#(= main_~y~0 0)} is VALID [2022-04-28 10:09:23,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {21818#(= 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; {21819#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:23,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {21819#(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; {21820#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:23,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {21820#(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; {21821#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:23,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {21821#(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; {21822#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:23,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {21822#(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; {21823#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:23,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {21823#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {21823#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:23,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {21823#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {21824#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:23,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {21824#(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; {21825#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:23,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {21825#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {21814#false} is VALID [2022-04-28 10:09:23,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {21814#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21814#false} is VALID [2022-04-28 10:09:23,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {21814#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21814#false} is VALID [2022-04-28 10:09:23,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {21814#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21814#false} is VALID [2022-04-28 10:09:23,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {21814#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21814#false} is VALID [2022-04-28 10:09:23,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {21814#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21814#false} is VALID [2022-04-28 10:09:23,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {21814#false} assume !(~y~0 % 4294967296 > 0); {21814#false} is VALID [2022-04-28 10:09:23,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {21814#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {21814#false} is VALID [2022-04-28 10:09:23,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {21814#false} assume !(~x~0 % 4294967296 > 0); {21814#false} is VALID [2022-04-28 10:09:23,886 INFO L272 TraceCheckUtils]: 23: Hoare triple {21814#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {21814#false} is VALID [2022-04-28 10:09:23,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {21814#false} ~cond := #in~cond; {21814#false} is VALID [2022-04-28 10:09:23,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {21814#false} assume 0 == ~cond; {21814#false} is VALID [2022-04-28 10:09:23,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {21814#false} assume !false; {21814#false} is VALID [2022-04-28 10:09:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:09:23,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:23,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618033643] [2022-04-28 10:09:23,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618033643] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:23,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773861154] [2022-04-28 10:09:23,887 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:23,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:23,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:23,892 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:23,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 10:09:23,947 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:23,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:23,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:09:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:23,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:24,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {21813#true} call ULTIMATE.init(); {21813#true} is VALID [2022-04-28 10:09:24,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {21813#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); {21813#true} is VALID [2022-04-28 10:09:24,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {21813#true} assume true; {21813#true} is VALID [2022-04-28 10:09:24,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21813#true} {21813#true} #72#return; {21813#true} is VALID [2022-04-28 10:09:24,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {21813#true} call #t~ret13 := main(); {21813#true} is VALID [2022-04-28 10:09:24,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {21813#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21818#(= main_~y~0 0)} is VALID [2022-04-28 10:09:24,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {21818#(= 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; {21819#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:24,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {21819#(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; {21820#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:24,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {21820#(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; {21821#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:24,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {21821#(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; {21822#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:24,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {21822#(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; {21823#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:24,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {21823#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {21823#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:24,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {21823#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {21824#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:24,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {21824#(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; {21869#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:24,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {21869#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {21814#false} is VALID [2022-04-28 10:09:24,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {21814#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21814#false} is VALID [2022-04-28 10:09:24,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {21814#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21814#false} is VALID [2022-04-28 10:09:24,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {21814#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21814#false} is VALID [2022-04-28 10:09:24,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {21814#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21814#false} is VALID [2022-04-28 10:09:24,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {21814#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21814#false} is VALID [2022-04-28 10:09:24,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {21814#false} assume !(~y~0 % 4294967296 > 0); {21814#false} is VALID [2022-04-28 10:09:24,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {21814#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {21814#false} is VALID [2022-04-28 10:09:24,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {21814#false} assume !(~x~0 % 4294967296 > 0); {21814#false} is VALID [2022-04-28 10:09:24,191 INFO L272 TraceCheckUtils]: 23: Hoare triple {21814#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {21814#false} is VALID [2022-04-28 10:09:24,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {21814#false} ~cond := #in~cond; {21814#false} is VALID [2022-04-28 10:09:24,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {21814#false} assume 0 == ~cond; {21814#false} is VALID [2022-04-28 10:09:24,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {21814#false} assume !false; {21814#false} is VALID [2022-04-28 10:09:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:09:24,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:24,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {21814#false} assume !false; {21814#false} is VALID [2022-04-28 10:09:24,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {21814#false} assume 0 == ~cond; {21814#false} is VALID [2022-04-28 10:09:24,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {21814#false} ~cond := #in~cond; {21814#false} is VALID [2022-04-28 10:09:24,378 INFO L272 TraceCheckUtils]: 23: Hoare triple {21814#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {21814#false} is VALID [2022-04-28 10:09:24,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {21814#false} assume !(~x~0 % 4294967296 > 0); {21814#false} is VALID [2022-04-28 10:09:24,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {21814#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {21814#false} is VALID [2022-04-28 10:09:24,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {21814#false} assume !(~y~0 % 4294967296 > 0); {21814#false} is VALID [2022-04-28 10:09:24,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {21814#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21814#false} is VALID [2022-04-28 10:09:24,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {21814#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21814#false} is VALID [2022-04-28 10:09:24,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {21814#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21814#false} is VALID [2022-04-28 10:09:24,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {21814#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21814#false} is VALID [2022-04-28 10:09:24,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {21814#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21814#false} is VALID [2022-04-28 10:09:24,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {21945#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21814#false} is VALID [2022-04-28 10:09:24,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {21949#(< 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; {21945#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:24,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {21953#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {21949#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:24,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {21953#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {21953#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:24,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {21960#(< 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; {21953#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:24,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {21964#(< 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; {21960#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:24,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {21968#(< 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; {21964#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:24,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {21972#(< 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; {21968#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:24,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {21976#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21972#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:24,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {21813#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21976#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:24,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {21813#true} call #t~ret13 := main(); {21813#true} is VALID [2022-04-28 10:09:24,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21813#true} {21813#true} #72#return; {21813#true} is VALID [2022-04-28 10:09:24,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {21813#true} assume true; {21813#true} is VALID [2022-04-28 10:09:24,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {21813#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); {21813#true} is VALID [2022-04-28 10:09:24,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {21813#true} call ULTIMATE.init(); {21813#true} is VALID [2022-04-28 10:09:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:09:24,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773861154] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:24,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:24,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:09:24,388 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:24,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [835224664] [2022-04-28 10:09:24,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [835224664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:24,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:24,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:09:24,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568959771] [2022-04-28 10:09:24,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:24,389 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 27 [2022-04-28 10:09:24,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:24,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-28 10:09:24,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:24,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:09:24,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:24,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:09:24,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:09:24,406 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-28 10:09:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:25,502 INFO L93 Difference]: Finished difference Result 212 states and 272 transitions. [2022-04-28 10:09:25,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:09:25,503 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 27 [2022-04-28 10:09:25,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-28 10:09:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-28 10:09:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-28 10:09:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-28 10:09:25,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 58 transitions. [2022-04-28 10:09:25,548 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-28 10:09:25,551 INFO L225 Difference]: With dead ends: 212 [2022-04-28 10:09:25,551 INFO L226 Difference]: Without dead ends: 199 [2022-04-28 10:09:25,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:09:25,552 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:25,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 63 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-04-28 10:09:25,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 166. [2022-04-28 10:09:25,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:25,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:25,998 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:25,998 INFO L87 Difference]: Start difference. First operand 199 states. Second operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:26,000 INFO L93 Difference]: Finished difference Result 199 states and 259 transitions. [2022-04-28 10:09:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 259 transitions. [2022-04-28 10:09:26,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:26,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:26,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 3 states have call successors, (3), 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 199 states. [2022-04-28 10:09:26,001 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 3 states have call successors, (3), 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 199 states. [2022-04-28 10:09:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:26,004 INFO L93 Difference]: Finished difference Result 199 states and 259 transitions. [2022-04-28 10:09:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 259 transitions. [2022-04-28 10:09:26,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:26,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:26,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:26,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 225 transitions. [2022-04-28 10:09:26,008 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 225 transitions. Word has length 27 [2022-04-28 10:09:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:26,008 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 225 transitions. [2022-04-28 10:09:26,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-28 10:09:26,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 225 transitions. [2022-04-28 10:09:26,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 225 transitions. [2022-04-28 10:09:26,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:09:26,606 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:26,606 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:26,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-28 10:09:26,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:26,807 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:26,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:26,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1027421464, now seen corresponding path program 23 times [2022-04-28 10:09:26,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:26,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1553409840] [2022-04-28 10:09:26,811 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:26,811 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:26,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1027421464, now seen corresponding path program 24 times [2022-04-28 10:09:26,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:26,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150725036] [2022-04-28 10:09:26,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:26,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:27,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:27,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {23188#(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); {23169#true} is VALID [2022-04-28 10:09:27,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {23169#true} assume true; {23169#true} is VALID [2022-04-28 10:09:27,077 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23169#true} {23169#true} #72#return; {23169#true} is VALID [2022-04-28 10:09:27,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {23169#true} call ULTIMATE.init(); {23188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:27,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {23188#(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); {23169#true} is VALID [2022-04-28 10:09:27,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {23169#true} assume true; {23169#true} is VALID [2022-04-28 10:09:27,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23169#true} {23169#true} #72#return; {23169#true} is VALID [2022-04-28 10:09:27,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {23169#true} call #t~ret13 := main(); {23169#true} is VALID [2022-04-28 10:09:27,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {23169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23174#(= main_~y~0 0)} is VALID [2022-04-28 10:09:27,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {23174#(= 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; {23175#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:27,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {23175#(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; {23176#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:27,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {23176#(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; {23177#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:27,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {23177#(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; {23178#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:27,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {23178#(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; {23179#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:27,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {23179#(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; {23180#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:27,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {23180#(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; {23181#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:27,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {23181#(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; {23182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:27,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {23182#(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; {23183#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:27,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {23183#(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; {23184#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:27,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {23184#(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; {23185#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:27,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {23185#(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; {23186#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:27,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {23186#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {23186#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:27,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {23186#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {23187#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-28 10:09:27,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {23187#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {23170#false} is VALID [2022-04-28 10:09:27,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {23170#false} assume !(~y~0 % 4294967296 > 0); {23170#false} is VALID [2022-04-28 10:09:27,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {23170#false} assume !(~x~0 % 4294967296 > 0); {23170#false} is VALID [2022-04-28 10:09:27,089 INFO L272 TraceCheckUtils]: 23: Hoare triple {23170#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {23170#false} is VALID [2022-04-28 10:09:27,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {23170#false} ~cond := #in~cond; {23170#false} is VALID [2022-04-28 10:09:27,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {23170#false} assume 0 == ~cond; {23170#false} is VALID [2022-04-28 10:09:27,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {23170#false} assume !false; {23170#false} is VALID [2022-04-28 10:09:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:27,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:27,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150725036] [2022-04-28 10:09:27,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150725036] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:27,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221676722] [2022-04-28 10:09:27,090 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:27,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:27,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:27,092 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:27,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 10:09:27,177 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:09:27,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:27,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:09:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:27,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:27,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {23169#true} call ULTIMATE.init(); {23169#true} is VALID [2022-04-28 10:09:27,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {23169#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); {23169#true} is VALID [2022-04-28 10:09:27,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {23169#true} assume true; {23169#true} is VALID [2022-04-28 10:09:27,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23169#true} {23169#true} #72#return; {23169#true} is VALID [2022-04-28 10:09:27,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {23169#true} call #t~ret13 := main(); {23169#true} is VALID [2022-04-28 10:09:27,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {23169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23174#(= main_~y~0 0)} is VALID [2022-04-28 10:09:27,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {23174#(= 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; {23175#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:27,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {23175#(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; {23176#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:27,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {23176#(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; {23177#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:27,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {23177#(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; {23178#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:27,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {23178#(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; {23179#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:27,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {23179#(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; {23180#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:27,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {23180#(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; {23181#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:27,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {23181#(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; {23182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:27,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {23182#(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; {23183#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:27,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {23183#(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; {23184#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:27,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {23184#(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; {23185#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:27,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {23185#(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; {23186#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:27,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {23186#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {23186#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:27,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {23186#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {23249#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:09:27,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {23249#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {23170#false} is VALID [2022-04-28 10:09:27,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {23170#false} assume !(~y~0 % 4294967296 > 0); {23170#false} is VALID [2022-04-28 10:09:27,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {23170#false} assume !(~x~0 % 4294967296 > 0); {23170#false} is VALID [2022-04-28 10:09:27,449 INFO L272 TraceCheckUtils]: 23: Hoare triple {23170#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {23170#false} is VALID [2022-04-28 10:09:27,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {23170#false} ~cond := #in~cond; {23170#false} is VALID [2022-04-28 10:09:27,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {23170#false} assume 0 == ~cond; {23170#false} is VALID [2022-04-28 10:09:27,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {23170#false} assume !false; {23170#false} is VALID [2022-04-28 10:09:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:27,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:27,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {23170#false} assume !false; {23170#false} is VALID [2022-04-28 10:09:27,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {23170#false} assume 0 == ~cond; {23170#false} is VALID [2022-04-28 10:09:27,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {23170#false} ~cond := #in~cond; {23170#false} is VALID [2022-04-28 10:09:27,865 INFO L272 TraceCheckUtils]: 23: Hoare triple {23170#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {23170#false} is VALID [2022-04-28 10:09:27,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {23170#false} assume !(~x~0 % 4294967296 > 0); {23170#false} is VALID [2022-04-28 10:09:27,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {23170#false} assume !(~y~0 % 4294967296 > 0); {23170#false} is VALID [2022-04-28 10:09:27,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {23289#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {23170#false} is VALID [2022-04-28 10:09:27,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {23293#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {23289#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:27,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {23293#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {23293#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:27,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {23300#(< 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; {23293#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:27,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {23304#(< 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; {23300#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:27,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {23308#(< 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; {23304#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:27,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {23312#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23308#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:27,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {23316#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23312#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:27,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {23320#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23316#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:27,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {23324#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23320#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:27,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {23328#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23324#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:27,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {23332#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23328#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:27,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {23336#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23332#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:27,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {23340#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23336#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:27,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {23344#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23340#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:09:27,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {23169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23344#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:09:27,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {23169#true} call #t~ret13 := main(); {23169#true} is VALID [2022-04-28 10:09:27,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23169#true} {23169#true} #72#return; {23169#true} is VALID [2022-04-28 10:09:27,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {23169#true} assume true; {23169#true} is VALID [2022-04-28 10:09:27,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {23169#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); {23169#true} is VALID [2022-04-28 10:09:27,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {23169#true} call ULTIMATE.init(); {23169#true} is VALID [2022-04-28 10:09:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:27,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221676722] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:27,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:27,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:09:27,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:27,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1553409840] [2022-04-28 10:09:27,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1553409840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:27,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:27,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:09:27,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101031467] [2022-04-28 10:09:27,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:27,881 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 27 [2022-04-28 10:09:27,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:27,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:27,899 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-28 10:09:27,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:09:27,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:27,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:09:27,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:09:27,900 INFO L87 Difference]: Start difference. First operand 166 states and 225 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:30,241 INFO L93 Difference]: Finished difference Result 267 states and 405 transitions. [2022-04-28 10:09:30,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:09:30,241 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 27 [2022-04-28 10:09:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 111 transitions. [2022-04-28 10:09:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 111 transitions. [2022-04-28 10:09:30,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 111 transitions. [2022-04-28 10:09:30,331 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-28 10:09:30,335 INFO L225 Difference]: With dead ends: 267 [2022-04-28 10:09:30,335 INFO L226 Difference]: Without dead ends: 248 [2022-04-28 10:09:30,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=472, Invalid=1598, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:09:30,336 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 98 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:30,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 113 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:09:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-04-28 10:09:30,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 179. [2022-04-28 10:09:30,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:30,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:30,810 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:30,810 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:30,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:30,814 INFO L93 Difference]: Finished difference Result 248 states and 314 transitions. [2022-04-28 10:09:30,814 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 314 transitions. [2022-04-28 10:09:30,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:30,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:30,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 3 states have call successors, (3), 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 248 states. [2022-04-28 10:09:30,815 INFO L87 Difference]: Start difference. First operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 3 states have call successors, (3), 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 248 states. [2022-04-28 10:09:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:30,819 INFO L93 Difference]: Finished difference Result 248 states and 314 transitions. [2022-04-28 10:09:30,819 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 314 transitions. [2022-04-28 10:09:30,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:30,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:30,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:30,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:30,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 244 transitions. [2022-04-28 10:09:30,823 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 244 transitions. Word has length 27 [2022-04-28 10:09:30,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:30,823 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 244 transitions. [2022-04-28 10:09:30,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:30,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 179 states and 244 transitions. [2022-04-28 10:09:31,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 244 transitions. [2022-04-28 10:09:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:09:31,559 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:31,560 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:31,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:31,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:31,760 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:31,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash 125389104, now seen corresponding path program 23 times [2022-04-28 10:09:31,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:31,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [564392381] [2022-04-28 10:09:31,763 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:31,763 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash 125389104, now seen corresponding path program 24 times [2022-04-28 10:09:31,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:31,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666153782] [2022-04-28 10:09:31,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:31,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:31,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:31,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {24790#(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); {24781#true} is VALID [2022-04-28 10:09:31,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {24781#true} assume true; {24781#true} is VALID [2022-04-28 10:09:31,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24781#true} {24781#true} #72#return; {24781#true} is VALID [2022-04-28 10:09:31,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {24781#true} call ULTIMATE.init(); {24790#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:31,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {24790#(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); {24781#true} is VALID [2022-04-28 10:09:31,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {24781#true} assume true; {24781#true} is VALID [2022-04-28 10:09:31,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24781#true} {24781#true} #72#return; {24781#true} is VALID [2022-04-28 10:09:31,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {24781#true} call #t~ret13 := main(); {24781#true} is VALID [2022-04-28 10:09:31,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {24781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24781#true} is VALID [2022-04-28 10:09:31,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {24781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24781#true} is VALID [2022-04-28 10:09:31,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {24781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24781#true} is VALID [2022-04-28 10:09:31,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {24781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24781#true} is VALID [2022-04-28 10:09:31,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {24781#true} assume !(~x~0 % 4294967296 > 0); {24786#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:31,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {24786#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {24786#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:31,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {24786#(<= 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; {24787#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:31,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {24787#(<= 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; {24788#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:31,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {24788#(<= 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; {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:31,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:31,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:31,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:31,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:31,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:31,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {24788#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:31,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {24788#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {24787#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:31,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {24787#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {24786#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:31,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {24786#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {24782#false} is VALID [2022-04-28 10:09:31,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {24782#false} assume !(~x~0 % 4294967296 > 0); {24782#false} is VALID [2022-04-28 10:09:31,867 INFO L272 TraceCheckUtils]: 24: Hoare triple {24782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {24782#false} is VALID [2022-04-28 10:09:31,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {24782#false} ~cond := #in~cond; {24782#false} is VALID [2022-04-28 10:09:31,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {24782#false} assume 0 == ~cond; {24782#false} is VALID [2022-04-28 10:09:31,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {24782#false} assume !false; {24782#false} is VALID [2022-04-28 10:09:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:31,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:31,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666153782] [2022-04-28 10:09:31,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666153782] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:31,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883621470] [2022-04-28 10:09:31,868 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:31,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:31,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:31,869 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:31,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 10:09:31,922 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:09:31,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:31,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:09:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:31,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:32,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {24781#true} call ULTIMATE.init(); {24781#true} is VALID [2022-04-28 10:09:32,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {24781#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); {24781#true} is VALID [2022-04-28 10:09:32,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {24781#true} assume true; {24781#true} is VALID [2022-04-28 10:09:32,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24781#true} {24781#true} #72#return; {24781#true} is VALID [2022-04-28 10:09:32,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {24781#true} call #t~ret13 := main(); {24781#true} is VALID [2022-04-28 10:09:32,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {24781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24781#true} is VALID [2022-04-28 10:09:32,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {24781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24781#true} is VALID [2022-04-28 10:09:32,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {24781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24781#true} is VALID [2022-04-28 10:09:32,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {24781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24781#true} is VALID [2022-04-28 10:09:32,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {24781#true} assume !(~x~0 % 4294967296 > 0); {24786#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:32,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {24786#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {24786#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:32,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {24786#(<= 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; {24787#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:32,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {24787#(<= 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; {24788#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {24788#(<= 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; {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {24788#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {24788#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {24787#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:32,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {24787#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {24786#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:32,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {24786#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {24782#false} is VALID [2022-04-28 10:09:32,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {24782#false} assume !(~x~0 % 4294967296 > 0); {24782#false} is VALID [2022-04-28 10:09:32,151 INFO L272 TraceCheckUtils]: 24: Hoare triple {24782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {24782#false} is VALID [2022-04-28 10:09:32,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {24782#false} ~cond := #in~cond; {24782#false} is VALID [2022-04-28 10:09:32,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {24782#false} assume 0 == ~cond; {24782#false} is VALID [2022-04-28 10:09:32,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {24782#false} assume !false; {24782#false} is VALID [2022-04-28 10:09:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:32,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:32,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {24782#false} assume !false; {24782#false} is VALID [2022-04-28 10:09:32,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {24782#false} assume 0 == ~cond; {24782#false} is VALID [2022-04-28 10:09:32,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {24782#false} ~cond := #in~cond; {24782#false} is VALID [2022-04-28 10:09:32,363 INFO L272 TraceCheckUtils]: 24: Hoare triple {24782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {24782#false} is VALID [2022-04-28 10:09:32,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {24782#false} assume !(~x~0 % 4294967296 > 0); {24782#false} is VALID [2022-04-28 10:09:32,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {24786#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {24782#false} is VALID [2022-04-28 10:09:32,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {24787#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {24786#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:32,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {24788#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {24787#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:32,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {24788#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {24788#(<= 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; {24789#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {24787#(<= 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; {24788#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {24786#(<= 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; {24787#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:32,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {24786#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {24786#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:32,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {24781#true} assume !(~x~0 % 4294967296 > 0); {24786#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:32,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {24781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24781#true} is VALID [2022-04-28 10:09:32,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {24781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24781#true} is VALID [2022-04-28 10:09:32,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {24781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24781#true} is VALID [2022-04-28 10:09:32,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {24781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24781#true} is VALID [2022-04-28 10:09:32,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {24781#true} call #t~ret13 := main(); {24781#true} is VALID [2022-04-28 10:09:32,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24781#true} {24781#true} #72#return; {24781#true} is VALID [2022-04-28 10:09:32,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {24781#true} assume true; {24781#true} is VALID [2022-04-28 10:09:32,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {24781#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); {24781#true} is VALID [2022-04-28 10:09:32,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {24781#true} call ULTIMATE.init(); {24781#true} is VALID [2022-04-28 10:09:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:32,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883621470] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:32,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:32,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-28 10:09:32,372 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:32,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [564392381] [2022-04-28 10:09:32,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [564392381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:32,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:32,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:09:32,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721506992] [2022-04-28 10:09:32,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:32,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 28 [2022-04-28 10:09:32,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:32,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-28 10:09:32,392 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-28 10:09:32,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:09:32,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:32,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:09:32,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:09:32,393 INFO L87 Difference]: Start difference. First operand 179 states and 244 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-28 10:09:33,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:33,304 INFO L93 Difference]: Finished difference Result 197 states and 263 transitions. [2022-04-28 10:09:33,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:09:33,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 28 [2022-04-28 10:09:33,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-28 10:09:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 10:09:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-28 10:09:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 10:09:33,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-28 10:09:33,343 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-28 10:09:33,344 INFO L225 Difference]: With dead ends: 197 [2022-04-28 10:09:33,345 INFO L226 Difference]: Without dead ends: 178 [2022-04-28 10:09:33,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:09:33,347 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:33,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 48 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:33,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-04-28 10:09:33,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2022-04-28 10:09:33,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:33,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:33,810 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:33,811 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:33,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:33,813 INFO L93 Difference]: Finished difference Result 178 states and 242 transitions. [2022-04-28 10:09:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 242 transitions. [2022-04-28 10:09:33,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:33,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:33,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 178 states. [2022-04-28 10:09:33,814 INFO L87 Difference]: Start difference. First operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 178 states. [2022-04-28 10:09:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:33,816 INFO L93 Difference]: Finished difference Result 178 states and 242 transitions. [2022-04-28 10:09:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 242 transitions. [2022-04-28 10:09:33,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:33,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:33,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:33,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 239 transitions. [2022-04-28 10:09:33,820 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 239 transitions. Word has length 28 [2022-04-28 10:09:33,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:33,820 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 239 transitions. [2022-04-28 10:09:33,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-28 10:09:33,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 239 transitions. [2022-04-28 10:09:34,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:34,385 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 239 transitions. [2022-04-28 10:09:34,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:09:34,385 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:34,386 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:34,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:34,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-28 10:09:34,591 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:34,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2010729856, now seen corresponding path program 13 times [2022-04-28 10:09:34,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:34,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1190576678] [2022-04-28 10:09:34,609 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:34,609 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:34,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2010729856, now seen corresponding path program 14 times [2022-04-28 10:09:34,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:34,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059626896] [2022-04-28 10:09:34,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:34,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:34,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:34,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {26081#(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); {26066#true} is VALID [2022-04-28 10:09:34,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {26066#true} assume true; {26066#true} is VALID [2022-04-28 10:09:34,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26066#true} {26066#true} #72#return; {26066#true} is VALID [2022-04-28 10:09:34,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {26066#true} call ULTIMATE.init(); {26081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:34,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {26081#(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); {26066#true} is VALID [2022-04-28 10:09:34,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {26066#true} assume true; {26066#true} is VALID [2022-04-28 10:09:34,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26066#true} {26066#true} #72#return; {26066#true} is VALID [2022-04-28 10:09:34,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {26066#true} call #t~ret13 := main(); {26066#true} is VALID [2022-04-28 10:09:34,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {26066#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26071#(= main_~y~0 0)} is VALID [2022-04-28 10:09:34,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {26071#(= 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; {26072#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:34,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {26072#(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; {26073#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:34,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {26073#(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; {26074#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:34,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {26074#(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; {26075#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:34,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {26075#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {26075#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:34,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {26075#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {26076#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:34,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {26076#(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; {26077#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:34,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {26077#(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; {26078#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:34,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {26078#(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; {26079#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:34,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {26079#(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; {26080#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:34,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {26080#(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; {26067#false} is VALID [2022-04-28 10:09:34,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {26067#false} assume !(~z~0 % 4294967296 > 0); {26067#false} is VALID [2022-04-28 10:09:34,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {26067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26067#false} is VALID [2022-04-28 10:09:34,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {26067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26067#false} is VALID [2022-04-28 10:09:34,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {26067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26067#false} is VALID [2022-04-28 10:09:34,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {26067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26067#false} is VALID [2022-04-28 10:09:34,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {26067#false} assume !(~y~0 % 4294967296 > 0); {26067#false} is VALID [2022-04-28 10:09:34,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {26067#false} assume !(~x~0 % 4294967296 > 0); {26067#false} is VALID [2022-04-28 10:09:34,789 INFO L272 TraceCheckUtils]: 24: Hoare triple {26067#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {26067#false} is VALID [2022-04-28 10:09:34,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {26067#false} ~cond := #in~cond; {26067#false} is VALID [2022-04-28 10:09:34,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {26067#false} assume 0 == ~cond; {26067#false} is VALID [2022-04-28 10:09:34,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {26067#false} assume !false; {26067#false} is VALID [2022-04-28 10:09:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:09:34,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:34,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059626896] [2022-04-28 10:09:34,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059626896] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:34,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254008819] [2022-04-28 10:09:34,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:34,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:34,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:34,792 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:34,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 10:09:34,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:34,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:34,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:09:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:34,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:35,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {26066#true} call ULTIMATE.init(); {26066#true} is VALID [2022-04-28 10:09:35,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {26066#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); {26066#true} is VALID [2022-04-28 10:09:35,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {26066#true} assume true; {26066#true} is VALID [2022-04-28 10:09:35,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26066#true} {26066#true} #72#return; {26066#true} is VALID [2022-04-28 10:09:35,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {26066#true} call #t~ret13 := main(); {26066#true} is VALID [2022-04-28 10:09:35,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {26066#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26071#(= main_~y~0 0)} is VALID [2022-04-28 10:09:35,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {26071#(= 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; {26072#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:35,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {26072#(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; {26073#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:35,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {26073#(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; {26074#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:35,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {26074#(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; {26075#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:35,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {26075#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {26075#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:35,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {26075#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {26118#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:35,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {26118#(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; {26122#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:35,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {26122#(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; {26126#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:35,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {26126#(and (= main_~y~0 (+ main_~z~0 2)) (<= 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; {26130#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:09:35,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {26130#(and (<= main_~y~0 4) (<= 4 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; {26134#(and (<= main_~y~0 4) (= main_~y~0 (+ main_~z~0 4)) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:35,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {26134#(and (<= main_~y~0 4) (= main_~y~0 (+ main_~z~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; {26067#false} is VALID [2022-04-28 10:09:35,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {26067#false} assume !(~z~0 % 4294967296 > 0); {26067#false} is VALID [2022-04-28 10:09:35,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {26067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26067#false} is VALID [2022-04-28 10:09:35,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {26067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26067#false} is VALID [2022-04-28 10:09:35,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {26067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26067#false} is VALID [2022-04-28 10:09:35,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {26067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26067#false} is VALID [2022-04-28 10:09:35,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {26067#false} assume !(~y~0 % 4294967296 > 0); {26067#false} is VALID [2022-04-28 10:09:35,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {26067#false} assume !(~x~0 % 4294967296 > 0); {26067#false} is VALID [2022-04-28 10:09:35,068 INFO L272 TraceCheckUtils]: 24: Hoare triple {26067#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {26067#false} is VALID [2022-04-28 10:09:35,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {26067#false} ~cond := #in~cond; {26067#false} is VALID [2022-04-28 10:09:35,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {26067#false} assume 0 == ~cond; {26067#false} is VALID [2022-04-28 10:09:35,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {26067#false} assume !false; {26067#false} is VALID [2022-04-28 10:09:35,069 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:09:35,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:35,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {26067#false} assume !false; {26067#false} is VALID [2022-04-28 10:09:35,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {26067#false} assume 0 == ~cond; {26067#false} is VALID [2022-04-28 10:09:35,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {26067#false} ~cond := #in~cond; {26067#false} is VALID [2022-04-28 10:09:35,357 INFO L272 TraceCheckUtils]: 24: Hoare triple {26067#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {26067#false} is VALID [2022-04-28 10:09:35,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {26067#false} assume !(~x~0 % 4294967296 > 0); {26067#false} is VALID [2022-04-28 10:09:35,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {26186#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {26067#false} is VALID [2022-04-28 10:09:35,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {26190#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26186#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:35,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {26194#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26190#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:35,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {26198#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26194#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:35,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {26202#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26198#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:35,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {26202#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {26202#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:35,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {26209#(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; {26202#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:35,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {26213#(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; {26209#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:35,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {26217#(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; {26213#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:35,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {26221#(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; {26217#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:35,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {26225#(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; {26221#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:35,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {26066#true} ~z~0 := ~y~0; {26225#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:35,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {26066#true} assume !(~x~0 % 4294967296 > 0); {26066#true} is VALID [2022-04-28 10:09:35,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {26066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26066#true} is VALID [2022-04-28 10:09:35,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {26066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26066#true} is VALID [2022-04-28 10:09:35,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {26066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26066#true} is VALID [2022-04-28 10:09:35,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {26066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26066#true} is VALID [2022-04-28 10:09:35,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {26066#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26066#true} is VALID [2022-04-28 10:09:35,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {26066#true} call #t~ret13 := main(); {26066#true} is VALID [2022-04-28 10:09:35,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26066#true} {26066#true} #72#return; {26066#true} is VALID [2022-04-28 10:09:35,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {26066#true} assume true; {26066#true} is VALID [2022-04-28 10:09:35,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {26066#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); {26066#true} is VALID [2022-04-28 10:09:35,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {26066#true} call ULTIMATE.init(); {26066#true} is VALID [2022-04-28 10:09:35,366 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:09:35,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254008819] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:35,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:35,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2022-04-28 10:09:35,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:35,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1190576678] [2022-04-28 10:09:35,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1190576678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:35,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:35,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:09:35,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768191320] [2022-04-28 10:09:35,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:35,367 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 28 [2022-04-28 10:09:35,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:35,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:09:35,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:35,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:09:35,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:35,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:09:35,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:09:35,385 INFO L87 Difference]: Start difference. First operand 175 states and 239 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:09:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:36,575 INFO L93 Difference]: Finished difference Result 206 states and 271 transitions. [2022-04-28 10:09:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:09:36,575 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 28 [2022-04-28 10:09:36,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:36,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:09:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. [2022-04-28 10:09:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:09:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. [2022-04-28 10:09:36,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 52 transitions. [2022-04-28 10:09:36,617 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-28 10:09:36,619 INFO L225 Difference]: With dead ends: 206 [2022-04-28 10:09:36,619 INFO L226 Difference]: Without dead ends: 185 [2022-04-28 10:09:36,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=1404, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:09:36,620 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:36,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 68 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-28 10:09:37,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 174. [2022-04-28 10:09:37,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:37,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:37,195 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:37,195 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:37,197 INFO L93 Difference]: Finished difference Result 185 states and 247 transitions. [2022-04-28 10:09:37,197 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 247 transitions. [2022-04-28 10:09:37,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:37,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:37,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 3 states have call successors, (3), 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 185 states. [2022-04-28 10:09:37,198 INFO L87 Difference]: Start difference. First operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 3 states have call successors, (3), 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 185 states. [2022-04-28 10:09:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:37,200 INFO L93 Difference]: Finished difference Result 185 states and 247 transitions. [2022-04-28 10:09:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 247 transitions. [2022-04-28 10:09:37,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:37,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:37,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:37,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2022-04-28 10:09:37,203 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 235 transitions. Word has length 28 [2022-04-28 10:09:37,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:37,203 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-04-28 10:09:37,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:09:37,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 174 states and 235 transitions. [2022-04-28 10:09:37,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-28 10:09:37,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:09:37,919 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:37,919 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:37,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:38,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:38,120 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:38,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1472968031, now seen corresponding path program 25 times [2022-04-28 10:09:38,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:38,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [615293002] [2022-04-28 10:09:38,122 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:38,123 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:38,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1472968031, now seen corresponding path program 26 times [2022-04-28 10:09:38,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:38,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984692622] [2022-04-28 10:09:38,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:38,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:38,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:38,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {27442#(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); {27422#true} is VALID [2022-04-28 10:09:38,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {27422#true} assume true; {27422#true} is VALID [2022-04-28 10:09:38,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27422#true} {27422#true} #72#return; {27422#true} is VALID [2022-04-28 10:09:38,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {27422#true} call ULTIMATE.init(); {27442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:38,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {27442#(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); {27422#true} is VALID [2022-04-28 10:09:38,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {27422#true} assume true; {27422#true} is VALID [2022-04-28 10:09:38,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27422#true} {27422#true} #72#return; {27422#true} is VALID [2022-04-28 10:09:38,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {27422#true} call #t~ret13 := main(); {27422#true} is VALID [2022-04-28 10:09:38,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {27422#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27427#(= main_~y~0 0)} is VALID [2022-04-28 10:09:38,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {27427#(= 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; {27428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:38,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {27428#(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; {27429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:38,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {27429#(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; {27430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:38,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {27430#(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; {27431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:38,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {27431#(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; {27432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:38,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {27432#(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; {27433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:38,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {27433#(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; {27434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:38,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {27434#(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; {27435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:38,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {27435#(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; {27436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:38,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {27436#(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; {27437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:38,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {27437#(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; {27438#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:38,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {27438#(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; {27439#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:38,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {27439#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:38,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {27440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:38,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {27440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {27441#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:38,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {27441#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {27423#false} is VALID [2022-04-28 10:09:38,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {27423#false} assume !(~y~0 % 4294967296 > 0); {27423#false} is VALID [2022-04-28 10:09:38,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {27423#false} assume !(~x~0 % 4294967296 > 0); {27423#false} is VALID [2022-04-28 10:09:38,386 INFO L272 TraceCheckUtils]: 24: Hoare triple {27423#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {27423#false} is VALID [2022-04-28 10:09:38,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {27423#false} ~cond := #in~cond; {27423#false} is VALID [2022-04-28 10:09:38,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {27423#false} assume 0 == ~cond; {27423#false} is VALID [2022-04-28 10:09:38,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {27423#false} assume !false; {27423#false} is VALID [2022-04-28 10:09:38,386 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:38,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:38,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984692622] [2022-04-28 10:09:38,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984692622] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:38,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703338570] [2022-04-28 10:09:38,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:38,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:38,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:38,387 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:38,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 10:09:38,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:38,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:38,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:09:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:38,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:38,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {27422#true} call ULTIMATE.init(); {27422#true} is VALID [2022-04-28 10:09:38,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {27422#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); {27422#true} is VALID [2022-04-28 10:09:38,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {27422#true} assume true; {27422#true} is VALID [2022-04-28 10:09:38,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27422#true} {27422#true} #72#return; {27422#true} is VALID [2022-04-28 10:09:38,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {27422#true} call #t~ret13 := main(); {27422#true} is VALID [2022-04-28 10:09:38,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {27422#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27427#(= main_~y~0 0)} is VALID [2022-04-28 10:09:38,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {27427#(= 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; {27428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:38,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {27428#(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; {27429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:38,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {27429#(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; {27430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:38,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {27430#(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; {27431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:38,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {27431#(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; {27432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:38,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {27432#(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; {27433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:38,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {27433#(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; {27434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:38,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {27434#(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; {27435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:38,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {27435#(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; {27436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:38,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {27436#(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; {27437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:38,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {27437#(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; {27438#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:38,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {27438#(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; {27439#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:38,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {27439#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:38,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {27440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:38,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {27440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {27506#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:09:38,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {27506#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {27423#false} is VALID [2022-04-28 10:09:38,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {27423#false} assume !(~y~0 % 4294967296 > 0); {27423#false} is VALID [2022-04-28 10:09:38,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {27423#false} assume !(~x~0 % 4294967296 > 0); {27423#false} is VALID [2022-04-28 10:09:38,696 INFO L272 TraceCheckUtils]: 24: Hoare triple {27423#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {27423#false} is VALID [2022-04-28 10:09:38,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {27423#false} ~cond := #in~cond; {27423#false} is VALID [2022-04-28 10:09:38,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {27423#false} assume 0 == ~cond; {27423#false} is VALID [2022-04-28 10:09:38,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {27423#false} assume !false; {27423#false} is VALID [2022-04-28 10:09:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:38,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:39,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {27423#false} assume !false; {27423#false} is VALID [2022-04-28 10:09:39,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {27423#false} assume 0 == ~cond; {27423#false} is VALID [2022-04-28 10:09:39,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {27423#false} ~cond := #in~cond; {27423#false} is VALID [2022-04-28 10:09:39,162 INFO L272 TraceCheckUtils]: 24: Hoare triple {27423#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {27423#false} is VALID [2022-04-28 10:09:39,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {27423#false} assume !(~x~0 % 4294967296 > 0); {27423#false} is VALID [2022-04-28 10:09:39,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {27423#false} assume !(~y~0 % 4294967296 > 0); {27423#false} is VALID [2022-04-28 10:09:39,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {27546#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27423#false} is VALID [2022-04-28 10:09:39,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {27550#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {27546#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:39,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {27550#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {27550#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:39,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {27557#(< 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; {27550#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:39,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {27561#(< 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; {27557#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:39,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {27565#(< 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; {27561#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:39,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {27569#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27565#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:39,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {27573#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27569#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:39,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {27577#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27573#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:39,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {27581#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27577#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:39,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {27585#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27581#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:39,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {27589#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27585#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:39,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {27593#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27589#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:39,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {27597#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27593#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:39,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {27601#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27597#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:09:39,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {27605#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27601#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:09:39,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {27422#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27605#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:09:39,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {27422#true} call #t~ret13 := main(); {27422#true} is VALID [2022-04-28 10:09:39,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27422#true} {27422#true} #72#return; {27422#true} is VALID [2022-04-28 10:09:39,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {27422#true} assume true; {27422#true} is VALID [2022-04-28 10:09:39,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {27422#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); {27422#true} is VALID [2022-04-28 10:09:39,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {27422#true} call ULTIMATE.init(); {27422#true} is VALID [2022-04-28 10:09:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:39,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703338570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:39,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:39,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:09:39,173 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:39,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [615293002] [2022-04-28 10:09:39,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [615293002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:39,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:39,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:09:39,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154883664] [2022-04-28 10:09:39,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:39,174 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 28 [2022-04-28 10:09:39,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:39,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:09:39,191 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-28 10:09:39,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:09:39,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:39,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:09:39,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:09:39,193 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:09:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:41,774 INFO L93 Difference]: Finished difference Result 282 states and 427 transitions. [2022-04-28 10:09:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:09:41,774 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 28 [2022-04-28 10:09:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:09:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 114 transitions. [2022-04-28 10:09:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:09:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 114 transitions. [2022-04-28 10:09:41,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 114 transitions. [2022-04-28 10:09:41,880 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-28 10:09:41,884 INFO L225 Difference]: With dead ends: 282 [2022-04-28 10:09:41,884 INFO L226 Difference]: Without dead ends: 262 [2022-04-28 10:09:41,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=535, Invalid=1817, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:09:41,885 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 98 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:41,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 118 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:09:41,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-28 10:09:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 187. [2022-04-28 10:09:42,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:42,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:42,384 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:42,384 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:42,388 INFO L93 Difference]: Finished difference Result 262 states and 330 transitions. [2022-04-28 10:09:42,388 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 330 transitions. [2022-04-28 10:09:42,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:42,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:42,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-28 10:09:42,389 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-28 10:09:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:42,394 INFO L93 Difference]: Finished difference Result 262 states and 330 transitions. [2022-04-28 10:09:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 330 transitions. [2022-04-28 10:09:42,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:42,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:42,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:42,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 254 transitions. [2022-04-28 10:09:42,398 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 254 transitions. Word has length 28 [2022-04-28 10:09:42,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:42,398 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 254 transitions. [2022-04-28 10:09:42,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:09:42,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 254 transitions. [2022-04-28 10:09:43,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 254 transitions. [2022-04-28 10:09:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:09:43,137 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:43,137 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:43,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:43,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:43,338 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:43,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1753768806, now seen corresponding path program 25 times [2022-04-28 10:09:43,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:43,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [467433869] [2022-04-28 10:09:43,340 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:43,340 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1753768806, now seen corresponding path program 26 times [2022-04-28 10:09:43,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:43,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720994244] [2022-04-28 10:09:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:43,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:43,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:43,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {29132#(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); {29118#true} is VALID [2022-04-28 10:09:43,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {29118#true} assume true; {29118#true} is VALID [2022-04-28 10:09:43,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29118#true} {29118#true} #72#return; {29118#true} is VALID [2022-04-28 10:09:43,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {29118#true} call ULTIMATE.init(); {29132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:43,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {29132#(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); {29118#true} is VALID [2022-04-28 10:09:43,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {29118#true} assume true; {29118#true} is VALID [2022-04-28 10:09:43,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29118#true} {29118#true} #72#return; {29118#true} is VALID [2022-04-28 10:09:43,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {29118#true} call #t~ret13 := main(); {29118#true} is VALID [2022-04-28 10:09:43,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {29118#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29123#(= main_~y~0 0)} is VALID [2022-04-28 10:09:43,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {29123#(= 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; {29124#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:43,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {29124#(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; {29125#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:43,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {29125#(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; {29126#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:43,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {29126#(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; {29127#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:43,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {29127#(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; {29128#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:43,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {29128#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {29128#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:43,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {29128#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {29129#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:43,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {29129#(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; {29130#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:43,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {29130#(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; {29131#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:43,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {29131#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {29119#false} is VALID [2022-04-28 10:09:43,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {29119#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29119#false} is VALID [2022-04-28 10:09:43,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {29119#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29119#false} is VALID [2022-04-28 10:09:43,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {29119#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29119#false} is VALID [2022-04-28 10:09:43,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {29119#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29119#false} is VALID [2022-04-28 10:09:43,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {29119#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29119#false} is VALID [2022-04-28 10:09:43,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {29119#false} assume !(~y~0 % 4294967296 > 0); {29119#false} is VALID [2022-04-28 10:09:43,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {29119#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {29119#false} is VALID [2022-04-28 10:09:43,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {29119#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {29119#false} is VALID [2022-04-28 10:09:43,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {29119#false} assume !(~x~0 % 4294967296 > 0); {29119#false} is VALID [2022-04-28 10:09:43,497 INFO L272 TraceCheckUtils]: 25: Hoare triple {29119#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {29119#false} is VALID [2022-04-28 10:09:43,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {29119#false} ~cond := #in~cond; {29119#false} is VALID [2022-04-28 10:09:43,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {29119#false} assume 0 == ~cond; {29119#false} is VALID [2022-04-28 10:09:43,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {29119#false} assume !false; {29119#false} is VALID [2022-04-28 10:09:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:09:43,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:43,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720994244] [2022-04-28 10:09:43,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720994244] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:43,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5765317] [2022-04-28 10:09:43,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:43,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:43,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:43,498 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:43,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 10:09:43,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:43,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:43,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:09:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:43,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:43,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {29118#true} call ULTIMATE.init(); {29118#true} is VALID [2022-04-28 10:09:43,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {29118#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); {29118#true} is VALID [2022-04-28 10:09:43,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {29118#true} assume true; {29118#true} is VALID [2022-04-28 10:09:43,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29118#true} {29118#true} #72#return; {29118#true} is VALID [2022-04-28 10:09:43,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {29118#true} call #t~ret13 := main(); {29118#true} is VALID [2022-04-28 10:09:43,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {29118#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29123#(= main_~y~0 0)} is VALID [2022-04-28 10:09:43,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {29123#(= 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; {29124#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:43,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {29124#(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; {29125#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:43,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {29125#(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; {29126#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:43,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {29126#(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; {29127#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:43,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {29127#(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; {29128#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:43,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {29128#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {29128#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:43,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {29128#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {29172#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:43,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {29172#(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; {29176#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:43,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {29176#(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; {29180#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:43,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {29180#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {29119#false} is VALID [2022-04-28 10:09:43,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {29119#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29119#false} is VALID [2022-04-28 10:09:43,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {29119#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29119#false} is VALID [2022-04-28 10:09:43,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {29119#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29119#false} is VALID [2022-04-28 10:09:43,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {29119#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29119#false} is VALID [2022-04-28 10:09:43,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {29119#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29119#false} is VALID [2022-04-28 10:09:43,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {29119#false} assume !(~y~0 % 4294967296 > 0); {29119#false} is VALID [2022-04-28 10:09:43,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {29119#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {29119#false} is VALID [2022-04-28 10:09:43,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {29119#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {29119#false} is VALID [2022-04-28 10:09:43,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {29119#false} assume !(~x~0 % 4294967296 > 0); {29119#false} is VALID [2022-04-28 10:09:43,700 INFO L272 TraceCheckUtils]: 25: Hoare triple {29119#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {29119#false} is VALID [2022-04-28 10:09:43,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {29119#false} ~cond := #in~cond; {29119#false} is VALID [2022-04-28 10:09:43,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {29119#false} assume 0 == ~cond; {29119#false} is VALID [2022-04-28 10:09:43,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {29119#false} assume !false; {29119#false} is VALID [2022-04-28 10:09:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:09:43,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:43,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {29119#false} assume !false; {29119#false} is VALID [2022-04-28 10:09:43,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {29119#false} assume 0 == ~cond; {29119#false} is VALID [2022-04-28 10:09:43,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {29119#false} ~cond := #in~cond; {29119#false} is VALID [2022-04-28 10:09:43,881 INFO L272 TraceCheckUtils]: 25: Hoare triple {29119#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {29119#false} is VALID [2022-04-28 10:09:43,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {29119#false} assume !(~x~0 % 4294967296 > 0); {29119#false} is VALID [2022-04-28 10:09:43,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {29119#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {29119#false} is VALID [2022-04-28 10:09:43,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {29119#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {29119#false} is VALID [2022-04-28 10:09:43,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {29119#false} assume !(~y~0 % 4294967296 > 0); {29119#false} is VALID [2022-04-28 10:09:43,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {29119#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29119#false} is VALID [2022-04-28 10:09:43,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {29119#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29119#false} is VALID [2022-04-28 10:09:43,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {29253#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29119#false} is VALID [2022-04-28 10:09:43,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {29257#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29253#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:43,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {29261#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29257#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:43,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {29265#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {29261#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:09:43,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {29269#(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; {29265#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:09:43,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {29273#(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; {29269#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:43,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {29118#true} ~z~0 := ~y~0; {29273#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:09:43,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {29118#true} assume !(~x~0 % 4294967296 > 0); {29118#true} is VALID [2022-04-28 10:09:43,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {29118#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29118#true} is VALID [2022-04-28 10:09:43,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {29118#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29118#true} is VALID [2022-04-28 10:09:43,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {29118#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29118#true} is VALID [2022-04-28 10:09:43,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {29118#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29118#true} is VALID [2022-04-28 10:09:43,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {29118#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29118#true} is VALID [2022-04-28 10:09:43,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {29118#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29118#true} is VALID [2022-04-28 10:09:43,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {29118#true} call #t~ret13 := main(); {29118#true} is VALID [2022-04-28 10:09:43,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29118#true} {29118#true} #72#return; {29118#true} is VALID [2022-04-28 10:09:43,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {29118#true} assume true; {29118#true} is VALID [2022-04-28 10:09:43,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {29118#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); {29118#true} is VALID [2022-04-28 10:09:43,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {29118#true} call ULTIMATE.init(); {29118#true} is VALID [2022-04-28 10:09:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:09:43,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5765317] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:43,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:43,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 21 [2022-04-28 10:09:43,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:43,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [467433869] [2022-04-28 10:09:43,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [467433869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:43,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:43,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:09:43,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376144909] [2022-04-28 10:09:43,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:43,889 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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 29 [2022-04-28 10:09:43,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:43,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-28 10:09:43,905 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-28 10:09:43,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:09:43,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:43,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:09:43,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:09:43,906 INFO L87 Difference]: Start difference. First operand 187 states and 254 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-28 10:09:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:45,127 INFO L93 Difference]: Finished difference Result 229 states and 296 transitions. [2022-04-28 10:09:45,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:09:45,127 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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 29 [2022-04-28 10:09:45,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-28 10:09:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-28 10:09:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-28 10:09:45,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-28 10:09:45,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2022-04-28 10:09:45,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:45,176 INFO L225 Difference]: With dead ends: 229 [2022-04-28 10:09:45,176 INFO L226 Difference]: Without dead ends: 215 [2022-04-28 10:09:45,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:09:45,177 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:45,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 67 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-28 10:09:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 187. [2022-04-28 10:09:45,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:45,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:45,682 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:45,683 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:45,685 INFO L93 Difference]: Finished difference Result 215 states and 282 transitions. [2022-04-28 10:09:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 282 transitions. [2022-04-28 10:09:45,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:45,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:45,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 3 states have call successors, (3), 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 215 states. [2022-04-28 10:09:45,685 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 3 states have call successors, (3), 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 215 states. [2022-04-28 10:09:45,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:45,688 INFO L93 Difference]: Finished difference Result 215 states and 282 transitions. [2022-04-28 10:09:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 282 transitions. [2022-04-28 10:09:45,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:45,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:45,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:45,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 253 transitions. [2022-04-28 10:09:45,690 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 253 transitions. Word has length 29 [2022-04-28 10:09:45,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:45,690 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 253 transitions. [2022-04-28 10:09:45,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-28 10:09:45,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 253 transitions. [2022-04-28 10:09:46,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:46,362 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 253 transitions. [2022-04-28 10:09:46,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:09:46,363 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:46,363 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:46,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-28 10:09:46,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-28 10:09:46,563 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:46,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:46,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1067548216, now seen corresponding path program 27 times [2022-04-28 10:09:46,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:46,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1616561953] [2022-04-28 10:09:46,566 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:46,566 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:46,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1067548216, now seen corresponding path program 28 times [2022-04-28 10:09:46,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:46,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501371971] [2022-04-28 10:09:46,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:46,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:46,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:46,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {30613#(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); {30599#true} is VALID [2022-04-28 10:09:46,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {30599#true} assume true; {30599#true} is VALID [2022-04-28 10:09:46,692 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30599#true} {30599#true} #72#return; {30599#true} is VALID [2022-04-28 10:09:46,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {30599#true} call ULTIMATE.init(); {30613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:46,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {30613#(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); {30599#true} is VALID [2022-04-28 10:09:46,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {30599#true} assume true; {30599#true} is VALID [2022-04-28 10:09:46,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30599#true} {30599#true} #72#return; {30599#true} is VALID [2022-04-28 10:09:46,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {30599#true} call #t~ret13 := main(); {30599#true} is VALID [2022-04-28 10:09:46,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {30599#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30604#(= main_~y~0 0)} is VALID [2022-04-28 10:09:46,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {30604#(= 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; {30605#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:46,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {30605#(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; {30606#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:46,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {30606#(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; {30607#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:46,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {30607#(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; {30608#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:46,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {30608#(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; {30609#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:46,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {30609#(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; {30610#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:46,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {30610#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {30610#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:46,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {30610#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {30611#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:46,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {30611#(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; {30612#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:46,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {30612#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {30600#false} is VALID [2022-04-28 10:09:46,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:46,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:46,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:46,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:46,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:46,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:46,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {30600#false} assume !(~y~0 % 4294967296 > 0); {30600#false} is VALID [2022-04-28 10:09:46,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {30600#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {30600#false} is VALID [2022-04-28 10:09:46,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {30600#false} assume !(~x~0 % 4294967296 > 0); {30600#false} is VALID [2022-04-28 10:09:46,699 INFO L272 TraceCheckUtils]: 25: Hoare triple {30600#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {30600#false} is VALID [2022-04-28 10:09:46,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {30600#false} ~cond := #in~cond; {30600#false} is VALID [2022-04-28 10:09:46,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {30600#false} assume 0 == ~cond; {30600#false} is VALID [2022-04-28 10:09:46,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {30600#false} assume !false; {30600#false} is VALID [2022-04-28 10:09:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:09:46,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:46,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501371971] [2022-04-28 10:09:46,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501371971] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:46,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596121081] [2022-04-28 10:09:46,699 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:46,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:46,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:46,701 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:46,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 10:09:46,748 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:46,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:46,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:09:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:46,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:46,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {30599#true} call ULTIMATE.init(); {30599#true} is VALID [2022-04-28 10:09:46,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {30599#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); {30599#true} is VALID [2022-04-28 10:09:46,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {30599#true} assume true; {30599#true} is VALID [2022-04-28 10:09:46,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30599#true} {30599#true} #72#return; {30599#true} is VALID [2022-04-28 10:09:46,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {30599#true} call #t~ret13 := main(); {30599#true} is VALID [2022-04-28 10:09:46,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {30599#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30604#(= main_~y~0 0)} is VALID [2022-04-28 10:09:46,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {30604#(= 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; {30605#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:46,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {30605#(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; {30606#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:46,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {30606#(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; {30607#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:46,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {30607#(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; {30608#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:46,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {30608#(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; {30609#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:46,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {30609#(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; {30610#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:46,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {30610#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {30610#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:46,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {30610#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {30611#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:46,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {30611#(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; {30659#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:46,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {30659#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {30600#false} is VALID [2022-04-28 10:09:46,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:46,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:46,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:46,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:46,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:46,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:46,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {30600#false} assume !(~y~0 % 4294967296 > 0); {30600#false} is VALID [2022-04-28 10:09:46,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {30600#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {30600#false} is VALID [2022-04-28 10:09:46,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {30600#false} assume !(~x~0 % 4294967296 > 0); {30600#false} is VALID [2022-04-28 10:09:46,957 INFO L272 TraceCheckUtils]: 25: Hoare triple {30600#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {30600#false} is VALID [2022-04-28 10:09:46,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {30600#false} ~cond := #in~cond; {30600#false} is VALID [2022-04-28 10:09:46,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {30600#false} assume 0 == ~cond; {30600#false} is VALID [2022-04-28 10:09:46,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {30600#false} assume !false; {30600#false} is VALID [2022-04-28 10:09:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:09:46,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:47,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {30600#false} assume !false; {30600#false} is VALID [2022-04-28 10:09:47,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {30600#false} assume 0 == ~cond; {30600#false} is VALID [2022-04-28 10:09:47,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {30600#false} ~cond := #in~cond; {30600#false} is VALID [2022-04-28 10:09:47,163 INFO L272 TraceCheckUtils]: 25: Hoare triple {30600#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {30600#false} is VALID [2022-04-28 10:09:47,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {30600#false} assume !(~x~0 % 4294967296 > 0); {30600#false} is VALID [2022-04-28 10:09:47,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {30600#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {30600#false} is VALID [2022-04-28 10:09:47,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {30600#false} assume !(~y~0 % 4294967296 > 0); {30600#false} is VALID [2022-04-28 10:09:47,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:47,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:47,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:47,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:47,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:47,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {30600#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30600#false} is VALID [2022-04-28 10:09:47,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {30741#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {30600#false} is VALID [2022-04-28 10:09:47,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {30745#(< 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; {30741#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:47,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {30749#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {30745#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:47,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {30749#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {30749#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:47,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {30756#(< 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; {30749#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:47,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {30760#(< 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; {30756#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:47,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {30764#(< 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; {30760#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:47,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {30768#(< 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; {30764#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:47,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {30772#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30768#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:47,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {30776#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30772#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:47,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {30599#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30776#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:47,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {30599#true} call #t~ret13 := main(); {30599#true} is VALID [2022-04-28 10:09:47,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30599#true} {30599#true} #72#return; {30599#true} is VALID [2022-04-28 10:09:47,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {30599#true} assume true; {30599#true} is VALID [2022-04-28 10:09:47,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {30599#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); {30599#true} is VALID [2022-04-28 10:09:47,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {30599#true} call ULTIMATE.init(); {30599#true} is VALID [2022-04-28 10:09:47,171 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:09:47,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596121081] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:47,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:47,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:09:47,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:47,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1616561953] [2022-04-28 10:09:47,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1616561953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:47,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:47,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:09:47,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472638168] [2022-04-28 10:09:47,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:47,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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 29 [2022-04-28 10:09:47,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:47,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-28 10:09:47,190 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-28 10:09:47,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:09:47,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:47,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:09:47,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:09:47,190 INFO L87 Difference]: Start difference. First operand 187 states and 253 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-28 10:09:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:48,465 INFO L93 Difference]: Finished difference Result 239 states and 305 transitions. [2022-04-28 10:09:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:09:48,466 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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 29 [2022-04-28 10:09:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-28 10:09:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 10:09:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-28 10:09:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 10:09:48,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-28 10:09:48,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:48,518 INFO L225 Difference]: With dead ends: 239 [2022-04-28 10:09:48,518 INFO L226 Difference]: Without dead ends: 225 [2022-04-28 10:09:48,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:09:48,519 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:48,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 68 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:09:48,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-28 10:09:49,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 187. [2022-04-28 10:09:49,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:49,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:49,047 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:49,048 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:49,050 INFO L93 Difference]: Finished difference Result 225 states and 291 transitions. [2022-04-28 10:09:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 291 transitions. [2022-04-28 10:09:49,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:49,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:49,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 3 states have call successors, (3), 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 225 states. [2022-04-28 10:09:49,050 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 3 states have call successors, (3), 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 225 states. [2022-04-28 10:09:49,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:49,054 INFO L93 Difference]: Finished difference Result 225 states and 291 transitions. [2022-04-28 10:09:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 291 transitions. [2022-04-28 10:09:49,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:49,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:49,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:49,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 252 transitions. [2022-04-28 10:09:49,057 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 252 transitions. Word has length 29 [2022-04-28 10:09:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:49,057 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 252 transitions. [2022-04-28 10:09:49,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-28 10:09:49,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 252 transitions. [2022-04-28 10:09:49,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 252 transitions. [2022-04-28 10:09:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:09:49,780 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:49,780 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:49,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:49,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 10:09:49,980 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:49,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:49,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1675631048, now seen corresponding path program 27 times [2022-04-28 10:09:49,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:49,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [713265086] [2022-04-28 10:09:49,983 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:49,983 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:49,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1675631048, now seen corresponding path program 28 times [2022-04-28 10:09:49,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:49,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365293290] [2022-04-28 10:09:49,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:49,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:50,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:50,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {32140#(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); {32119#true} is VALID [2022-04-28 10:09:50,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {32119#true} assume true; {32119#true} is VALID [2022-04-28 10:09:50,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32119#true} {32119#true} #72#return; {32119#true} is VALID [2022-04-28 10:09:50,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {32119#true} call ULTIMATE.init(); {32140#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:50,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {32140#(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); {32119#true} is VALID [2022-04-28 10:09:50,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {32119#true} assume true; {32119#true} is VALID [2022-04-28 10:09:50,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32119#true} {32119#true} #72#return; {32119#true} is VALID [2022-04-28 10:09:50,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {32119#true} call #t~ret13 := main(); {32119#true} is VALID [2022-04-28 10:09:50,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {32119#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32124#(= main_~y~0 0)} is VALID [2022-04-28 10:09:50,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {32124#(= 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; {32125#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:50,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {32125#(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; {32126#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:50,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {32126#(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; {32127#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:50,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {32127#(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; {32128#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:50,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {32128#(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; {32129#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:50,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {32129#(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; {32130#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:50,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {32130#(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; {32131#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:50,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {32131#(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; {32132#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:50,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {32132#(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; {32133#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:50,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {32133#(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; {32134#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:50,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {32134#(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; {32135#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:50,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {32135#(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; {32136#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:50,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {32136#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32137#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:50,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {32137#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:50,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {32138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {32138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:50,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {32138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {32139#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:50,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {32139#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {32120#false} is VALID [2022-04-28 10:09:50,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {32120#false} assume !(~y~0 % 4294967296 > 0); {32120#false} is VALID [2022-04-28 10:09:50,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {32120#false} assume !(~x~0 % 4294967296 > 0); {32120#false} is VALID [2022-04-28 10:09:50,285 INFO L272 TraceCheckUtils]: 25: Hoare triple {32120#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {32120#false} is VALID [2022-04-28 10:09:50,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {32120#false} ~cond := #in~cond; {32120#false} is VALID [2022-04-28 10:09:50,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {32120#false} assume 0 == ~cond; {32120#false} is VALID [2022-04-28 10:09:50,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {32120#false} assume !false; {32120#false} is VALID [2022-04-28 10:09:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:50,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:50,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365293290] [2022-04-28 10:09:50,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365293290] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:50,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162815638] [2022-04-28 10:09:50,286 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:50,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:50,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:50,289 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:50,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 10:09:50,328 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:50,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:50,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:09:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:50,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:50,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {32119#true} call ULTIMATE.init(); {32119#true} is VALID [2022-04-28 10:09:50,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {32119#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); {32119#true} is VALID [2022-04-28 10:09:50,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {32119#true} assume true; {32119#true} is VALID [2022-04-28 10:09:50,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32119#true} {32119#true} #72#return; {32119#true} is VALID [2022-04-28 10:09:50,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {32119#true} call #t~ret13 := main(); {32119#true} is VALID [2022-04-28 10:09:50,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {32119#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32124#(= main_~y~0 0)} is VALID [2022-04-28 10:09:50,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {32124#(= 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; {32125#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:50,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {32125#(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; {32126#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:50,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {32126#(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; {32127#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:50,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {32127#(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; {32128#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:50,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {32128#(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; {32129#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:50,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {32129#(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; {32130#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:50,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {32130#(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; {32131#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:50,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {32131#(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; {32132#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:50,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {32132#(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; {32133#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:50,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {32133#(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; {32134#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:50,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {32134#(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; {32135#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:50,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {32135#(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; {32136#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:50,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {32136#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32137#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:50,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {32137#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:50,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {32138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {32138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:50,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {32138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {32207#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:09:50,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {32207#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {32120#false} is VALID [2022-04-28 10:09:50,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {32120#false} assume !(~y~0 % 4294967296 > 0); {32120#false} is VALID [2022-04-28 10:09:50,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {32120#false} assume !(~x~0 % 4294967296 > 0); {32120#false} is VALID [2022-04-28 10:09:50,649 INFO L272 TraceCheckUtils]: 25: Hoare triple {32120#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {32120#false} is VALID [2022-04-28 10:09:50,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {32120#false} ~cond := #in~cond; {32120#false} is VALID [2022-04-28 10:09:50,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {32120#false} assume 0 == ~cond; {32120#false} is VALID [2022-04-28 10:09:50,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {32120#false} assume !false; {32120#false} is VALID [2022-04-28 10:09:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:50,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:51,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {32120#false} assume !false; {32120#false} is VALID [2022-04-28 10:09:51,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {32120#false} assume 0 == ~cond; {32120#false} is VALID [2022-04-28 10:09:51,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {32120#false} ~cond := #in~cond; {32120#false} is VALID [2022-04-28 10:09:51,190 INFO L272 TraceCheckUtils]: 25: Hoare triple {32120#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {32120#false} is VALID [2022-04-28 10:09:51,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {32120#false} assume !(~x~0 % 4294967296 > 0); {32120#false} is VALID [2022-04-28 10:09:51,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {32120#false} assume !(~y~0 % 4294967296 > 0); {32120#false} is VALID [2022-04-28 10:09:51,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {32247#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32120#false} is VALID [2022-04-28 10:09:51,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {32251#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {32247#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:51,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {32251#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {32251#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:51,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {32258#(< 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; {32251#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:51,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {32262#(< 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; {32258#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:51,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {32266#(< 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; {32262#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:51,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {32270#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32266#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:51,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {32274#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32270#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:51,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {32278#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32274#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:51,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {32282#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32278#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:51,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {32286#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32282#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:51,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {32290#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32286#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:51,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {32294#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32290#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:51,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {32298#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32294#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:51,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {32302#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32298#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:09:51,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {32306#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32302#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:09:51,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {32310#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32306#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:09:51,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {32119#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32310#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:09:51,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {32119#true} call #t~ret13 := main(); {32119#true} is VALID [2022-04-28 10:09:51,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32119#true} {32119#true} #72#return; {32119#true} is VALID [2022-04-28 10:09:51,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {32119#true} assume true; {32119#true} is VALID [2022-04-28 10:09:51,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {32119#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); {32119#true} is VALID [2022-04-28 10:09:51,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {32119#true} call ULTIMATE.init(); {32119#true} is VALID [2022-04-28 10:09:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:51,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162815638] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:51,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:51,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:09:51,208 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:51,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [713265086] [2022-04-28 10:09:51,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [713265086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:51,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:51,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:09:51,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108310615] [2022-04-28 10:09:51,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:51,209 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 29 [2022-04-28 10:09:51,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:51,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:09:51,228 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-28 10:09:51,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:09:51,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:51,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:09:51,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:09:51,229 INFO L87 Difference]: Start difference. First operand 187 states and 252 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:09:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:54,098 INFO L93 Difference]: Finished difference Result 300 states and 454 transitions. [2022-04-28 10:09:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:09:54,098 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 29 [2022-04-28 10:09:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:09:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 121 transitions. [2022-04-28 10:09:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:09:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 121 transitions. [2022-04-28 10:09:54,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 121 transitions. [2022-04-28 10:09:54,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:54,201 INFO L225 Difference]: With dead ends: 300 [2022-04-28 10:09:54,201 INFO L226 Difference]: Without dead ends: 280 [2022-04-28 10:09:54,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=602, Invalid=2050, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:09:54,202 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 106 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:54,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 126 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:09:54,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-28 10:09:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 200. [2022-04-28 10:09:54,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:54,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:54,748 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:54,748 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:54,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:54,751 INFO L93 Difference]: Finished difference Result 280 states and 352 transitions. [2022-04-28 10:09:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 352 transitions. [2022-04-28 10:09:54,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:54,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:54,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-28 10:09:54,752 INFO L87 Difference]: Start difference. First operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-28 10:09:54,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:54,756 INFO L93 Difference]: Finished difference Result 280 states and 352 transitions. [2022-04-28 10:09:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 352 transitions. [2022-04-28 10:09:54,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:54,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:54,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:54,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 271 transitions. [2022-04-28 10:09:54,761 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 271 transitions. Word has length 29 [2022-04-28 10:09:54,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:54,761 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 271 transitions. [2022-04-28 10:09:54,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:09:54,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 271 transitions. [2022-04-28 10:09:55,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 271 transitions. [2022-04-28 10:09:55,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:09:55,444 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:55,444 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:55,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:55,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 10:09:55,645 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:55,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:55,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1541621168, now seen corresponding path program 15 times [2022-04-28 10:09:55,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:55,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1241349544] [2022-04-28 10:09:55,653 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:55,653 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:55,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1541621168, now seen corresponding path program 16 times [2022-04-28 10:09:55,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:55,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982331135] [2022-04-28 10:09:55,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:55,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:55,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:55,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {33938#(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); {33923#true} is VALID [2022-04-28 10:09:55,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {33923#true} assume true; {33923#true} is VALID [2022-04-28 10:09:55,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33923#true} {33923#true} #72#return; {33923#true} is VALID [2022-04-28 10:09:55,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {33923#true} call ULTIMATE.init(); {33938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:55,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {33938#(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); {33923#true} is VALID [2022-04-28 10:09:55,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {33923#true} assume true; {33923#true} is VALID [2022-04-28 10:09:55,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33923#true} {33923#true} #72#return; {33923#true} is VALID [2022-04-28 10:09:55,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {33923#true} call #t~ret13 := main(); {33923#true} is VALID [2022-04-28 10:09:55,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {33923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33923#true} is VALID [2022-04-28 10:09:55,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {33923#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33928#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:55,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {33928#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33929#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:09:55,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {33929#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33930#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:55,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {33930#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33931#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:55,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {33931#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33932#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:55,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {33932#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {33932#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:55,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {33932#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {33932#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:55,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {33932#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33933#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:55,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {33933#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33934#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} is VALID [2022-04-28 10:09:55,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {33934#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33935#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:55,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {33935#(<= (+ 3 (* (div (+ main_~x~0 2) 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; {33936#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:09:55,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {33936#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:55,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:55,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:55,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:55,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:55,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:55,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:55,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:55,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {33937#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {33924#false} is VALID [2022-04-28 10:09:55,848 INFO L272 TraceCheckUtils]: 26: Hoare triple {33924#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {33924#false} is VALID [2022-04-28 10:09:55,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {33924#false} ~cond := #in~cond; {33924#false} is VALID [2022-04-28 10:09:55,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {33924#false} assume 0 == ~cond; {33924#false} is VALID [2022-04-28 10:09:55,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {33924#false} assume !false; {33924#false} is VALID [2022-04-28 10:09:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:09:55,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:55,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982331135] [2022-04-28 10:09:55,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982331135] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:55,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121293827] [2022-04-28 10:09:55,849 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:55,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:55,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:55,852 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:55,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 10:09:55,906 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:55,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:55,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 10:09:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:55,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:56,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {33923#true} call ULTIMATE.init(); {33923#true} is VALID [2022-04-28 10:09:56,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {33923#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); {33923#true} is VALID [2022-04-28 10:09:56,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {33923#true} assume true; {33923#true} is VALID [2022-04-28 10:09:56,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33923#true} {33923#true} #72#return; {33923#true} is VALID [2022-04-28 10:09:56,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {33923#true} call #t~ret13 := main(); {33923#true} is VALID [2022-04-28 10:09:56,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {33923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33923#true} is VALID [2022-04-28 10:09:56,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {33923#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33928#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:56,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {33928#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33963#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:56,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {33963#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33967#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {33967#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33971#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:56,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {33971#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33975#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {33975#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {33975#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {33975#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {33975#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {33975#(<= main_~x~0 (+ 4294967290 (* (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; {33971#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:56,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {33971#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33967#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {33967#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {33963#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:56,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {33963#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33928#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:56,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {33928#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {33924#false} is VALID [2022-04-28 10:09:56,261 INFO L272 TraceCheckUtils]: 26: Hoare triple {33924#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {33924#false} is VALID [2022-04-28 10:09:56,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {33924#false} ~cond := #in~cond; {33924#false} is VALID [2022-04-28 10:09:56,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {33924#false} assume 0 == ~cond; {33924#false} is VALID [2022-04-28 10:09:56,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {33924#false} assume !false; {33924#false} is VALID [2022-04-28 10:09:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:09:56,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:56,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {33924#false} assume !false; {33924#false} is VALID [2022-04-28 10:09:56,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {33924#false} assume 0 == ~cond; {33924#false} is VALID [2022-04-28 10:09:56,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {33924#false} ~cond := #in~cond; {33924#false} is VALID [2022-04-28 10:09:56,514 INFO L272 TraceCheckUtils]: 26: Hoare triple {33924#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {33924#false} is VALID [2022-04-28 10:09:56,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {33924#false} is VALID [2022-04-28 10:09:56,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {33928#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33997#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {33963#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33928#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:56,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {33967#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {33963#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:56,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {33971#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33967#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {33975#(<= main_~x~0 (+ 4294967290 (* (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; {33971#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:56,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {33975#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {33975#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {33975#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {33975#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {33971#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33975#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {33967#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33971#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:56,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {33963#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33967#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:56,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {33928#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33963#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:56,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {33923#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33928#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:56,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {33923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33923#true} is VALID [2022-04-28 10:09:56,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {33923#true} call #t~ret13 := main(); {33923#true} is VALID [2022-04-28 10:09:56,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33923#true} {33923#true} #72#return; {33923#true} is VALID [2022-04-28 10:09:56,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {33923#true} assume true; {33923#true} is VALID [2022-04-28 10:09:56,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {33923#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); {33923#true} is VALID [2022-04-28 10:09:56,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {33923#true} call ULTIMATE.init(); {33923#true} is VALID [2022-04-28 10:09:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:09:56,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121293827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:56,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:56,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 18 [2022-04-28 10:09:56,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:56,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1241349544] [2022-04-28 10:09:56,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1241349544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:56,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:56,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:09:56,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926792718] [2022-04-28 10:09:56,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:56,530 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 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 30 [2022-04-28 10:09:56,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:56,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:56,557 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-28 10:09:56,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:09:56,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:56,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:09:56,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:09:56,557 INFO L87 Difference]: Start difference. First operand 200 states and 271 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:58,047 INFO L93 Difference]: Finished difference Result 242 states and 334 transitions. [2022-04-28 10:09:58,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:09:58,047 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 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 30 [2022-04-28 10:09:58,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2022-04-28 10:09:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2022-04-28 10:09:58,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 73 transitions. [2022-04-28 10:09:58,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:58,125 INFO L225 Difference]: With dead ends: 242 [2022-04-28 10:09:58,125 INFO L226 Difference]: Without dead ends: 237 [2022-04-28 10:09:58,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:09:58,126 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:58,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 67 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:09:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-28 10:09:58,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 228. [2022-04-28 10:09:58,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:58,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:58,814 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:58,814 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:58,817 INFO L93 Difference]: Finished difference Result 237 states and 325 transitions. [2022-04-28 10:09:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2022-04-28 10:09:58,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:58,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:58,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 3 states have call successors, (3), 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 237 states. [2022-04-28 10:09:58,817 INFO L87 Difference]: Start difference. First operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 3 states have call successors, (3), 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 237 states. [2022-04-28 10:09:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:58,820 INFO L93 Difference]: Finished difference Result 237 states and 325 transitions. [2022-04-28 10:09:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2022-04-28 10:09:58,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:58,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:58,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:58,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 311 transitions. [2022-04-28 10:09:58,823 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 311 transitions. Word has length 30 [2022-04-28 10:09:58,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:58,823 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 311 transitions. [2022-04-28 10:09:58,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:58,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 228 states and 311 transitions. [2022-04-28 10:09:59,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 311 edges. 311 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 311 transitions. [2022-04-28 10:09:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:09:59,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:59,730 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:59,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:59,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 10:09:59,930 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:59,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash 631750017, now seen corresponding path program 29 times [2022-04-28 10:09:59,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:59,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1814074635] [2022-04-28 10:09:59,933 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:59,933 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:59,933 INFO L85 PathProgramCache]: Analyzing trace with hash 631750017, now seen corresponding path program 30 times [2022-04-28 10:09:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:59,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181372186] [2022-04-28 10:09:59,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:59,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:00,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:00,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {35579#(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); {35557#true} is VALID [2022-04-28 10:10:00,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {35557#true} assume true; {35557#true} is VALID [2022-04-28 10:10:00,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35557#true} {35557#true} #72#return; {35557#true} is VALID [2022-04-28 10:10:00,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {35557#true} call ULTIMATE.init(); {35579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:00,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {35579#(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); {35557#true} is VALID [2022-04-28 10:10:00,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {35557#true} assume true; {35557#true} is VALID [2022-04-28 10:10:00,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35557#true} {35557#true} #72#return; {35557#true} is VALID [2022-04-28 10:10:00,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {35557#true} call #t~ret13 := main(); {35557#true} is VALID [2022-04-28 10:10:00,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {35557#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35562#(= main_~y~0 0)} is VALID [2022-04-28 10:10:00,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {35562#(= 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; {35563#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:00,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {35563#(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; {35564#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:00,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {35564#(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; {35565#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:00,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {35565#(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; {35566#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:00,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {35566#(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; {35567#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:00,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {35567#(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; {35568#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:00,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {35568#(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; {35569#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:00,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {35569#(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; {35570#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:00,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {35570#(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; {35571#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:00,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {35571#(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; {35572#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:00,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {35572#(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; {35573#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:00,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {35573#(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; {35574#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:00,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {35574#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35575#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:00,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {35575#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35576#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:00,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {35576#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35577#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:00,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {35577#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {35577#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:00,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {35577#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {35578#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-28 10:10:00,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {35578#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {35558#false} is VALID [2022-04-28 10:10:00,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {35558#false} assume !(~y~0 % 4294967296 > 0); {35558#false} is VALID [2022-04-28 10:10:00,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {35558#false} assume !(~x~0 % 4294967296 > 0); {35558#false} is VALID [2022-04-28 10:10:00,254 INFO L272 TraceCheckUtils]: 26: Hoare triple {35558#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {35558#false} is VALID [2022-04-28 10:10:00,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {35558#false} ~cond := #in~cond; {35558#false} is VALID [2022-04-28 10:10:00,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {35558#false} assume 0 == ~cond; {35558#false} is VALID [2022-04-28 10:10:00,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {35558#false} assume !false; {35558#false} is VALID [2022-04-28 10:10:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:00,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:00,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181372186] [2022-04-28 10:10:00,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181372186] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:00,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135536718] [2022-04-28 10:10:00,255 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:00,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:00,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:00,256 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:00,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 10:10:00,431 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 10:10:00,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:00,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:10:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:00,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:00,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {35557#true} call ULTIMATE.init(); {35557#true} is VALID [2022-04-28 10:10:00,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {35557#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); {35557#true} is VALID [2022-04-28 10:10:00,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {35557#true} assume true; {35557#true} is VALID [2022-04-28 10:10:00,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35557#true} {35557#true} #72#return; {35557#true} is VALID [2022-04-28 10:10:00,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {35557#true} call #t~ret13 := main(); {35557#true} is VALID [2022-04-28 10:10:00,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {35557#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35562#(= main_~y~0 0)} is VALID [2022-04-28 10:10:00,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {35562#(= 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; {35563#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:00,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {35563#(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; {35564#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:00,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {35564#(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; {35565#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:00,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {35565#(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; {35566#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:00,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {35566#(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; {35567#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:00,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {35567#(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; {35568#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:00,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {35568#(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; {35569#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:00,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {35569#(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; {35570#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:00,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {35570#(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; {35571#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:00,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {35571#(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; {35572#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:00,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {35572#(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; {35573#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:00,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {35573#(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; {35574#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:00,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {35574#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35575#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:00,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {35575#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35576#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:00,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {35576#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35577#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:00,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {35577#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {35577#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:00,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {35577#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {35649#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:10:00,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {35649#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {35558#false} is VALID [2022-04-28 10:10:00,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {35558#false} assume !(~y~0 % 4294967296 > 0); {35558#false} is VALID [2022-04-28 10:10:00,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {35558#false} assume !(~x~0 % 4294967296 > 0); {35558#false} is VALID [2022-04-28 10:10:00,729 INFO L272 TraceCheckUtils]: 26: Hoare triple {35558#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {35558#false} is VALID [2022-04-28 10:10:00,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {35558#false} ~cond := #in~cond; {35558#false} is VALID [2022-04-28 10:10:00,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {35558#false} assume 0 == ~cond; {35558#false} is VALID [2022-04-28 10:10:00,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {35558#false} assume !false; {35558#false} is VALID [2022-04-28 10:10:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:00,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:01,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {35558#false} assume !false; {35558#false} is VALID [2022-04-28 10:10:01,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {35558#false} assume 0 == ~cond; {35558#false} is VALID [2022-04-28 10:10:01,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {35558#false} ~cond := #in~cond; {35558#false} is VALID [2022-04-28 10:10:01,274 INFO L272 TraceCheckUtils]: 26: Hoare triple {35558#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {35558#false} is VALID [2022-04-28 10:10:01,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {35558#false} assume !(~x~0 % 4294967296 > 0); {35558#false} is VALID [2022-04-28 10:10:01,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {35558#false} assume !(~y~0 % 4294967296 > 0); {35558#false} is VALID [2022-04-28 10:10:01,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {35689#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {35558#false} is VALID [2022-04-28 10:10:01,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {35693#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {35689#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:01,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {35693#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {35693#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:01,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {35700#(< 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; {35693#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:01,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {35704#(< 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; {35700#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:01,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {35708#(< 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; {35704#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:01,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {35712#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35708#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:01,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {35716#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35712#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:01,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {35720#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35716#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:01,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {35724#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35720#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:01,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {35728#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35724#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:01,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {35732#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35728#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:01,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {35736#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35732#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:10:01,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {35740#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35736#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:10:01,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {35744#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35740#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:10:01,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {35748#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35744#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:10:01,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {35752#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35748#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:10:01,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {35756#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35752#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:10:01,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {35557#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35756#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:10:01,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {35557#true} call #t~ret13 := main(); {35557#true} is VALID [2022-04-28 10:10:01,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35557#true} {35557#true} #72#return; {35557#true} is VALID [2022-04-28 10:10:01,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {35557#true} assume true; {35557#true} is VALID [2022-04-28 10:10:01,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {35557#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); {35557#true} is VALID [2022-04-28 10:10:01,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {35557#true} call ULTIMATE.init(); {35557#true} is VALID [2022-04-28 10:10:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:01,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135536718] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:01,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:01,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:10:01,289 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:01,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1814074635] [2022-04-28 10:10:01,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1814074635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:01,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:01,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:10:01,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372718754] [2022-04-28 10:10:01,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:01,290 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 30 [2022-04-28 10:10:01,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:01,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:10:01,314 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-28 10:10:01,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:10:01,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:01,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:10:01,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:10:01,316 INFO L87 Difference]: Start difference. First operand 228 states and 311 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:10:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:04,746 INFO L93 Difference]: Finished difference Result 366 states and 561 transitions. [2022-04-28 10:10:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:10:04,746 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 30 [2022-04-28 10:10:04,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:10:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 128 transitions. [2022-04-28 10:10:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:10:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 128 transitions. [2022-04-28 10:10:04,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 128 transitions. [2022-04-28 10:10:04,855 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-28 10:10:04,860 INFO L225 Difference]: With dead ends: 366 [2022-04-28 10:10:04,860 INFO L226 Difference]: Without dead ends: 344 [2022-04-28 10:10:04,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=673, Invalid=2297, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:10:04,861 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 114 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:04,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 134 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:10:04,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-04-28 10:10:05,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 243. [2022-04-28 10:10:05,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:05,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 344 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:05,630 INFO L74 IsIncluded]: Start isIncluded. First operand 344 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:05,630 INFO L87 Difference]: Start difference. First operand 344 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:05,636 INFO L93 Difference]: Finished difference Result 344 states and 435 transitions. [2022-04-28 10:10:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 435 transitions. [2022-04-28 10:10:05,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:05,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:05,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 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 344 states. [2022-04-28 10:10:05,637 INFO L87 Difference]: Start difference. First operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 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 344 states. [2022-04-28 10:10:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:05,641 INFO L93 Difference]: Finished difference Result 344 states and 435 transitions. [2022-04-28 10:10:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 435 transitions. [2022-04-28 10:10:05,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:05,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:05,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:05,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:05,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 333 transitions. [2022-04-28 10:10:05,645 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 333 transitions. Word has length 30 [2022-04-28 10:10:05,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:05,645 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 333 transitions. [2022-04-28 10:10:05,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:10:05,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 243 states and 333 transitions. [2022-04-28 10:10:06,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 333 transitions. [2022-04-28 10:10:06,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:10:06,715 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:06,715 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:06,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:06,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:06,915 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:06,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:06,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1818120792, now seen corresponding path program 29 times [2022-04-28 10:10:06,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:06,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1883460857] [2022-04-28 10:10:06,918 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:06,918 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:06,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1818120792, now seen corresponding path program 30 times [2022-04-28 10:10:06,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:06,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028808448] [2022-04-28 10:10:06,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:06,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:07,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:07,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {37740#(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); {37717#true} is VALID [2022-04-28 10:10:07,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {37717#true} assume true; {37717#true} is VALID [2022-04-28 10:10:07,388 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37717#true} {37717#true} #72#return; {37717#true} is VALID [2022-04-28 10:10:07,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {37717#true} call ULTIMATE.init(); {37740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:07,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {37740#(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); {37717#true} is VALID [2022-04-28 10:10:07,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {37717#true} assume true; {37717#true} is VALID [2022-04-28 10:10:07,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37717#true} {37717#true} #72#return; {37717#true} is VALID [2022-04-28 10:10:07,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {37717#true} call #t~ret13 := main(); {37717#true} is VALID [2022-04-28 10:10:07,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {37717#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37722#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:10:07,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {37722#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37723#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)))} is VALID [2022-04-28 10:10:07,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {37723#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~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; {37724#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 2)))} is VALID [2022-04-28 10:10:07,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {37724#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) 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; {37725#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} is VALID [2022-04-28 10:10:07,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {37725#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37726#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 4)) (<= (+ (* main_~x~0 2) main_~y~0 4) (* main_~n~0 2)))} is VALID [2022-04-28 10:10:07,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {37726#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 4)) (<= (+ (* main_~x~0 2) main_~y~0 4) (* main_~n~0 2)))} assume !(~x~0 % 4294967296 > 0); {37727#(and (<= (+ main_~y~0 (* 8589934592 (div main_~x~0 4294967296)) 4) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ main_~y~0 (* 8589934592 (div main_~x~0 4294967296)) 4)))} is VALID [2022-04-28 10:10:07,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {37727#(and (<= (+ main_~y~0 (* 8589934592 (div main_~x~0 4294967296)) 4) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ main_~y~0 (* 8589934592 (div main_~x~0 4294967296)) 4)))} ~z~0 := ~y~0; {37728#(and (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296)) 4) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296)) 4)))} is VALID [2022-04-28 10:10:07,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {37728#(and (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296)) 4) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296)) 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; {37729#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 10:10:07,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {37729#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) 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; {37730#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:07,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {37730#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 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; {37731#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:07,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {37731#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 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; {37732#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 10:10:07,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {37732#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} assume !(~z~0 % 4294967296 > 0); {37732#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 10:10:07,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {37732#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37731#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:07,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {37731#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37730#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:07,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {37730#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37729#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 10:10:07,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {37729#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37733#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} is VALID [2022-04-28 10:10:07,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {37733#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} assume !(~y~0 % 4294967296 > 0); {37733#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} is VALID [2022-04-28 10:10:07,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {37733#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {37734#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:07,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {37734#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {37735#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} is VALID [2022-04-28 10:10:07,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {37735#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {37736#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} is VALID [2022-04-28 10:10:07,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {37736#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {37737#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:07,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {37737#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {37737#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:07,419 INFO L272 TraceCheckUtils]: 27: Hoare triple {37737#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {37738#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:10:07,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {37738#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {37739#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:10:07,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {37739#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {37718#false} is VALID [2022-04-28 10:10:07,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {37718#false} assume !false; {37718#false} is VALID [2022-04-28 10:10:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:07,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:07,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028808448] [2022-04-28 10:10:07,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028808448] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:07,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412612862] [2022-04-28 10:10:07,420 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:07,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:07,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:07,428 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:07,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 10:10:07,587 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:10:07,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:07,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-28 10:10:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:07,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:09,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {37717#true} call ULTIMATE.init(); {37717#true} is VALID [2022-04-28 10:10:09,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {37717#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); {37717#true} is VALID [2022-04-28 10:10:09,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {37717#true} assume true; {37717#true} is VALID [2022-04-28 10:10:09,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37717#true} {37717#true} #72#return; {37717#true} is VALID [2022-04-28 10:10:09,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {37717#true} call #t~ret13 := main(); {37717#true} is VALID [2022-04-28 10:10:09,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {37717#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37722#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:10:09,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {37722#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37762#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 10:10:09,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {37762#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37766#(and (= main_~y~0 2) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:10:09,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {37766#(and (= main_~y~0 2) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37770#(and (= (+ (- 1) main_~n~0) (+ main_~x~0 2)) (< 0 (mod (+ main_~x~0 1) 4294967296)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3))} is VALID [2022-04-28 10:10:09,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {37770#(and (= (+ (- 1) main_~n~0) (+ main_~x~0 2)) (< 0 (mod (+ main_~x~0 1) 4294967296)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37774#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 3 (+ (- 1) main_~y~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:09,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {37774#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 3 (+ (- 1) main_~y~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {37774#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 3 (+ (- 1) main_~y~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:09,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {37774#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 3 (+ (- 1) main_~y~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} ~z~0 := ~y~0; {37781#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)) (= 3 (+ (- 1) main_~z~0)))} is VALID [2022-04-28 10:10:09,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {37781#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)) (= 3 (+ (- 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; {37785#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 3) (= (+ main_~n~0 (- 3)) main_~x~0) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:09,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {37785#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 3) (= (+ main_~n~0 (- 3)) main_~x~0) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37789#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 3 (+ main_~z~0 1)) (= (+ (- 2) main_~n~0) main_~x~0) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:09,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {37789#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 3 (+ main_~z~0 1)) (= (+ (- 2) main_~n~0) main_~x~0) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37793#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~x~0 (+ (- 1) main_~n~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= 3 (+ main_~z~0 2)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:09,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {37793#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~x~0 (+ (- 1) main_~n~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= 3 (+ main_~z~0 2)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37797#(and (= main_~n~0 main_~x~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)) (= 3 (+ main_~z~0 3)))} is VALID [2022-04-28 10:10:09,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {37797#(and (= main_~n~0 main_~x~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)) (= 3 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {37797#(and (= main_~n~0 main_~x~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)) (= 3 (+ main_~z~0 3)))} is VALID [2022-04-28 10:10:09,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {37797#(and (= main_~n~0 main_~x~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)) (= 3 (+ main_~z~0 3)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37804#(and (= main_~n~0 main_~x~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= 3 (+ main_~z~0 2)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:09,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {37804#(and (= main_~n~0 main_~x~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= 3 (+ main_~z~0 2)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37808#(and (= main_~n~0 main_~x~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 3 (+ main_~z~0 1)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:09,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {37808#(and (= main_~n~0 main_~x~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 3 (+ main_~z~0 1)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37812#(and (= main_~n~0 main_~x~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 3) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:09,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {37812#(and (= main_~n~0 main_~x~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 3) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37816#(and (= main_~n~0 main_~x~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 4) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:09,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {37816#(and (= main_~n~0 main_~x~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 4) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {37816#(and (= main_~n~0 main_~x~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 4) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:09,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {37816#(and (= main_~n~0 main_~x~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 4) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {37823#(and (= (+ main_~x~0 1) main_~n~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= 5 main_~z~0) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:09,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {37823#(and (= (+ main_~x~0 1) main_~n~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= 5 main_~z~0) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {37827#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)) (= 5 (+ (- 1) main_~z~0)))} is VALID [2022-04-28 10:10:09,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {37827#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)) (= 5 (+ (- 1) main_~z~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {37831#(and (= 7 main_~z~0) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:09,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {37831#(and (= 7 main_~z~0) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {37835#(and (= main_~z~0 8) (= (+ main_~x~0 3) (+ (- 1) main_~n~0)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:09,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {37835#(and (= main_~z~0 8) (= (+ main_~x~0 3) (+ (- 1) main_~n~0)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {37839#(and (= main_~z~0 8) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:10:09,240 INFO L272 TraceCheckUtils]: 27: Hoare triple {37839#(and (= main_~z~0 8) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {37843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:10:09,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {37843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:10:09,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {37847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37718#false} is VALID [2022-04-28 10:10:09,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {37718#false} assume !false; {37718#false} is VALID [2022-04-28 10:10:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:09,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:11,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {37718#false} assume !false; {37718#false} is VALID [2022-04-28 10:10:11,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {37847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37718#false} is VALID [2022-04-28 10:10:11,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {37843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:10:11,675 INFO L272 TraceCheckUtils]: 27: Hoare triple {37737#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {37843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:10:11,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {37866#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {37737#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:11,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {37870#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {37866#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:10:11,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {37874#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {37870#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-28 10:10:11,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {37878#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {37874#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:10:11,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {37882#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {37878#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} is VALID [2022-04-28 10:10:11,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {37882#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {37882#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:11,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {37889#(or (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:11,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {37893#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37889#(or (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:11,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {37897#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37893#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:11,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {37901#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37897#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:11,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {37901#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {37901#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:11,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {37908#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~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; {37901#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:11,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {37912#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ main_~x~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; {37908#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:11,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {37916#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~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; {37912#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:10:11,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {37920#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37916#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:10:11,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {37924#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} ~z~0 := ~y~0; {37920#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:11,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {37924#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} assume !(~x~0 % 4294967296 > 0); {37924#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} is VALID [2022-04-28 10:10:11,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {37931#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37924#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} is VALID [2022-04-28 10:10:11,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {37935#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6) (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37931#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))))} is VALID [2022-04-28 10:10:11,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {37939#(or (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0) (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37935#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6) (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:10:11,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {37943#(or (and (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37939#(or (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0) (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:11,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {37717#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37943#(or (and (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:11,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {37717#true} call #t~ret13 := main(); {37717#true} is VALID [2022-04-28 10:10:11,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37717#true} {37717#true} #72#return; {37717#true} is VALID [2022-04-28 10:10:11,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {37717#true} assume true; {37717#true} is VALID [2022-04-28 10:10:11,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {37717#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); {37717#true} is VALID [2022-04-28 10:10:11,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {37717#true} call ULTIMATE.init(); {37717#true} is VALID [2022-04-28 10:10:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:11,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412612862] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:11,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:11,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 23] total 59 [2022-04-28 10:10:11,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:11,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1883460857] [2022-04-28 10:10:11,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1883460857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:11,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:11,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:10:11,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737024383] [2022-04-28 10:10:11,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:11,704 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 19 states have internal predecessors, (27), 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 31 [2022-04-28 10:10:11,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:11,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 19 states have internal predecessors, (27), 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-28 10:10:11,793 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-28 10:10:11,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:10:11,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:11,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:10:11,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3174, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 10:10:11,794 INFO L87 Difference]: Start difference. First operand 243 states and 333 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 19 states have internal predecessors, (27), 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-28 10:10:14,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:14,520 INFO L93 Difference]: Finished difference Result 258 states and 348 transitions. [2022-04-28 10:10:14,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:10:14,521 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 19 states have internal predecessors, (27), 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 31 [2022-04-28 10:10:14,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 19 states have internal predecessors, (27), 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-28 10:10:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 46 transitions. [2022-04-28 10:10:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 19 states have internal predecessors, (27), 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-28 10:10:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 46 transitions. [2022-04-28 10:10:14,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 46 transitions. [2022-04-28 10:10:14,585 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-28 10:10:14,588 INFO L225 Difference]: With dead ends: 258 [2022-04-28 10:10:14,588 INFO L226 Difference]: Without dead ends: 253 [2022-04-28 10:10:14,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=414, Invalid=5748, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 10:10:14,590 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:14,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 98 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:10:14,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-28 10:10:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2022-04-28 10:10:15,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:15,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:15,382 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:15,382 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:15,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:15,386 INFO L93 Difference]: Finished difference Result 253 states and 343 transitions. [2022-04-28 10:10:15,386 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 343 transitions. [2022-04-28 10:10:15,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:15,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:15,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 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 253 states. [2022-04-28 10:10:15,387 INFO L87 Difference]: Start difference. First operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 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 253 states. [2022-04-28 10:10:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:15,391 INFO L93 Difference]: Finished difference Result 253 states and 343 transitions. [2022-04-28 10:10:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 343 transitions. [2022-04-28 10:10:15,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:15,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:15,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:15,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 333 transitions. [2022-04-28 10:10:15,396 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 333 transitions. Word has length 31 [2022-04-28 10:10:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:15,396 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 333 transitions. [2022-04-28 10:10:15,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 19 states have internal predecessors, (27), 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-28 10:10:15,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 243 states and 333 transitions. [2022-04-28 10:10:16,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 333 transitions. [2022-04-28 10:10:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:10:16,382 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:16,382 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:16,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:16,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-28 10:10:16,582 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:16,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:16,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1038157448, now seen corresponding path program 31 times [2022-04-28 10:10:16,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:16,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1282398413] [2022-04-28 10:10:16,585 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:16,585 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1038157448, now seen corresponding path program 32 times [2022-04-28 10:10:16,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:16,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928310076] [2022-04-28 10:10:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:16,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:16,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {39527#(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); {39512#true} is VALID [2022-04-28 10:10:16,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {39512#true} assume true; {39512#true} is VALID [2022-04-28 10:10:16,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39512#true} {39512#true} #72#return; {39512#true} is VALID [2022-04-28 10:10:16,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {39512#true} call ULTIMATE.init(); {39527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:16,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {39527#(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); {39512#true} is VALID [2022-04-28 10:10:16,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {39512#true} assume true; {39512#true} is VALID [2022-04-28 10:10:16,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39512#true} {39512#true} #72#return; {39512#true} is VALID [2022-04-28 10:10:16,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {39512#true} call #t~ret13 := main(); {39512#true} is VALID [2022-04-28 10:10:16,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {39512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39517#(= main_~y~0 0)} is VALID [2022-04-28 10:10:16,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {39517#(= 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; {39518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:16,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {39518#(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; {39519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:16,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {39519#(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; {39520#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:16,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {39520#(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; {39521#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:16,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {39521#(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; {39522#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:16,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {39522#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {39522#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:16,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {39522#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {39523#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:16,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {39523#(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; {39524#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:16,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {39524#(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; {39525#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:10:16,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {39525#(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; {39526#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:10:16,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {39526#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {39513#false} is VALID [2022-04-28 10:10:16,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {39513#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39513#false} is VALID [2022-04-28 10:10:16,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {39513#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39513#false} is VALID [2022-04-28 10:10:16,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {39513#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39513#false} is VALID [2022-04-28 10:10:16,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {39513#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39513#false} is VALID [2022-04-28 10:10:16,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {39513#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39513#false} is VALID [2022-04-28 10:10:16,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {39513#false} assume !(~y~0 % 4294967296 > 0); {39513#false} is VALID [2022-04-28 10:10:16,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {39513#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {39513#false} is VALID [2022-04-28 10:10:16,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {39513#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {39513#false} is VALID [2022-04-28 10:10:16,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {39513#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {39513#false} is VALID [2022-04-28 10:10:16,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {39513#false} assume !(~x~0 % 4294967296 > 0); {39513#false} is VALID [2022-04-28 10:10:16,776 INFO L272 TraceCheckUtils]: 27: Hoare triple {39513#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {39513#false} is VALID [2022-04-28 10:10:16,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {39513#false} ~cond := #in~cond; {39513#false} is VALID [2022-04-28 10:10:16,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {39513#false} assume 0 == ~cond; {39513#false} is VALID [2022-04-28 10:10:16,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {39513#false} assume !false; {39513#false} is VALID [2022-04-28 10:10:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:10:16,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:16,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928310076] [2022-04-28 10:10:16,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928310076] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:16,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173197766] [2022-04-28 10:10:16,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:16,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:16,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:16,780 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:16,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 10:10:16,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:16,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:16,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 10:10:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:16,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:17,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {39512#true} call ULTIMATE.init(); {39512#true} is VALID [2022-04-28 10:10:17,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {39512#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); {39512#true} is VALID [2022-04-28 10:10:17,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {39512#true} assume true; {39512#true} is VALID [2022-04-28 10:10:17,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39512#true} {39512#true} #72#return; {39512#true} is VALID [2022-04-28 10:10:17,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {39512#true} call #t~ret13 := main(); {39512#true} is VALID [2022-04-28 10:10:17,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {39512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39517#(= main_~y~0 0)} is VALID [2022-04-28 10:10:17,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {39517#(= 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; {39518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:17,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {39518#(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; {39519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:17,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {39519#(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; {39520#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:17,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {39520#(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; {39521#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:17,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {39521#(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; {39522#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:17,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {39522#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {39522#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:17,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {39522#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {39567#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:17,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {39567#(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; {39571#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:10:17,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {39571#(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; {39575#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:17,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {39575#(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; {39579#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:17,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {39579#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {39513#false} is VALID [2022-04-28 10:10:17,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {39513#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39513#false} is VALID [2022-04-28 10:10:17,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {39513#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39513#false} is VALID [2022-04-28 10:10:17,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {39513#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39513#false} is VALID [2022-04-28 10:10:17,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {39513#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39513#false} is VALID [2022-04-28 10:10:17,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {39513#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39513#false} is VALID [2022-04-28 10:10:17,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {39513#false} assume !(~y~0 % 4294967296 > 0); {39513#false} is VALID [2022-04-28 10:10:17,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {39513#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {39513#false} is VALID [2022-04-28 10:10:17,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {39513#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {39513#false} is VALID [2022-04-28 10:10:17,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {39513#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {39513#false} is VALID [2022-04-28 10:10:17,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {39513#false} assume !(~x~0 % 4294967296 > 0); {39513#false} is VALID [2022-04-28 10:10:17,045 INFO L272 TraceCheckUtils]: 27: Hoare triple {39513#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {39513#false} is VALID [2022-04-28 10:10:17,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {39513#false} ~cond := #in~cond; {39513#false} is VALID [2022-04-28 10:10:17,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {39513#false} assume 0 == ~cond; {39513#false} is VALID [2022-04-28 10:10:17,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {39513#false} assume !false; {39513#false} is VALID [2022-04-28 10:10:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:10:17,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:17,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {39513#false} assume !false; {39513#false} is VALID [2022-04-28 10:10:17,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {39513#false} assume 0 == ~cond; {39513#false} is VALID [2022-04-28 10:10:17,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {39513#false} ~cond := #in~cond; {39513#false} is VALID [2022-04-28 10:10:17,291 INFO L272 TraceCheckUtils]: 27: Hoare triple {39513#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {39513#false} is VALID [2022-04-28 10:10:17,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {39513#false} assume !(~x~0 % 4294967296 > 0); {39513#false} is VALID [2022-04-28 10:10:17,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {39513#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {39513#false} is VALID [2022-04-28 10:10:17,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {39513#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {39513#false} is VALID [2022-04-28 10:10:17,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {39513#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {39513#false} is VALID [2022-04-28 10:10:17,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {39513#false} assume !(~y~0 % 4294967296 > 0); {39513#false} is VALID [2022-04-28 10:10:17,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {39513#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39513#false} is VALID [2022-04-28 10:10:17,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {39655#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39513#false} is VALID [2022-04-28 10:10:17,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {39659#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39655#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:10:17,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {39663#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39659#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:10:17,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {39667#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39663#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:10:17,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {39671#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {39667#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:17,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {39675#(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; {39671#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:10:17,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {39679#(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; {39675#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:10:17,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {39683#(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; {39679#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:10:17,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {39512#true} ~z~0 := ~y~0; {39683#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:17,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {39512#true} assume !(~x~0 % 4294967296 > 0); {39512#true} is VALID [2022-04-28 10:10:17,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {39512#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39512#true} is VALID [2022-04-28 10:10:17,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {39512#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39512#true} is VALID [2022-04-28 10:10:17,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {39512#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39512#true} is VALID [2022-04-28 10:10:17,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {39512#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39512#true} is VALID [2022-04-28 10:10:17,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {39512#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39512#true} is VALID [2022-04-28 10:10:17,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {39512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39512#true} is VALID [2022-04-28 10:10:17,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {39512#true} call #t~ret13 := main(); {39512#true} is VALID [2022-04-28 10:10:17,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39512#true} {39512#true} #72#return; {39512#true} is VALID [2022-04-28 10:10:17,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {39512#true} assume true; {39512#true} is VALID [2022-04-28 10:10:17,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {39512#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); {39512#true} is VALID [2022-04-28 10:10:17,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {39512#true} call ULTIMATE.init(); {39512#true} is VALID [2022-04-28 10:10:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:10:17,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173197766] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:17,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:17,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 25 [2022-04-28 10:10:17,299 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:17,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1282398413] [2022-04-28 10:10:17,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1282398413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:17,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:17,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:10:17,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719364856] [2022-04-28 10:10:17,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:17,300 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 31 [2022-04-28 10:10:17,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:17,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:10:17,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:17,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:10:17,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:17,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:10:17,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:10:17,319 INFO L87 Difference]: Start difference. First operand 243 states and 333 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:10:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:18,781 INFO L93 Difference]: Finished difference Result 283 states and 373 transitions. [2022-04-28 10:10:18,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:10:18,781 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 31 [2022-04-28 10:10:18,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:10:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-04-28 10:10:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:10:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-04-28 10:10:18,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 58 transitions. [2022-04-28 10:10:18,827 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-28 10:10:18,830 INFO L225 Difference]: With dead ends: 283 [2022-04-28 10:10:18,830 INFO L226 Difference]: Without dead ends: 268 [2022-04-28 10:10:18,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=1197, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:10:18,831 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:18,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 53 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:10:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-28 10:10:19,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 243. [2022-04-28 10:10:19,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:19,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 268 states. Second operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:19,593 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:19,594 INFO L87 Difference]: Start difference. First operand 268 states. Second operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:19,598 INFO L93 Difference]: Finished difference Result 268 states and 358 transitions. [2022-04-28 10:10:19,598 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 358 transitions. [2022-04-28 10:10:19,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:19,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:19,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 3 states have call successors, (3), 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 268 states. [2022-04-28 10:10:19,599 INFO L87 Difference]: Start difference. First operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 3 states have call successors, (3), 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 268 states. [2022-04-28 10:10:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:19,601 INFO L93 Difference]: Finished difference Result 268 states and 358 transitions. [2022-04-28 10:10:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 358 transitions. [2022-04-28 10:10:19,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:19,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:19,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:19,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 332 transitions. [2022-04-28 10:10:19,606 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 332 transitions. Word has length 31 [2022-04-28 10:10:19,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:19,606 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 332 transitions. [2022-04-28 10:10:19,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:10:19,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 243 states and 332 transitions. [2022-04-28 10:10:20,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 332 edges. 332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 332 transitions. [2022-04-28 10:10:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:10:20,633 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:20,633 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:20,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:20,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-28 10:10:20,834 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:20,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:20,834 INFO L85 PathProgramCache]: Analyzing trace with hash -281941914, now seen corresponding path program 17 times [2022-04-28 10:10:20,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:20,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1494710691] [2022-04-28 10:10:20,836 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:20,836 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:20,836 INFO L85 PathProgramCache]: Analyzing trace with hash -281941914, now seen corresponding path program 18 times [2022-04-28 10:10:20,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:20,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723231192] [2022-04-28 10:10:20,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:20,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:21,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:21,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {41356#(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); {41339#true} is VALID [2022-04-28 10:10:21,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {41339#true} assume true; {41339#true} is VALID [2022-04-28 10:10:21,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41339#true} {41339#true} #72#return; {41339#true} is VALID [2022-04-28 10:10:21,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {41339#true} call ULTIMATE.init(); {41356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:21,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {41356#(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); {41339#true} is VALID [2022-04-28 10:10:21,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {41339#true} assume true; {41339#true} is VALID [2022-04-28 10:10:21,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41339#true} {41339#true} #72#return; {41339#true} is VALID [2022-04-28 10:10:21,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {41339#true} call #t~ret13 := main(); {41339#true} is VALID [2022-04-28 10:10:21,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {41339#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41344#(= main_~y~0 0)} is VALID [2022-04-28 10:10:21,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {41344#(= 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; {41345#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:21,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {41345#(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; {41346#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:21,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {41346#(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; {41347#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:21,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {41347#(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; {41348#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:21,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {41348#(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; {41349#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:21,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {41349#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {41349#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:21,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {41349#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {41350#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:21,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {41350#(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; {41351#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:21,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {41351#(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; {41352#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:10:21,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {41352#(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; {41353#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:10:21,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {41353#(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; {41354#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:10:21,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {41354#(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; {41355#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:10:21,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {41355#(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; {41340#false} is VALID [2022-04-28 10:10:21,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {41340#false} assume !(~z~0 % 4294967296 > 0); {41340#false} is VALID [2022-04-28 10:10:21,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {41340#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41340#false} is VALID [2022-04-28 10:10:21,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {41340#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41340#false} is VALID [2022-04-28 10:10:21,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {41340#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41340#false} is VALID [2022-04-28 10:10:21,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {41340#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41340#false} is VALID [2022-04-28 10:10:21,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {41340#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41340#false} is VALID [2022-04-28 10:10:21,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {41340#false} assume !(~y~0 % 4294967296 > 0); {41340#false} is VALID [2022-04-28 10:10:21,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {41340#false} assume !(~x~0 % 4294967296 > 0); {41340#false} is VALID [2022-04-28 10:10:21,032 INFO L272 TraceCheckUtils]: 27: Hoare triple {41340#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {41340#false} is VALID [2022-04-28 10:10:21,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {41340#false} ~cond := #in~cond; {41340#false} is VALID [2022-04-28 10:10:21,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {41340#false} assume 0 == ~cond; {41340#false} is VALID [2022-04-28 10:10:21,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {41340#false} assume !false; {41340#false} is VALID [2022-04-28 10:10:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:10:21,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:21,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723231192] [2022-04-28 10:10:21,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723231192] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:21,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066370428] [2022-04-28 10:10:21,033 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:21,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:21,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:21,034 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:21,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 10:10:21,118 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:10:21,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:21,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 10:10:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:21,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:21,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {41339#true} call ULTIMATE.init(); {41339#true} is VALID [2022-04-28 10:10:21,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {41339#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); {41339#true} is VALID [2022-04-28 10:10:21,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {41339#true} assume true; {41339#true} is VALID [2022-04-28 10:10:21,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41339#true} {41339#true} #72#return; {41339#true} is VALID [2022-04-28 10:10:21,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {41339#true} call #t~ret13 := main(); {41339#true} is VALID [2022-04-28 10:10:21,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {41339#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41344#(= main_~y~0 0)} is VALID [2022-04-28 10:10:21,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {41344#(= 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; {41345#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:21,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {41345#(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; {41346#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:21,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {41346#(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; {41347#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:21,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {41347#(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; {41348#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:21,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {41348#(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; {41349#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:21,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {41349#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {41349#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:21,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {41349#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {41396#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:21,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {41396#(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; {41400#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:10:21,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {41400#(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; {41404#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:21,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {41404#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41408#(and (<= 5 main_~y~0) (= main_~y~0 (+ main_~z~0 3)) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:21,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {41408#(and (<= 5 main_~y~0) (= main_~y~0 (+ main_~z~0 3)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41412#(and (<= 5 main_~y~0) (= main_~y~0 (+ main_~z~0 4)) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:21,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {41412#(and (<= 5 main_~y~0) (= main_~y~0 (+ main_~z~0 4)) (<= 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; {41416#(and (= (+ 5 main_~z~0) main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:21,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {41416#(and (= (+ 5 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; {41340#false} is VALID [2022-04-28 10:10:21,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {41340#false} assume !(~z~0 % 4294967296 > 0); {41340#false} is VALID [2022-04-28 10:10:21,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {41340#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41340#false} is VALID [2022-04-28 10:10:21,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {41340#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41340#false} is VALID [2022-04-28 10:10:21,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {41340#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41340#false} is VALID [2022-04-28 10:10:21,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {41340#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41340#false} is VALID [2022-04-28 10:10:21,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {41340#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41340#false} is VALID [2022-04-28 10:10:21,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {41340#false} assume !(~y~0 % 4294967296 > 0); {41340#false} is VALID [2022-04-28 10:10:21,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {41340#false} assume !(~x~0 % 4294967296 > 0); {41340#false} is VALID [2022-04-28 10:10:21,391 INFO L272 TraceCheckUtils]: 27: Hoare triple {41340#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {41340#false} is VALID [2022-04-28 10:10:21,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {41340#false} ~cond := #in~cond; {41340#false} is VALID [2022-04-28 10:10:21,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {41340#false} assume 0 == ~cond; {41340#false} is VALID [2022-04-28 10:10:21,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {41340#false} assume !false; {41340#false} is VALID [2022-04-28 10:10:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:10:21,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:21,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {41340#false} assume !false; {41340#false} is VALID [2022-04-28 10:10:21,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {41340#false} assume 0 == ~cond; {41340#false} is VALID [2022-04-28 10:10:21,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {41340#false} ~cond := #in~cond; {41340#false} is VALID [2022-04-28 10:10:21,756 INFO L272 TraceCheckUtils]: 27: Hoare triple {41340#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {41340#false} is VALID [2022-04-28 10:10:21,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {41340#false} assume !(~x~0 % 4294967296 > 0); {41340#false} is VALID [2022-04-28 10:10:21,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {41471#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {41340#false} is VALID [2022-04-28 10:10:21,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {41475#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41471#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:21,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {41479#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41475#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:21,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {41483#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41479#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:21,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {41487#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41483#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:21,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {41491#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41487#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:21,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {41491#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {41491#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:21,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {41498#(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; {41491#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:21,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {41502#(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; {41498#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:10:21,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {41506#(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; {41502#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:10:21,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {41510#(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; {41506#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:10:21,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {41514#(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; {41510#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:10:21,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {41518#(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; {41514#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:10:21,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {41339#true} ~z~0 := ~y~0; {41518#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:10:21,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {41339#true} assume !(~x~0 % 4294967296 > 0); {41339#true} is VALID [2022-04-28 10:10:21,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {41339#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41339#true} is VALID [2022-04-28 10:10:21,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {41339#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41339#true} is VALID [2022-04-28 10:10:21,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {41339#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41339#true} is VALID [2022-04-28 10:10:21,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {41339#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41339#true} is VALID [2022-04-28 10:10:21,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {41339#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41339#true} is VALID [2022-04-28 10:10:21,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {41339#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41339#true} is VALID [2022-04-28 10:10:21,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {41339#true} call #t~ret13 := main(); {41339#true} is VALID [2022-04-28 10:10:21,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41339#true} {41339#true} #72#return; {41339#true} is VALID [2022-04-28 10:10:21,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {41339#true} assume true; {41339#true} is VALID [2022-04-28 10:10:21,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {41339#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); {41339#true} is VALID [2022-04-28 10:10:21,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {41339#true} call ULTIMATE.init(); {41339#true} is VALID [2022-04-28 10:10:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:10:21,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066370428] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:21,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:21,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 33 [2022-04-28 10:10:21,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:21,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1494710691] [2022-04-28 10:10:21,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1494710691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:21,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:21,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:10:21,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793196579] [2022-04-28 10:10:21,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:21,769 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 31 [2022-04-28 10:10:21,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:21,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:10:21,788 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-28 10:10:21,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:10:21,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:21,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:10:21,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:10:21,788 INFO L87 Difference]: Start difference. First operand 243 states and 332 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:10:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:23,872 INFO L93 Difference]: Finished difference Result 285 states and 375 transitions. [2022-04-28 10:10:23,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:10:23,872 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 31 [2022-04-28 10:10:23,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:10:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 68 transitions. [2022-04-28 10:10:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:10:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 68 transitions. [2022-04-28 10:10:23,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 68 transitions. [2022-04-28 10:10:23,928 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-28 10:10:23,931 INFO L225 Difference]: With dead ends: 285 [2022-04-28 10:10:23,931 INFO L226 Difference]: Without dead ends: 262 [2022-04-28 10:10:23,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=566, Invalid=2740, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:10:23,932 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:23,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 77 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:10:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-28 10:10:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 242. [2022-04-28 10:10:24,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:24,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:24,712 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:24,712 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:24,715 INFO L93 Difference]: Finished difference Result 262 states and 349 transitions. [2022-04-28 10:10:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 349 transitions. [2022-04-28 10:10:24,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:24,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:24,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-28 10:10:24,715 INFO L87 Difference]: Start difference. First operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-28 10:10:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:24,718 INFO L93 Difference]: Finished difference Result 262 states and 349 transitions. [2022-04-28 10:10:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 349 transitions. [2022-04-28 10:10:24,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:24,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:24,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:24,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:24,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:24,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 328 transitions. [2022-04-28 10:10:24,722 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 328 transitions. Word has length 31 [2022-04-28 10:10:24,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:24,722 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 328 transitions. [2022-04-28 10:10:24,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:10:24,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 328 transitions. [2022-04-28 10:10:25,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 328 edges. 328 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 328 transitions. [2022-04-28 10:10:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:10:25,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:25,700 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:25,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:25,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-28 10:10:25,901 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:25,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:25,901 INFO L85 PathProgramCache]: Analyzing trace with hash 874450008, now seen corresponding path program 33 times [2022-04-28 10:10:25,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:25,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [32854638] [2022-04-28 10:10:25,904 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:25,904 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:25,904 INFO L85 PathProgramCache]: Analyzing trace with hash 874450008, now seen corresponding path program 34 times [2022-04-28 10:10:25,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:25,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975718553] [2022-04-28 10:10:25,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:25,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:26,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {43203#(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); {43188#true} is VALID [2022-04-28 10:10:26,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {43188#true} assume true; {43188#true} is VALID [2022-04-28 10:10:26,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43188#true} {43188#true} #72#return; {43188#true} is VALID [2022-04-28 10:10:26,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {43188#true} call ULTIMATE.init(); {43203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:26,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {43203#(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); {43188#true} is VALID [2022-04-28 10:10:26,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {43188#true} assume true; {43188#true} is VALID [2022-04-28 10:10:26,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43188#true} {43188#true} #72#return; {43188#true} is VALID [2022-04-28 10:10:26,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {43188#true} call #t~ret13 := main(); {43188#true} is VALID [2022-04-28 10:10:26,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {43188#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43193#(= main_~y~0 0)} is VALID [2022-04-28 10:10:26,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {43193#(= 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; {43194#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:26,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {43194#(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; {43195#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:26,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {43195#(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; {43196#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:26,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {43196#(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; {43197#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:26,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {43197#(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; {43198#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:26,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {43198#(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; {43199#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:26,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {43199#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {43199#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:26,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {43199#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {43200#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:26,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {43200#(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; {43201#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:26,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {43201#(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; {43202#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:26,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {43202#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {43189#false} is VALID [2022-04-28 10:10:26,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {43189#false} assume !(~y~0 % 4294967296 > 0); {43189#false} is VALID [2022-04-28 10:10:26,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {43189#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {43189#false} is VALID [2022-04-28 10:10:26,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {43189#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {43189#false} is VALID [2022-04-28 10:10:26,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {43189#false} assume !(~x~0 % 4294967296 > 0); {43189#false} is VALID [2022-04-28 10:10:26,093 INFO L272 TraceCheckUtils]: 27: Hoare triple {43189#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {43189#false} is VALID [2022-04-28 10:10:26,093 INFO L290 TraceCheckUtils]: 28: Hoare triple {43189#false} ~cond := #in~cond; {43189#false} is VALID [2022-04-28 10:10:26,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {43189#false} assume 0 == ~cond; {43189#false} is VALID [2022-04-28 10:10:26,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {43189#false} assume !false; {43189#false} is VALID [2022-04-28 10:10:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 10:10:26,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:26,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975718553] [2022-04-28 10:10:26,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975718553] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:26,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673550420] [2022-04-28 10:10:26,094 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:26,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:26,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:26,095 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:26,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 10:10:26,140 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:26,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:26,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:10:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:26,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:26,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {43188#true} call ULTIMATE.init(); {43188#true} is VALID [2022-04-28 10:10:26,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {43188#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); {43188#true} is VALID [2022-04-28 10:10:26,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {43188#true} assume true; {43188#true} is VALID [2022-04-28 10:10:26,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43188#true} {43188#true} #72#return; {43188#true} is VALID [2022-04-28 10:10:26,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {43188#true} call #t~ret13 := main(); {43188#true} is VALID [2022-04-28 10:10:26,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {43188#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43193#(= main_~y~0 0)} is VALID [2022-04-28 10:10:26,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {43193#(= 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; {43194#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:26,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {43194#(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; {43195#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:26,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {43195#(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; {43196#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:26,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {43196#(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; {43197#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:26,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {43197#(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; {43198#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:26,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {43198#(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; {43199#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:26,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {43199#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {43199#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:26,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {43199#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {43200#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:26,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {43200#(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; {43201#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:26,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {43201#(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; {43252#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:26,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {43252#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {43189#false} is VALID [2022-04-28 10:10:26,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {43189#false} assume !(~y~0 % 4294967296 > 0); {43189#false} is VALID [2022-04-28 10:10:26,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {43189#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {43189#false} is VALID [2022-04-28 10:10:26,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {43189#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {43189#false} is VALID [2022-04-28 10:10:26,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {43189#false} assume !(~x~0 % 4294967296 > 0); {43189#false} is VALID [2022-04-28 10:10:26,402 INFO L272 TraceCheckUtils]: 27: Hoare triple {43189#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {43189#false} is VALID [2022-04-28 10:10:26,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {43189#false} ~cond := #in~cond; {43189#false} is VALID [2022-04-28 10:10:26,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {43189#false} assume 0 == ~cond; {43189#false} is VALID [2022-04-28 10:10:26,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {43189#false} assume !false; {43189#false} is VALID [2022-04-28 10:10:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 10:10:26,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:26,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {43189#false} assume !false; {43189#false} is VALID [2022-04-28 10:10:26,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {43189#false} assume 0 == ~cond; {43189#false} is VALID [2022-04-28 10:10:26,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {43189#false} ~cond := #in~cond; {43189#false} is VALID [2022-04-28 10:10:26,649 INFO L272 TraceCheckUtils]: 27: Hoare triple {43189#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {43189#false} is VALID [2022-04-28 10:10:26,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {43189#false} assume !(~x~0 % 4294967296 > 0); {43189#false} is VALID [2022-04-28 10:10:26,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {43189#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {43189#false} is VALID [2022-04-28 10:10:26,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {43189#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {43189#false} is VALID [2022-04-28 10:10:26,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {43189#false} assume !(~y~0 % 4294967296 > 0); {43189#false} is VALID [2022-04-28 10:10:26,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {43189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43189#false} is VALID [2022-04-28 10:10:26,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {43340#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {43189#false} is VALID [2022-04-28 10:10:26,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {43344#(< 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; {43340#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:26,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {43348#(< 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; {43344#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:26,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {43352#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {43348#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:26,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {43352#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {43352#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:26,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {43359#(< 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; {43352#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:26,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {43363#(< 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; {43359#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:26,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {43367#(< 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; {43363#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:26,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {43371#(< 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; {43367#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:26,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {43375#(< 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; {43371#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:26,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {43379#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43375#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:26,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {43188#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43379#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:26,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {43188#true} call #t~ret13 := main(); {43188#true} is VALID [2022-04-28 10:10:26,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43188#true} {43188#true} #72#return; {43188#true} is VALID [2022-04-28 10:10:26,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {43188#true} assume true; {43188#true} is VALID [2022-04-28 10:10:26,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {43188#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); {43188#true} is VALID [2022-04-28 10:10:26,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {43188#true} call ULTIMATE.init(); {43188#true} is VALID [2022-04-28 10:10:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 10:10:26,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673550420] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:26,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:26,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:10:26,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:26,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [32854638] [2022-04-28 10:10:26,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [32854638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:26,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:26,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:10:26,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590707576] [2022-04-28 10:10:26,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:26,658 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 31 [2022-04-28 10:10:26,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:26,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:10:26,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:26,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:10:26,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:26,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:10:26,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:10:26,675 INFO L87 Difference]: Start difference. First operand 242 states and 328 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:10:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:28,405 INFO L93 Difference]: Finished difference Result 296 states and 382 transitions. [2022-04-28 10:10:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:10:28,406 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 31 [2022-04-28 10:10:28,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:10:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2022-04-28 10:10:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:10:28,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2022-04-28 10:10:28,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 63 transitions. [2022-04-28 10:10:28,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:28,460 INFO L225 Difference]: With dead ends: 296 [2022-04-28 10:10:28,460 INFO L226 Difference]: Without dead ends: 281 [2022-04-28 10:10:28,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:10:28,461 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:28,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 72 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:10:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-28 10:10:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 242. [2022-04-28 10:10:29,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:29,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:29,277 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:29,277 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:29,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:29,280 INFO L93 Difference]: Finished difference Result 281 states and 367 transitions. [2022-04-28 10:10:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 367 transitions. [2022-04-28 10:10:29,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:29,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:29,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 3 states have call successors, (3), 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 281 states. [2022-04-28 10:10:29,280 INFO L87 Difference]: Start difference. First operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 3 states have call successors, (3), 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 281 states. [2022-04-28 10:10:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:29,283 INFO L93 Difference]: Finished difference Result 281 states and 367 transitions. [2022-04-28 10:10:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 367 transitions. [2022-04-28 10:10:29,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:29,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:29,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:29,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 327 transitions. [2022-04-28 10:10:29,287 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 327 transitions. Word has length 31 [2022-04-28 10:10:29,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:29,288 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 327 transitions. [2022-04-28 10:10:29,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:10:29,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 327 transitions. [2022-04-28 10:10:30,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 327 edges. 327 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 327 transitions. [2022-04-28 10:10:30,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:10:30,352 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:30,352 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:30,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:30,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:30,555 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:30,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:30,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2116095112, now seen corresponding path program 35 times [2022-04-28 10:10:30,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:30,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1600946317] [2022-04-28 10:10:30,560 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:30,560 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:30,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2116095112, now seen corresponding path program 36 times [2022-04-28 10:10:30,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:30,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355966111] [2022-04-28 10:10:30,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:30,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:30,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:30,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {45079#(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); {45064#true} is VALID [2022-04-28 10:10:30,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {45064#true} assume true; {45064#true} is VALID [2022-04-28 10:10:30,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45064#true} {45064#true} #72#return; {45064#true} is VALID [2022-04-28 10:10:30,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {45064#true} call ULTIMATE.init(); {45079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:30,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {45079#(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); {45064#true} is VALID [2022-04-28 10:10:30,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {45064#true} assume true; {45064#true} is VALID [2022-04-28 10:10:30,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45064#true} {45064#true} #72#return; {45064#true} is VALID [2022-04-28 10:10:30,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {45064#true} call #t~ret13 := main(); {45064#true} is VALID [2022-04-28 10:10:30,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {45064#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45069#(= main_~y~0 0)} is VALID [2022-04-28 10:10:30,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {45069#(= 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; {45070#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:30,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {45070#(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; {45071#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:30,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {45071#(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; {45072#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:30,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {45072#(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; {45073#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:30,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {45073#(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; {45074#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:30,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {45074#(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; {45075#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:30,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {45075#(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; {45076#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:30,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {45076#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {45076#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:30,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {45076#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {45077#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:30,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {45077#(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; {45078#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:30,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {45078#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {45065#false} is VALID [2022-04-28 10:10:30,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:30,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:30,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:30,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:30,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:30,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:30,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:30,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {45065#false} assume !(~y~0 % 4294967296 > 0); {45065#false} is VALID [2022-04-28 10:10:30,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {45065#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {45065#false} is VALID [2022-04-28 10:10:30,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {45065#false} assume !(~x~0 % 4294967296 > 0); {45065#false} is VALID [2022-04-28 10:10:30,746 INFO L272 TraceCheckUtils]: 27: Hoare triple {45065#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {45065#false} is VALID [2022-04-28 10:10:30,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {45065#false} ~cond := #in~cond; {45065#false} is VALID [2022-04-28 10:10:30,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {45065#false} assume 0 == ~cond; {45065#false} is VALID [2022-04-28 10:10:30,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {45065#false} assume !false; {45065#false} is VALID [2022-04-28 10:10:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:10:30,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:30,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355966111] [2022-04-28 10:10:30,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355966111] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:30,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112824101] [2022-04-28 10:10:30,747 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:30,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:30,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:30,752 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:30,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 10:10:30,874 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:10:30,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:30,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:10:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:30,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:31,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {45064#true} call ULTIMATE.init(); {45064#true} is VALID [2022-04-28 10:10:31,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {45064#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); {45064#true} is VALID [2022-04-28 10:10:31,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {45064#true} assume true; {45064#true} is VALID [2022-04-28 10:10:31,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45064#true} {45064#true} #72#return; {45064#true} is VALID [2022-04-28 10:10:31,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {45064#true} call #t~ret13 := main(); {45064#true} is VALID [2022-04-28 10:10:31,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {45064#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45069#(= main_~y~0 0)} is VALID [2022-04-28 10:10:31,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {45069#(= 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; {45070#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:31,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {45070#(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; {45071#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:31,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {45071#(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; {45072#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:31,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {45072#(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; {45073#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:31,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {45073#(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; {45074#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:31,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {45074#(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; {45075#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:31,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {45075#(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; {45076#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:31,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {45076#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {45076#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:31,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {45076#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {45077#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:31,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {45077#(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; {45128#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:31,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {45128#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {45065#false} is VALID [2022-04-28 10:10:31,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:31,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:31,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:31,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:31,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:31,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:31,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:31,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {45065#false} assume !(~y~0 % 4294967296 > 0); {45065#false} is VALID [2022-04-28 10:10:31,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {45065#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {45065#false} is VALID [2022-04-28 10:10:31,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {45065#false} assume !(~x~0 % 4294967296 > 0); {45065#false} is VALID [2022-04-28 10:10:31,144 INFO L272 TraceCheckUtils]: 27: Hoare triple {45065#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {45065#false} is VALID [2022-04-28 10:10:31,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {45065#false} ~cond := #in~cond; {45065#false} is VALID [2022-04-28 10:10:31,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {45065#false} assume 0 == ~cond; {45065#false} is VALID [2022-04-28 10:10:31,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {45065#false} assume !false; {45065#false} is VALID [2022-04-28 10:10:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:10:31,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:31,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {45065#false} assume !false; {45065#false} is VALID [2022-04-28 10:10:31,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {45065#false} assume 0 == ~cond; {45065#false} is VALID [2022-04-28 10:10:31,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {45065#false} ~cond := #in~cond; {45065#false} is VALID [2022-04-28 10:10:31,450 INFO L272 TraceCheckUtils]: 27: Hoare triple {45065#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {45065#false} is VALID [2022-04-28 10:10:31,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {45065#false} assume !(~x~0 % 4294967296 > 0); {45065#false} is VALID [2022-04-28 10:10:31,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {45065#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {45065#false} is VALID [2022-04-28 10:10:31,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {45065#false} assume !(~y~0 % 4294967296 > 0); {45065#false} is VALID [2022-04-28 10:10:31,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:31,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:31,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:31,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:31,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:31,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:31,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {45065#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45065#false} is VALID [2022-04-28 10:10:31,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {45216#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {45065#false} is VALID [2022-04-28 10:10:31,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {45220#(< 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; {45216#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:31,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {45224#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {45220#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:31,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {45224#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {45224#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:31,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {45231#(< 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; {45224#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:31,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {45235#(< 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; {45231#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:31,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {45239#(< 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; {45235#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:31,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {45243#(< 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; {45239#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:31,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {45247#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45243#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:31,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {45251#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45247#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:31,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {45255#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45251#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:31,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {45064#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45255#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:31,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {45064#true} call #t~ret13 := main(); {45064#true} is VALID [2022-04-28 10:10:31,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45064#true} {45064#true} #72#return; {45064#true} is VALID [2022-04-28 10:10:31,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {45064#true} assume true; {45064#true} is VALID [2022-04-28 10:10:31,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {45064#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); {45064#true} is VALID [2022-04-28 10:10:31,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {45064#true} call ULTIMATE.init(); {45064#true} is VALID [2022-04-28 10:10:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:10:31,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112824101] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:31,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:31,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:10:31,462 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:31,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1600946317] [2022-04-28 10:10:31,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1600946317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:31,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:31,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:10:31,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146518329] [2022-04-28 10:10:31,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:31,463 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 31 [2022-04-28 10:10:31,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:31,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:10:31,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:31,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:10:31,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:31,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:10:31,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:10:31,481 INFO L87 Difference]: Start difference. First operand 242 states and 327 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:10:33,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:33,243 INFO L93 Difference]: Finished difference Result 308 states and 393 transitions. [2022-04-28 10:10:33,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:10:33,243 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 31 [2022-04-28 10:10:33,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:33,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:10:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-28 10:10:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:10:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-28 10:10:33,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 66 transitions. [2022-04-28 10:10:33,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:33,299 INFO L225 Difference]: With dead ends: 308 [2022-04-28 10:10:33,299 INFO L226 Difference]: Without dead ends: 293 [2022-04-28 10:10:33,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:10:33,299 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 47 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:33,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 76 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:10:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-04-28 10:10:34,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 242. [2022-04-28 10:10:34,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:34,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 293 states. Second operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:34,137 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:34,137 INFO L87 Difference]: Start difference. First operand 293 states. Second operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:34,140 INFO L93 Difference]: Finished difference Result 293 states and 378 transitions. [2022-04-28 10:10:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 378 transitions. [2022-04-28 10:10:34,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:34,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:34,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 3 states have call successors, (3), 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 293 states. [2022-04-28 10:10:34,141 INFO L87 Difference]: Start difference. First operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 3 states have call successors, (3), 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 293 states. [2022-04-28 10:10:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:34,144 INFO L93 Difference]: Finished difference Result 293 states and 378 transitions. [2022-04-28 10:10:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 378 transitions. [2022-04-28 10:10:34,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:34,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:34,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:34,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 326 transitions. [2022-04-28 10:10:34,148 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 326 transitions. Word has length 31 [2022-04-28 10:10:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:34,148 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 326 transitions. [2022-04-28 10:10:34,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-28 10:10:34,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 326 transitions. [2022-04-28 10:10:35,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 326 transitions. [2022-04-28 10:10:35,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:10:35,241 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:35,241 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:35,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-04-28 10:10:35,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:35,442 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:35,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:35,442 INFO L85 PathProgramCache]: Analyzing trace with hash -853881000, now seen corresponding path program 31 times [2022-04-28 10:10:35,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:35,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [679047668] [2022-04-28 10:10:35,454 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:35,454 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:35,454 INFO L85 PathProgramCache]: Analyzing trace with hash -853881000, now seen corresponding path program 32 times [2022-04-28 10:10:35,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:35,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947688170] [2022-04-28 10:10:35,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:35,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:35,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:35,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {47007#(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); {46984#true} is VALID [2022-04-28 10:10:35,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {46984#true} assume true; {46984#true} is VALID [2022-04-28 10:10:35,778 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46984#true} {46984#true} #72#return; {46984#true} is VALID [2022-04-28 10:10:35,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {46984#true} call ULTIMATE.init(); {47007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:35,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {47007#(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); {46984#true} is VALID [2022-04-28 10:10:35,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {46984#true} assume true; {46984#true} is VALID [2022-04-28 10:10:35,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46984#true} {46984#true} #72#return; {46984#true} is VALID [2022-04-28 10:10:35,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {46984#true} call #t~ret13 := main(); {46984#true} is VALID [2022-04-28 10:10:35,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {46984#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46989#(= main_~y~0 0)} is VALID [2022-04-28 10:10:35,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {46989#(= 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; {46990#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:35,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {46990#(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; {46991#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:35,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {46991#(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; {46992#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:35,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {46992#(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; {46993#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:35,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {46993#(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; {46994#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:35,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {46994#(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; {46995#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:35,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {46995#(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; {46996#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:35,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {46996#(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; {46997#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:35,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {46997#(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; {46998#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:35,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {46998#(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; {46999#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:35,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {46999#(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; {47000#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:35,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {47000#(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; {47001#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:35,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {47001#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47002#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:35,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {47002#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47003#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:35,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {47003#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47004#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:35,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {47004#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47005#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:35,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {47005#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {47005#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:35,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {47005#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {47006#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:35,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {47006#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {46985#false} is VALID [2022-04-28 10:10:35,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {46985#false} assume !(~y~0 % 4294967296 > 0); {46985#false} is VALID [2022-04-28 10:10:35,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {46985#false} assume !(~x~0 % 4294967296 > 0); {46985#false} is VALID [2022-04-28 10:10:35,790 INFO L272 TraceCheckUtils]: 27: Hoare triple {46985#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {46985#false} is VALID [2022-04-28 10:10:35,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {46985#false} ~cond := #in~cond; {46985#false} is VALID [2022-04-28 10:10:35,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {46985#false} assume 0 == ~cond; {46985#false} is VALID [2022-04-28 10:10:35,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {46985#false} assume !false; {46985#false} is VALID [2022-04-28 10:10:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:35,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:35,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947688170] [2022-04-28 10:10:35,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947688170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:35,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481541820] [2022-04-28 10:10:35,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:35,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:35,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:35,793 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:35,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 10:10:35,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:35,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:35,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:10:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:35,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:36,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {46984#true} call ULTIMATE.init(); {46984#true} is VALID [2022-04-28 10:10:36,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {46984#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); {46984#true} is VALID [2022-04-28 10:10:36,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {46984#true} assume true; {46984#true} is VALID [2022-04-28 10:10:36,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46984#true} {46984#true} #72#return; {46984#true} is VALID [2022-04-28 10:10:36,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {46984#true} call #t~ret13 := main(); {46984#true} is VALID [2022-04-28 10:10:36,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {46984#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46989#(= main_~y~0 0)} is VALID [2022-04-28 10:10:36,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {46989#(= 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; {46990#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:36,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {46990#(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; {46991#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:36,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {46991#(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; {46992#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:36,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {46992#(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; {46993#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:36,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {46993#(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; {46994#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:36,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {46994#(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; {46995#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:36,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {46995#(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; {46996#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:36,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {46996#(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; {46997#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:36,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {46997#(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; {46998#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:36,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {46998#(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; {46999#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:36,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {46999#(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; {47000#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:36,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {47000#(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; {47001#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:36,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {47001#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47002#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:36,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {47002#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47003#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:36,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {47003#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47004#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:36,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {47004#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47005#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:36,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {47005#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {47005#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:36,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {47005#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {47080#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:10:36,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {47080#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {46985#false} is VALID [2022-04-28 10:10:36,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {46985#false} assume !(~y~0 % 4294967296 > 0); {46985#false} is VALID [2022-04-28 10:10:36,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {46985#false} assume !(~x~0 % 4294967296 > 0); {46985#false} is VALID [2022-04-28 10:10:36,220 INFO L272 TraceCheckUtils]: 27: Hoare triple {46985#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {46985#false} is VALID [2022-04-28 10:10:36,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {46985#false} ~cond := #in~cond; {46985#false} is VALID [2022-04-28 10:10:36,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {46985#false} assume 0 == ~cond; {46985#false} is VALID [2022-04-28 10:10:36,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {46985#false} assume !false; {46985#false} is VALID [2022-04-28 10:10:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:36,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:36,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {46985#false} assume !false; {46985#false} is VALID [2022-04-28 10:10:36,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {46985#false} assume 0 == ~cond; {46985#false} is VALID [2022-04-28 10:10:36,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {46985#false} ~cond := #in~cond; {46985#false} is VALID [2022-04-28 10:10:36,842 INFO L272 TraceCheckUtils]: 27: Hoare triple {46985#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {46985#false} is VALID [2022-04-28 10:10:36,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {46985#false} assume !(~x~0 % 4294967296 > 0); {46985#false} is VALID [2022-04-28 10:10:36,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {46985#false} assume !(~y~0 % 4294967296 > 0); {46985#false} is VALID [2022-04-28 10:10:36,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {47120#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {46985#false} is VALID [2022-04-28 10:10:36,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {47124#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {47120#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:36,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {47124#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {47124#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:36,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {47131#(< 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; {47124#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:36,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {47135#(< 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; {47131#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:36,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {47139#(< 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; {47135#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:36,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {47143#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47139#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:36,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {47147#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47143#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:36,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {47151#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47147#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:36,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {47155#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47151#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:36,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {47159#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47155#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:36,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {47163#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47159#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:36,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {47167#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47163#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:10:36,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {47171#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47167#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:10:36,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {47175#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47171#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:10:36,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {47179#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47175#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:10:36,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {47183#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47179#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:10:36,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {47187#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47183#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:10:36,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {47191#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47187#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:10:36,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {46984#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47191#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:10:36,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {46984#true} call #t~ret13 := main(); {46984#true} is VALID [2022-04-28 10:10:36,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46984#true} {46984#true} #72#return; {46984#true} is VALID [2022-04-28 10:10:36,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {46984#true} assume true; {46984#true} is VALID [2022-04-28 10:10:36,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {46984#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); {46984#true} is VALID [2022-04-28 10:10:36,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {46984#true} call ULTIMATE.init(); {46984#true} is VALID [2022-04-28 10:10:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:36,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481541820] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:36,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:36,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:10:36,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:36,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [679047668] [2022-04-28 10:10:36,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [679047668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:36,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:36,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:10:36,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121510531] [2022-04-28 10:10:36,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:36,856 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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 31 [2022-04-28 10:10:36,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:36,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:10:36,875 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-28 10:10:36,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:10:36,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:10:36,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:10:36,876 INFO L87 Difference]: Start difference. First operand 242 states and 326 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:10:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:40,707 INFO L93 Difference]: Finished difference Result 386 states and 588 transitions. [2022-04-28 10:10:40,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:10:40,707 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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 31 [2022-04-28 10:10:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:40,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:10:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 135 transitions. [2022-04-28 10:10:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:10:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 135 transitions. [2022-04-28 10:10:40,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 135 transitions. [2022-04-28 10:10:40,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:40,823 INFO L225 Difference]: With dead ends: 386 [2022-04-28 10:10:40,823 INFO L226 Difference]: Without dead ends: 364 [2022-04-28 10:10:40,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=748, Invalid=2558, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:10:40,824 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 122 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:40,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 142 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 10:10:40,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-28 10:10:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 257. [2022-04-28 10:10:41,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:41,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 364 states. Second operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:41,648 INFO L74 IsIncluded]: Start isIncluded. First operand 364 states. Second operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:41,649 INFO L87 Difference]: Start difference. First operand 364 states. Second operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:41,655 INFO L93 Difference]: Finished difference Result 364 states and 456 transitions. [2022-04-28 10:10:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 456 transitions. [2022-04-28 10:10:41,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:41,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:41,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 3 states have call successors, (3), 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 364 states. [2022-04-28 10:10:41,656 INFO L87 Difference]: Start difference. First operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 3 states have call successors, (3), 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 364 states. [2022-04-28 10:10:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:41,663 INFO L93 Difference]: Finished difference Result 364 states and 456 transitions. [2022-04-28 10:10:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 456 transitions. [2022-04-28 10:10:41,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:41,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:41,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:41,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 348 transitions. [2022-04-28 10:10:41,668 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 348 transitions. Word has length 31 [2022-04-28 10:10:41,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:41,668 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 348 transitions. [2022-04-28 10:10:41,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:10:41,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 348 transitions. [2022-04-28 10:10:42,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 348 edges. 348 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2022-04-28 10:10:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:42,696 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:42,696 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:42,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-04-28 10:10:42,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-04-28 10:10:42,897 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:42,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:42,897 INFO L85 PathProgramCache]: Analyzing trace with hash 561664800, now seen corresponding path program 37 times [2022-04-28 10:10:42,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:42,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1031861330] [2022-04-28 10:10:42,899 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:42,899 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash 561664800, now seen corresponding path program 38 times [2022-04-28 10:10:42,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:42,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691287007] [2022-04-28 10:10:42,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:42,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:42,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:43,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {49272#(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); {49262#true} is VALID [2022-04-28 10:10:43,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {49262#true} assume true; {49262#true} is VALID [2022-04-28 10:10:43,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49262#true} {49262#true} #72#return; {49262#true} is VALID [2022-04-28 10:10:43,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {49262#true} call ULTIMATE.init(); {49272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:43,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {49272#(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); {49262#true} is VALID [2022-04-28 10:10:43,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {49262#true} assume true; {49262#true} is VALID [2022-04-28 10:10:43,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49262#true} {49262#true} #72#return; {49262#true} is VALID [2022-04-28 10:10:43,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {49262#true} call #t~ret13 := main(); {49262#true} is VALID [2022-04-28 10:10:43,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {49262#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49262#true} is VALID [2022-04-28 10:10:43,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {49262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49262#true} is VALID [2022-04-28 10:10:43,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {49262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49262#true} is VALID [2022-04-28 10:10:43,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {49262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49262#true} is VALID [2022-04-28 10:10:43,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {49262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49262#true} is VALID [2022-04-28 10:10:43,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {49262#true} assume !(~x~0 % 4294967296 > 0); {49267#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:43,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {49267#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {49267#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:43,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {49267#(<= 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; {49268#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:43,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {49268#(<= 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; {49269#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {49269#(<= 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; {49270#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {49270#(<= 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; {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {49270#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {49270#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {49269#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {49269#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {49268#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:43,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {49268#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {49267#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:43,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {49267#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {49263#false} is VALID [2022-04-28 10:10:43,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {49263#false} assume !(~x~0 % 4294967296 > 0); {49263#false} is VALID [2022-04-28 10:10:43,016 INFO L272 TraceCheckUtils]: 28: Hoare triple {49263#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {49263#false} is VALID [2022-04-28 10:10:43,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {49263#false} ~cond := #in~cond; {49263#false} is VALID [2022-04-28 10:10:43,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {49263#false} assume 0 == ~cond; {49263#false} is VALID [2022-04-28 10:10:43,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {49263#false} assume !false; {49263#false} is VALID [2022-04-28 10:10:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:10:43,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:43,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691287007] [2022-04-28 10:10:43,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691287007] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:43,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554967011] [2022-04-28 10:10:43,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:43,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:43,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:43,019 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:43,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-28 10:10:43,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:43,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:43,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:10:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:43,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:43,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {49262#true} call ULTIMATE.init(); {49262#true} is VALID [2022-04-28 10:10:43,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {49262#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); {49262#true} is VALID [2022-04-28 10:10:43,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {49262#true} assume true; {49262#true} is VALID [2022-04-28 10:10:43,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49262#true} {49262#true} #72#return; {49262#true} is VALID [2022-04-28 10:10:43,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {49262#true} call #t~ret13 := main(); {49262#true} is VALID [2022-04-28 10:10:43,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {49262#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49262#true} is VALID [2022-04-28 10:10:43,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {49262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49262#true} is VALID [2022-04-28 10:10:43,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {49262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49262#true} is VALID [2022-04-28 10:10:43,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {49262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49262#true} is VALID [2022-04-28 10:10:43,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {49262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49262#true} is VALID [2022-04-28 10:10:43,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {49262#true} assume !(~x~0 % 4294967296 > 0); {49267#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:43,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {49267#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {49267#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:43,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {49267#(<= 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; {49268#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:43,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {49268#(<= 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; {49269#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {49269#(<= 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; {49270#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {49270#(<= 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; {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {49270#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {49270#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {49269#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {49269#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {49268#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:43,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {49268#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {49267#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:43,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {49267#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {49263#false} is VALID [2022-04-28 10:10:43,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {49263#false} assume !(~x~0 % 4294967296 > 0); {49263#false} is VALID [2022-04-28 10:10:43,334 INFO L272 TraceCheckUtils]: 28: Hoare triple {49263#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {49263#false} is VALID [2022-04-28 10:10:43,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {49263#false} ~cond := #in~cond; {49263#false} is VALID [2022-04-28 10:10:43,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {49263#false} assume 0 == ~cond; {49263#false} is VALID [2022-04-28 10:10:43,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {49263#false} assume !false; {49263#false} is VALID [2022-04-28 10:10:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:10:43,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:43,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {49263#false} assume !false; {49263#false} is VALID [2022-04-28 10:10:43,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {49263#false} assume 0 == ~cond; {49263#false} is VALID [2022-04-28 10:10:43,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {49263#false} ~cond := #in~cond; {49263#false} is VALID [2022-04-28 10:10:43,561 INFO L272 TraceCheckUtils]: 28: Hoare triple {49263#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {49263#false} is VALID [2022-04-28 10:10:43,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {49263#false} assume !(~x~0 % 4294967296 > 0); {49263#false} is VALID [2022-04-28 10:10:43,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {49267#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {49263#false} is VALID [2022-04-28 10:10:43,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {49268#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {49267#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:43,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {49269#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {49268#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:43,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {49270#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {49269#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {49270#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {49270#(<= 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; {49271#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {49269#(<= 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; {49270#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {49268#(<= 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; {49269#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:43,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {49267#(<= 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; {49268#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:43,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {49267#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {49267#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:43,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {49262#true} assume !(~x~0 % 4294967296 > 0); {49267#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:43,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {49262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49262#true} is VALID [2022-04-28 10:10:43,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {49262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49262#true} is VALID [2022-04-28 10:10:43,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {49262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49262#true} is VALID [2022-04-28 10:10:43,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {49262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49262#true} is VALID [2022-04-28 10:10:43,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {49262#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49262#true} is VALID [2022-04-28 10:10:43,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {49262#true} call #t~ret13 := main(); {49262#true} is VALID [2022-04-28 10:10:43,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49262#true} {49262#true} #72#return; {49262#true} is VALID [2022-04-28 10:10:43,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {49262#true} assume true; {49262#true} is VALID [2022-04-28 10:10:43,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {49262#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); {49262#true} is VALID [2022-04-28 10:10:43,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {49262#true} call ULTIMATE.init(); {49262#true} is VALID [2022-04-28 10:10:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:10:43,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554967011] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:43,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:43,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-04-28 10:10:43,573 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:43,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1031861330] [2022-04-28 10:10:43,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1031861330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:43,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:43,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:10:43,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740359334] [2022-04-28 10:10:43,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:43,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 32 [2022-04-28 10:10:43,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:43,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-28 10:10:43,594 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-28 10:10:43,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:10:43,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:43,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:10:43,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:10:43,595 INFO L87 Difference]: Start difference. First operand 257 states and 348 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-28 10:10:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:44,922 INFO L93 Difference]: Finished difference Result 278 states and 370 transitions. [2022-04-28 10:10:44,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:10:44,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 32 [2022-04-28 10:10:44,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-28 10:10:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-28 10:10:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-28 10:10:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-28 10:10:44,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2022-04-28 10:10:44,968 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-28 10:10:44,971 INFO L225 Difference]: With dead ends: 278 [2022-04-28 10:10:44,971 INFO L226 Difference]: Without dead ends: 256 [2022-04-28 10:10:44,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:10:44,971 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:44,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 55 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:10:44,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-28 10:10:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2022-04-28 10:10:45,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:45,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:45,798 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:45,798 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:45,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:45,801 INFO L93 Difference]: Finished difference Result 256 states and 346 transitions. [2022-04-28 10:10:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 346 transitions. [2022-04-28 10:10:45,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:45,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:45,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 3 states have call successors, (3), 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 256 states. [2022-04-28 10:10:45,801 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 3 states have call successors, (3), 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 256 states. [2022-04-28 10:10:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:45,804 INFO L93 Difference]: Finished difference Result 256 states and 346 transitions. [2022-04-28 10:10:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 346 transitions. [2022-04-28 10:10:45,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:45,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:45,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:45,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 342 transitions. [2022-04-28 10:10:45,811 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 342 transitions. Word has length 32 [2022-04-28 10:10:45,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:45,811 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 342 transitions. [2022-04-28 10:10:45,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-28 10:10:45,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 342 transitions. [2022-04-28 10:10:46,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 342 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 342 transitions. [2022-04-28 10:10:46,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:46,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:46,861 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:46,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:47,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-28 10:10:47,062 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:47,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:47,062 INFO L85 PathProgramCache]: Analyzing trace with hash 336197729, now seen corresponding path program 33 times [2022-04-28 10:10:47,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:47,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1630095994] [2022-04-28 10:10:47,064 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:47,064 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:47,064 INFO L85 PathProgramCache]: Analyzing trace with hash 336197729, now seen corresponding path program 34 times [2022-04-28 10:10:47,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:47,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363756506] [2022-04-28 10:10:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:47,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:47,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {51070#(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); {51046#true} is VALID [2022-04-28 10:10:47,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {51046#true} assume true; {51046#true} is VALID [2022-04-28 10:10:47,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51046#true} {51046#true} #72#return; {51046#true} is VALID [2022-04-28 10:10:47,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {51046#true} call ULTIMATE.init(); {51070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:47,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {51070#(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); {51046#true} is VALID [2022-04-28 10:10:47,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {51046#true} assume true; {51046#true} is VALID [2022-04-28 10:10:47,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51046#true} {51046#true} #72#return; {51046#true} is VALID [2022-04-28 10:10:47,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {51046#true} call #t~ret13 := main(); {51046#true} is VALID [2022-04-28 10:10:47,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {51046#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51051#(= main_~y~0 0)} is VALID [2022-04-28 10:10:47,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {51051#(= 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; {51052#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:47,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {51052#(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; {51053#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:47,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {51053#(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; {51054#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:47,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {51054#(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; {51055#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:47,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {51055#(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; {51056#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:47,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {51056#(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; {51057#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:47,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {51057#(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; {51058#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:47,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {51058#(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; {51059#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:47,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {51059#(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; {51060#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:47,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {51060#(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; {51061#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:47,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {51061#(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; {51062#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:47,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {51062#(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; {51063#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:47,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {51063#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51064#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:47,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {51064#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51065#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:47,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {51065#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51066#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:47,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {51066#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51067#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:47,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {51067#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51068#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:10:47,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {51068#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {51068#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:10:47,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {51068#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {51069#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-28 10:10:47,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {51069#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {51047#false} is VALID [2022-04-28 10:10:47,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {51047#false} assume !(~y~0 % 4294967296 > 0); {51047#false} is VALID [2022-04-28 10:10:47,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {51047#false} assume !(~x~0 % 4294967296 > 0); {51047#false} is VALID [2022-04-28 10:10:47,441 INFO L272 TraceCheckUtils]: 28: Hoare triple {51047#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {51047#false} is VALID [2022-04-28 10:10:47,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {51047#false} ~cond := #in~cond; {51047#false} is VALID [2022-04-28 10:10:47,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {51047#false} assume 0 == ~cond; {51047#false} is VALID [2022-04-28 10:10:47,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {51047#false} assume !false; {51047#false} is VALID [2022-04-28 10:10:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:47,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:47,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363756506] [2022-04-28 10:10:47,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363756506] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:47,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211648406] [2022-04-28 10:10:47,442 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:47,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:47,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:47,449 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:47,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-28 10:10:47,488 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:47,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:47,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:10:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:47,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:47,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {51046#true} call ULTIMATE.init(); {51046#true} is VALID [2022-04-28 10:10:47,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {51046#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); {51046#true} is VALID [2022-04-28 10:10:47,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {51046#true} assume true; {51046#true} is VALID [2022-04-28 10:10:47,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51046#true} {51046#true} #72#return; {51046#true} is VALID [2022-04-28 10:10:47,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {51046#true} call #t~ret13 := main(); {51046#true} is VALID [2022-04-28 10:10:47,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {51046#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51051#(= main_~y~0 0)} is VALID [2022-04-28 10:10:47,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {51051#(= 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; {51052#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:47,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {51052#(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; {51053#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:47,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {51053#(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; {51054#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:47,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {51054#(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; {51055#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:47,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {51055#(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; {51056#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:47,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {51056#(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; {51057#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:47,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {51057#(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; {51058#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:47,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {51058#(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; {51059#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:47,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {51059#(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; {51060#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:47,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {51060#(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; {51061#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:47,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {51061#(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; {51062#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:47,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {51062#(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; {51063#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:47,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {51063#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51064#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:47,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {51064#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51065#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:47,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {51065#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51066#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:47,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {51066#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51067#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:47,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {51067#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51068#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:10:47,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {51068#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {51068#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:10:47,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {51068#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {51146#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-28 10:10:47,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {51146#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {51047#false} is VALID [2022-04-28 10:10:47,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {51047#false} assume !(~y~0 % 4294967296 > 0); {51047#false} is VALID [2022-04-28 10:10:47,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {51047#false} assume !(~x~0 % 4294967296 > 0); {51047#false} is VALID [2022-04-28 10:10:47,799 INFO L272 TraceCheckUtils]: 28: Hoare triple {51047#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {51047#false} is VALID [2022-04-28 10:10:47,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {51047#false} ~cond := #in~cond; {51047#false} is VALID [2022-04-28 10:10:47,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {51047#false} assume 0 == ~cond; {51047#false} is VALID [2022-04-28 10:10:47,800 INFO L290 TraceCheckUtils]: 31: Hoare triple {51047#false} assume !false; {51047#false} is VALID [2022-04-28 10:10:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:47,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:48,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {51047#false} assume !false; {51047#false} is VALID [2022-04-28 10:10:48,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {51047#false} assume 0 == ~cond; {51047#false} is VALID [2022-04-28 10:10:48,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {51047#false} ~cond := #in~cond; {51047#false} is VALID [2022-04-28 10:10:48,460 INFO L272 TraceCheckUtils]: 28: Hoare triple {51047#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {51047#false} is VALID [2022-04-28 10:10:48,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {51047#false} assume !(~x~0 % 4294967296 > 0); {51047#false} is VALID [2022-04-28 10:10:48,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {51047#false} assume !(~y~0 % 4294967296 > 0); {51047#false} is VALID [2022-04-28 10:10:48,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {51186#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {51047#false} is VALID [2022-04-28 10:10:48,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {51190#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {51186#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:48,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {51190#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {51190#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:48,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {51197#(< 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; {51190#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:48,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {51201#(< 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; {51197#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:48,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {51205#(< 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; {51201#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:48,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {51209#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51205#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:48,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {51213#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51209#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:48,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {51217#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51213#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:48,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {51221#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51217#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:48,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {51225#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51221#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:48,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {51229#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51225#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:48,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {51233#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51229#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:10:48,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {51237#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51233#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:10:48,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {51241#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51237#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:10:48,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {51245#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51241#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:10:48,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {51249#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51245#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:10:48,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {51253#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51249#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:10:48,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {51257#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51253#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:10:48,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {51261#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51257#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:10:48,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {51046#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51261#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:10:48,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {51046#true} call #t~ret13 := main(); {51046#true} is VALID [2022-04-28 10:10:48,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51046#true} {51046#true} #72#return; {51046#true} is VALID [2022-04-28 10:10:48,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {51046#true} assume true; {51046#true} is VALID [2022-04-28 10:10:48,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {51046#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); {51046#true} is VALID [2022-04-28 10:10:48,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {51046#true} call ULTIMATE.init(); {51046#true} is VALID [2022-04-28 10:10:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:48,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211648406] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:48,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:48,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:10:48,474 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:48,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1630095994] [2022-04-28 10:10:48,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1630095994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:48,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:48,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:10:48,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647000852] [2022-04-28 10:10:48,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:48,475 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 32 [2022-04-28 10:10:48,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:48,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:10:48,495 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-28 10:10:48,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:10:48,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:48,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:10:48,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:10:48,496 INFO L87 Difference]: Start difference. First operand 252 states and 342 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:10:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:52,666 INFO L93 Difference]: Finished difference Result 404 states and 618 transitions. [2022-04-28 10:10:52,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:10:52,666 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 32 [2022-04-28 10:10:52,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:10:52,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 138 transitions. [2022-04-28 10:10:52,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:10:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 138 transitions. [2022-04-28 10:10:52,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 138 transitions. [2022-04-28 10:10:52,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:52,791 INFO L225 Difference]: With dead ends: 404 [2022-04-28 10:10:52,791 INFO L226 Difference]: Without dead ends: 381 [2022-04-28 10:10:52,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=827, Invalid=2833, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:10:52,792 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 122 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:52,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 147 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 10:10:52,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-04-28 10:10:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 267. [2022-04-28 10:10:53,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:53,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 381 states. Second operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:53,696 INFO L74 IsIncluded]: Start isIncluded. First operand 381 states. Second operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:53,696 INFO L87 Difference]: Start difference. First operand 381 states. Second operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:53,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:53,701 INFO L93 Difference]: Finished difference Result 381 states and 479 transitions. [2022-04-28 10:10:53,701 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 479 transitions. [2022-04-28 10:10:53,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:53,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:53,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 3 states have call successors, (3), 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 381 states. [2022-04-28 10:10:53,702 INFO L87 Difference]: Start difference. First operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 3 states have call successors, (3), 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 381 states. [2022-04-28 10:10:53,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:53,707 INFO L93 Difference]: Finished difference Result 381 states and 479 transitions. [2022-04-28 10:10:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 479 transitions. [2022-04-28 10:10:53,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:53,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:53,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:53,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 364 transitions. [2022-04-28 10:10:53,711 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 364 transitions. Word has length 32 [2022-04-28 10:10:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:53,711 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 364 transitions. [2022-04-28 10:10:53,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:10:53,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 267 states and 364 transitions. [2022-04-28 10:10:54,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 364 edges. 364 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 364 transitions. [2022-04-28 10:10:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:10:54,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:54,909 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:54,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-04-28 10:10:55,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-28 10:10:55,110 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:55,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:55,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2019384376, now seen corresponding path program 39 times [2022-04-28 10:10:55,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:55,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1736163115] [2022-04-28 10:10:55,115 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:55,115 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:55,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2019384376, now seen corresponding path program 40 times [2022-04-28 10:10:55,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:55,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913397889] [2022-04-28 10:10:55,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:55,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:55,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:55,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {53440#(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); {53424#true} is VALID [2022-04-28 10:10:55,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {53424#true} assume true; {53424#true} is VALID [2022-04-28 10:10:55,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53424#true} {53424#true} #72#return; {53424#true} is VALID [2022-04-28 10:10:55,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {53424#true} call ULTIMATE.init(); {53440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:55,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {53440#(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); {53424#true} is VALID [2022-04-28 10:10:55,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {53424#true} assume true; {53424#true} is VALID [2022-04-28 10:10:55,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53424#true} {53424#true} #72#return; {53424#true} is VALID [2022-04-28 10:10:55,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {53424#true} call #t~ret13 := main(); {53424#true} is VALID [2022-04-28 10:10:55,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {53424#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53429#(= main_~y~0 0)} is VALID [2022-04-28 10:10:55,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {53429#(= 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; {53430#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:55,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {53430#(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; {53431#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:55,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {53431#(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; {53432#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:55,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {53432#(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; {53433#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:55,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {53433#(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; {53434#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:55,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {53434#(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; {53435#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:55,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {53435#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {53435#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:55,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {53435#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {53436#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:55,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {53436#(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; {53437#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:55,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {53437#(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; {53438#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:55,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {53438#(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; {53439#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:55,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {53439#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {53425#false} is VALID [2022-04-28 10:10:55,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {53425#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53425#false} is VALID [2022-04-28 10:10:55,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {53425#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53425#false} is VALID [2022-04-28 10:10:55,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {53425#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53425#false} is VALID [2022-04-28 10:10:55,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {53425#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53425#false} is VALID [2022-04-28 10:10:55,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {53425#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53425#false} is VALID [2022-04-28 10:10:55,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {53425#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53425#false} is VALID [2022-04-28 10:10:55,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {53425#false} assume !(~y~0 % 4294967296 > 0); {53425#false} is VALID [2022-04-28 10:10:55,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {53425#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53425#false} is VALID [2022-04-28 10:10:55,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {53425#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53425#false} is VALID [2022-04-28 10:10:55,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {53425#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53425#false} is VALID [2022-04-28 10:10:55,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {53425#false} assume !(~x~0 % 4294967296 > 0); {53425#false} is VALID [2022-04-28 10:10:55,328 INFO L272 TraceCheckUtils]: 29: Hoare triple {53425#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {53425#false} is VALID [2022-04-28 10:10:55,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {53425#false} ~cond := #in~cond; {53425#false} is VALID [2022-04-28 10:10:55,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {53425#false} assume 0 == ~cond; {53425#false} is VALID [2022-04-28 10:10:55,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {53425#false} assume !false; {53425#false} is VALID [2022-04-28 10:10:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 10:10:55,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:55,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913397889] [2022-04-28 10:10:55,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913397889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:55,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777775519] [2022-04-28 10:10:55,329 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:55,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:55,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:55,330 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:55,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-28 10:10:55,382 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:55,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:55,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:10:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:55,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:55,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {53424#true} call ULTIMATE.init(); {53424#true} is VALID [2022-04-28 10:10:55,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {53424#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); {53424#true} is VALID [2022-04-28 10:10:55,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {53424#true} assume true; {53424#true} is VALID [2022-04-28 10:10:55,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53424#true} {53424#true} #72#return; {53424#true} is VALID [2022-04-28 10:10:55,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {53424#true} call #t~ret13 := main(); {53424#true} is VALID [2022-04-28 10:10:55,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {53424#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53429#(= main_~y~0 0)} is VALID [2022-04-28 10:10:55,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {53429#(= 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; {53430#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:55,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {53430#(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; {53431#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:55,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {53431#(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; {53432#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:55,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {53432#(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; {53433#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:55,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {53433#(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; {53434#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:55,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {53434#(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; {53435#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:55,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {53435#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {53435#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:55,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {53435#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {53483#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:55,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {53483#(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; {53487#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:10:55,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {53487#(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; {53491#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:55,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {53491#(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; {53495#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:55,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {53495#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {53425#false} is VALID [2022-04-28 10:10:55,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {53425#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53425#false} is VALID [2022-04-28 10:10:55,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {53425#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53425#false} is VALID [2022-04-28 10:10:55,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {53425#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53425#false} is VALID [2022-04-28 10:10:55,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {53425#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53425#false} is VALID [2022-04-28 10:10:55,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {53425#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53425#false} is VALID [2022-04-28 10:10:55,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {53425#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53425#false} is VALID [2022-04-28 10:10:55,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {53425#false} assume !(~y~0 % 4294967296 > 0); {53425#false} is VALID [2022-04-28 10:10:55,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {53425#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53425#false} is VALID [2022-04-28 10:10:55,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {53425#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53425#false} is VALID [2022-04-28 10:10:55,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {53425#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53425#false} is VALID [2022-04-28 10:10:55,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {53425#false} assume !(~x~0 % 4294967296 > 0); {53425#false} is VALID [2022-04-28 10:10:55,644 INFO L272 TraceCheckUtils]: 29: Hoare triple {53425#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {53425#false} is VALID [2022-04-28 10:10:55,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {53425#false} ~cond := #in~cond; {53425#false} is VALID [2022-04-28 10:10:55,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {53425#false} assume 0 == ~cond; {53425#false} is VALID [2022-04-28 10:10:55,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {53425#false} assume !false; {53425#false} is VALID [2022-04-28 10:10:55,644 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 10:10:55,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:55,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {53425#false} assume !false; {53425#false} is VALID [2022-04-28 10:10:55,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {53425#false} assume 0 == ~cond; {53425#false} is VALID [2022-04-28 10:10:55,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {53425#false} ~cond := #in~cond; {53425#false} is VALID [2022-04-28 10:10:55,890 INFO L272 TraceCheckUtils]: 29: Hoare triple {53425#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {53425#false} is VALID [2022-04-28 10:10:55,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {53425#false} assume !(~x~0 % 4294967296 > 0); {53425#false} is VALID [2022-04-28 10:10:55,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {53425#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53425#false} is VALID [2022-04-28 10:10:55,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {53425#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53425#false} is VALID [2022-04-28 10:10:55,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {53425#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53425#false} is VALID [2022-04-28 10:10:55,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {53425#false} assume !(~y~0 % 4294967296 > 0); {53425#false} is VALID [2022-04-28 10:10:55,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {53425#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53425#false} is VALID [2022-04-28 10:10:55,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {53425#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53425#false} is VALID [2022-04-28 10:10:55,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {53577#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53425#false} is VALID [2022-04-28 10:10:55,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {53581#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53577#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:10:55,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {53585#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53581#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:10:55,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {53589#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53585#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:10:55,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {53593#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {53589#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:55,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {53597#(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; {53593#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:10:55,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {53601#(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; {53597#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:10:55,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {53605#(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; {53601#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:10:55,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {53424#true} ~z~0 := ~y~0; {53605#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:55,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {53424#true} assume !(~x~0 % 4294967296 > 0); {53424#true} is VALID [2022-04-28 10:10:55,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {53424#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53424#true} is VALID [2022-04-28 10:10:55,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {53424#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53424#true} is VALID [2022-04-28 10:10:55,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {53424#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53424#true} is VALID [2022-04-28 10:10:55,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {53424#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53424#true} is VALID [2022-04-28 10:10:55,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {53424#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53424#true} is VALID [2022-04-28 10:10:55,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {53424#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53424#true} is VALID [2022-04-28 10:10:55,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {53424#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53424#true} is VALID [2022-04-28 10:10:55,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {53424#true} call #t~ret13 := main(); {53424#true} is VALID [2022-04-28 10:10:55,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53424#true} {53424#true} #72#return; {53424#true} is VALID [2022-04-28 10:10:55,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {53424#true} assume true; {53424#true} is VALID [2022-04-28 10:10:55,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {53424#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); {53424#true} is VALID [2022-04-28 10:10:55,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {53424#true} call ULTIMATE.init(); {53424#true} is VALID [2022-04-28 10:10:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:10:55,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777775519] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:55,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:55,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 26 [2022-04-28 10:10:55,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:55,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1736163115] [2022-04-28 10:10:55,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1736163115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:55,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:55,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:10:55,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552213829] [2022-04-28 10:10:55,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:55,899 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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 33 [2022-04-28 10:10:55,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:55,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-28 10:10:55,926 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-28 10:10:55,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:10:55,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:55,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:10:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:10:55,927 INFO L87 Difference]: Start difference. First operand 267 states and 364 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-28 10:10:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:57,749 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2022-04-28 10:10:57,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:10:57,749 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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 33 [2022-04-28 10:10:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-28 10:10:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 60 transitions. [2022-04-28 10:10:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-28 10:10:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 60 transitions. [2022-04-28 10:10:57,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 60 transitions. [2022-04-28 10:10:57,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:57,802 INFO L225 Difference]: With dead ends: 316 [2022-04-28 10:10:57,802 INFO L226 Difference]: Without dead ends: 300 [2022-04-28 10:10:57,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:10:57,803 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:57,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 70 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:10:57,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-04-28 10:10:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 267. [2022-04-28 10:10:58,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:58,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 300 states. Second operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:58,684 INFO L74 IsIncluded]: Start isIncluded. First operand 300 states. Second operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:58,685 INFO L87 Difference]: Start difference. First operand 300 states. Second operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:58,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:58,688 INFO L93 Difference]: Finished difference Result 300 states and 397 transitions. [2022-04-28 10:10:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 397 transitions. [2022-04-28 10:10:58,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:58,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:58,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 3 states have call successors, (3), 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 300 states. [2022-04-28 10:10:58,689 INFO L87 Difference]: Start difference. First operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 3 states have call successors, (3), 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 300 states. [2022-04-28 10:10:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:58,692 INFO L93 Difference]: Finished difference Result 300 states and 397 transitions. [2022-04-28 10:10:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 397 transitions. [2022-04-28 10:10:58,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:58,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:58,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:58,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 363 transitions. [2022-04-28 10:10:58,696 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 363 transitions. Word has length 33 [2022-04-28 10:10:58,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:58,696 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 363 transitions. [2022-04-28 10:10:58,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-28 10:10:58,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 267 states and 363 transitions. [2022-04-28 10:11:00,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 363 transitions. [2022-04-28 10:11:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:11:00,083 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:00,083 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:00,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-28 10:11:00,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:00,283 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:00,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:00,283 INFO L85 PathProgramCache]: Analyzing trace with hash -475206312, now seen corresponding path program 19 times [2022-04-28 10:11:00,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:00,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [841759568] [2022-04-28 10:11:00,286 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:00,286 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:00,286 INFO L85 PathProgramCache]: Analyzing trace with hash -475206312, now seen corresponding path program 20 times [2022-04-28 10:11:00,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:00,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429488263] [2022-04-28 10:11:00,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:00,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:00,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:00,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {55461#(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); {55444#true} is VALID [2022-04-28 10:11:00,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {55444#true} assume true; {55444#true} is VALID [2022-04-28 10:11:00,506 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55444#true} {55444#true} #72#return; {55444#true} is VALID [2022-04-28 10:11:00,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {55444#true} call ULTIMATE.init(); {55461#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:00,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {55461#(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); {55444#true} is VALID [2022-04-28 10:11:00,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {55444#true} assume true; {55444#true} is VALID [2022-04-28 10:11:00,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55444#true} {55444#true} #72#return; {55444#true} is VALID [2022-04-28 10:11:00,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {55444#true} call #t~ret13 := main(); {55444#true} is VALID [2022-04-28 10:11:00,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {55444#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55444#true} is VALID [2022-04-28 10:11:00,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {55444#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55449#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:00,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {55449#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55450#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:11:00,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {55450#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55451#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:00,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {55451#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55452#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:00,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {55452#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55453#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:00,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {55453#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55454#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:11:00,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {55454#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {55454#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:11:00,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {55454#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {55454#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:11:00,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {55454#(<= (* 4294967296 (div (+ main_~x~0 6) 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; {55455#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:11:00,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {55455#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55456#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-28 10:11:00,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {55456#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55457#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} is VALID [2022-04-28 10:11:00,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {55457#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55458#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:11:00,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {55458#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55459#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:11:00,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {55459#(<= (+ 5 (* (div (+ main_~x~0 1) 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; {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:00,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:00,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:00,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:00,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:00,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:00,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:00,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:00,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:00,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {55460#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {55445#false} is VALID [2022-04-28 10:11:00,528 INFO L272 TraceCheckUtils]: 29: Hoare triple {55445#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {55445#false} is VALID [2022-04-28 10:11:00,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {55445#false} ~cond := #in~cond; {55445#false} is VALID [2022-04-28 10:11:00,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {55445#false} assume 0 == ~cond; {55445#false} is VALID [2022-04-28 10:11:00,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {55445#false} assume !false; {55445#false} is VALID [2022-04-28 10:11:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:11:00,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:00,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429488263] [2022-04-28 10:11:00,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429488263] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:00,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15238716] [2022-04-28 10:11:00,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:00,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:00,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:00,532 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:00,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-28 10:11:00,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:00,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:00,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:11:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:00,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:00,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {55444#true} call ULTIMATE.init(); {55444#true} is VALID [2022-04-28 10:11:00,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {55444#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); {55444#true} is VALID [2022-04-28 10:11:00,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {55444#true} assume true; {55444#true} is VALID [2022-04-28 10:11:00,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55444#true} {55444#true} #72#return; {55444#true} is VALID [2022-04-28 10:11:00,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {55444#true} call #t~ret13 := main(); {55444#true} is VALID [2022-04-28 10:11:00,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {55444#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55444#true} is VALID [2022-04-28 10:11:00,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {55444#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55449#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:00,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {55449#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55486#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:11:00,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {55486#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55490#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:00,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {55490#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55494#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:11:00,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {55494#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55498#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:00,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {55498#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55502#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:11:00,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {55502#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {55502#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:11:00,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {55502#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {55502#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:11:00,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {55502#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55498#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:00,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {55498#(<= main_~x~0 (+ 4294967290 (* (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; {55494#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:11:00,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {55494#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55490#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:00,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {55490#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {55486#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:11:00,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {55486#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55449#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:00,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {55449#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:00,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:00,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:00,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:00,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:00,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:00,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:00,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:00,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:00,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {55445#false} is VALID [2022-04-28 10:11:00,982 INFO L272 TraceCheckUtils]: 29: Hoare triple {55445#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {55445#false} is VALID [2022-04-28 10:11:00,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {55445#false} ~cond := #in~cond; {55445#false} is VALID [2022-04-28 10:11:00,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {55445#false} assume 0 == ~cond; {55445#false} is VALID [2022-04-28 10:11:00,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {55445#false} assume !false; {55445#false} is VALID [2022-04-28 10:11:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:11:00,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:01,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {55445#false} assume !false; {55445#false} is VALID [2022-04-28 10:11:01,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {55445#false} assume 0 == ~cond; {55445#false} is VALID [2022-04-28 10:11:01,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {55445#false} ~cond := #in~cond; {55445#false} is VALID [2022-04-28 10:11:01,259 INFO L272 TraceCheckUtils]: 29: Hoare triple {55445#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {55445#false} is VALID [2022-04-28 10:11:01,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {55445#false} is VALID [2022-04-28 10:11:01,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:01,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:01,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:01,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:01,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:01,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:01,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:01,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:01,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {55449#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55527#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:01,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {55486#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55449#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:01,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {55490#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {55486#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:11:01,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {55494#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55490#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:01,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {55498#(<= main_~x~0 (+ 4294967290 (* (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; {55494#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:11:01,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {55502#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55498#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:01,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {55502#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {55502#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:11:01,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {55502#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {55502#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:11:01,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {55498#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55502#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:11:01,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {55494#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55498#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:01,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {55490#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55494#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:11:01,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {55486#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55490#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:01,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {55449#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55486#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:11:01,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {55444#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55449#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:01,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {55444#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55444#true} is VALID [2022-04-28 10:11:01,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {55444#true} call #t~ret13 := main(); {55444#true} is VALID [2022-04-28 10:11:01,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55444#true} {55444#true} #72#return; {55444#true} is VALID [2022-04-28 10:11:01,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {55444#true} assume true; {55444#true} is VALID [2022-04-28 10:11:01,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {55444#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); {55444#true} is VALID [2022-04-28 10:11:01,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {55444#true} call ULTIMATE.init(); {55444#true} is VALID [2022-04-28 10:11:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:11:01,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15238716] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:01,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:01,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 21 [2022-04-28 10:11:01,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:01,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [841759568] [2022-04-28 10:11:01,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [841759568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:01,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:01,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:11:01,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117821258] [2022-04-28 10:11:01,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:01,273 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 33 [2022-04-28 10:11:01,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:01,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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-28 10:11:01,296 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-28 10:11:01,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:11:01,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:01,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:11:01,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:11:01,297 INFO L87 Difference]: Start difference. First operand 267 states and 363 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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-28 10:11:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:03,292 INFO L93 Difference]: Finished difference Result 316 states and 437 transitions. [2022-04-28 10:11:03,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:11:03,292 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 33 [2022-04-28 10:11:03,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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-28 10:11:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 82 transitions. [2022-04-28 10:11:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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-28 10:11:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 82 transitions. [2022-04-28 10:11:03,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 82 transitions. [2022-04-28 10:11:03,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:03,406 INFO L225 Difference]: With dead ends: 316 [2022-04-28 10:11:03,406 INFO L226 Difference]: Without dead ends: 311 [2022-04-28 10:11:03,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:11:03,407 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 76 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:03,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 70 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:11:03,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-28 10:11:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 300. [2022-04-28 10:11:04,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:04,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:04,493 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:04,494 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:04,497 INFO L93 Difference]: Finished difference Result 311 states and 427 transitions. [2022-04-28 10:11:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 427 transitions. [2022-04-28 10:11:04,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:04,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:04,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 3 states have call successors, (3), 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 311 states. [2022-04-28 10:11:04,498 INFO L87 Difference]: Start difference. First operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 3 states have call successors, (3), 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 311 states. [2022-04-28 10:11:04,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:04,501 INFO L93 Difference]: Finished difference Result 311 states and 427 transitions. [2022-04-28 10:11:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 427 transitions. [2022-04-28 10:11:04,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:04,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:04,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:04,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 410 transitions. [2022-04-28 10:11:04,506 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 410 transitions. Word has length 33 [2022-04-28 10:11:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:04,506 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 410 transitions. [2022-04-28 10:11:04,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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-28 10:11:04,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 410 transitions. [2022-04-28 10:11:05,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 410 edges. 410 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 410 transitions. [2022-04-28 10:11:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:11:05,798 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:05,798 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:05,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-04-28 10:11:05,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:05,998 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:05,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:05,998 INFO L85 PathProgramCache]: Analyzing trace with hash -891263002, now seen corresponding path program 41 times [2022-04-28 10:11:05,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:05,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [279056738] [2022-04-28 10:11:06,001 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:06,001 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash -891263002, now seen corresponding path program 42 times [2022-04-28 10:11:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:06,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371133433] [2022-04-28 10:11:06,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:06,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:06,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:06,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {57559#(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); {57543#true} is VALID [2022-04-28 10:11:06,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {57543#true} assume true; {57543#true} is VALID [2022-04-28 10:11:06,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57543#true} {57543#true} #72#return; {57543#true} is VALID [2022-04-28 10:11:06,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {57543#true} call ULTIMATE.init(); {57559#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:06,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {57559#(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); {57543#true} is VALID [2022-04-28 10:11:06,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {57543#true} assume true; {57543#true} is VALID [2022-04-28 10:11:06,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57543#true} {57543#true} #72#return; {57543#true} is VALID [2022-04-28 10:11:06,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {57543#true} call #t~ret13 := main(); {57543#true} is VALID [2022-04-28 10:11:06,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {57543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57548#(= main_~y~0 0)} is VALID [2022-04-28 10:11:06,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {57548#(= 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; {57549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:06,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {57549#(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; {57550#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:06,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {57550#(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; {57551#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:06,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {57551#(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; {57552#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:06,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {57552#(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; {57553#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:06,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {57553#(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; {57554#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:06,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {57554#(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; {57555#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:06,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {57555#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {57555#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:06,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {57555#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {57556#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:06,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {57556#(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; {57557#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:06,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {57557#(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; {57558#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:06,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {57558#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {57544#false} is VALID [2022-04-28 10:11:06,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {57544#false} assume !(~y~0 % 4294967296 > 0); {57544#false} is VALID [2022-04-28 10:11:06,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {57544#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {57544#false} is VALID [2022-04-28 10:11:06,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {57544#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {57544#false} is VALID [2022-04-28 10:11:06,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {57544#false} assume !(~x~0 % 4294967296 > 0); {57544#false} is VALID [2022-04-28 10:11:06,224 INFO L272 TraceCheckUtils]: 29: Hoare triple {57544#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {57544#false} is VALID [2022-04-28 10:11:06,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {57544#false} ~cond := #in~cond; {57544#false} is VALID [2022-04-28 10:11:06,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {57544#false} assume 0 == ~cond; {57544#false} is VALID [2022-04-28 10:11:06,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {57544#false} assume !false; {57544#false} is VALID [2022-04-28 10:11:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 10:11:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:06,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371133433] [2022-04-28 10:11:06,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371133433] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:06,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354116034] [2022-04-28 10:11:06,225 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:06,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:06,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:06,228 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:06,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-28 10:11:06,336 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:11:06,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:06,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:11:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:06,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:06,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {57543#true} call ULTIMATE.init(); {57543#true} is VALID [2022-04-28 10:11:06,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {57543#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); {57543#true} is VALID [2022-04-28 10:11:06,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {57543#true} assume true; {57543#true} is VALID [2022-04-28 10:11:06,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57543#true} {57543#true} #72#return; {57543#true} is VALID [2022-04-28 10:11:06,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {57543#true} call #t~ret13 := main(); {57543#true} is VALID [2022-04-28 10:11:06,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {57543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57548#(= main_~y~0 0)} is VALID [2022-04-28 10:11:06,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {57548#(= 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; {57549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:06,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {57549#(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; {57550#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:06,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {57550#(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; {57551#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:06,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {57551#(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; {57552#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:06,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {57552#(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; {57553#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:06,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {57553#(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; {57554#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:06,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {57554#(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; {57555#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:06,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {57555#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {57555#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:06,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {57555#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {57556#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:06,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {57556#(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; {57557#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:06,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {57557#(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; {57611#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:06,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {57611#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {57544#false} is VALID [2022-04-28 10:11:06,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {57544#false} assume !(~y~0 % 4294967296 > 0); {57544#false} is VALID [2022-04-28 10:11:06,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {57544#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {57544#false} is VALID [2022-04-28 10:11:06,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {57544#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {57544#false} is VALID [2022-04-28 10:11:06,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {57544#false} assume !(~x~0 % 4294967296 > 0); {57544#false} is VALID [2022-04-28 10:11:06,601 INFO L272 TraceCheckUtils]: 29: Hoare triple {57544#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {57544#false} is VALID [2022-04-28 10:11:06,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {57544#false} ~cond := #in~cond; {57544#false} is VALID [2022-04-28 10:11:06,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {57544#false} assume 0 == ~cond; {57544#false} is VALID [2022-04-28 10:11:06,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {57544#false} assume !false; {57544#false} is VALID [2022-04-28 10:11:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 10:11:06,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:06,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {57544#false} assume !false; {57544#false} is VALID [2022-04-28 10:11:06,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {57544#false} assume 0 == ~cond; {57544#false} is VALID [2022-04-28 10:11:06,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {57544#false} ~cond := #in~cond; {57544#false} is VALID [2022-04-28 10:11:06,883 INFO L272 TraceCheckUtils]: 29: Hoare triple {57544#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {57544#false} is VALID [2022-04-28 10:11:06,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {57544#false} assume !(~x~0 % 4294967296 > 0); {57544#false} is VALID [2022-04-28 10:11:06,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {57544#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {57544#false} is VALID [2022-04-28 10:11:06,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {57544#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {57544#false} is VALID [2022-04-28 10:11:06,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {57544#false} assume !(~y~0 % 4294967296 > 0); {57544#false} is VALID [2022-04-28 10:11:06,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {57544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57544#false} is VALID [2022-04-28 10:11:06,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {57705#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {57544#false} is VALID [2022-04-28 10:11:06,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {57709#(< 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; {57705#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:06,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {57713#(< 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; {57709#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:06,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {57717#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {57713#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:06,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {57717#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {57717#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:06,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {57724#(< 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; {57717#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:06,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {57728#(< 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; {57724#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:06,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {57732#(< 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; {57728#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:06,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {57736#(< 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; {57732#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:06,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {57740#(< 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; {57736#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:06,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {57744#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57740#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:06,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {57748#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57744#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:06,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {57543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57748#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:06,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {57543#true} call #t~ret13 := main(); {57543#true} is VALID [2022-04-28 10:11:06,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57543#true} {57543#true} #72#return; {57543#true} is VALID [2022-04-28 10:11:06,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {57543#true} assume true; {57543#true} is VALID [2022-04-28 10:11:06,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {57543#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); {57543#true} is VALID [2022-04-28 10:11:06,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {57543#true} call ULTIMATE.init(); {57543#true} is VALID [2022-04-28 10:11:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 10:11:06,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354116034] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:06,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:06,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:11:06,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:06,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [279056738] [2022-04-28 10:11:06,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [279056738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:06,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:06,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:11:06,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484268776] [2022-04-28 10:11:06,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:06,907 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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 33 [2022-04-28 10:11:06,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:06,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-28 10:11:06,930 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-28 10:11:06,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:11:06,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:06,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:11:06,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:11:06,931 INFO L87 Difference]: Start difference. First operand 300 states and 410 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-28 10:11:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:09,151 INFO L93 Difference]: Finished difference Result 369 states and 479 transitions. [2022-04-28 10:11:09,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:11:09,152 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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 33 [2022-04-28 10:11:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-28 10:11:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2022-04-28 10:11:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-28 10:11:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2022-04-28 10:11:09,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 65 transitions. [2022-04-28 10:11:09,204 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-28 10:11:09,210 INFO L225 Difference]: With dead ends: 369 [2022-04-28 10:11:09,210 INFO L226 Difference]: Without dead ends: 353 [2022-04-28 10:11:09,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=326, Invalid=1234, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:11:09,211 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:09,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 79 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:11:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-28 10:11:10,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 300. [2022-04-28 10:11:10,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:10,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:10,253 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:10,254 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:10,258 INFO L93 Difference]: Finished difference Result 353 states and 463 transitions. [2022-04-28 10:11:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 463 transitions. [2022-04-28 10:11:10,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:10,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:10,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 3 states have call successors, (3), 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 353 states. [2022-04-28 10:11:10,259 INFO L87 Difference]: Start difference. First operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 3 states have call successors, (3), 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 353 states. [2022-04-28 10:11:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:10,263 INFO L93 Difference]: Finished difference Result 353 states and 463 transitions. [2022-04-28 10:11:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 463 transitions. [2022-04-28 10:11:10,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:10,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:10,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:10,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 409 transitions. [2022-04-28 10:11:10,268 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 409 transitions. Word has length 33 [2022-04-28 10:11:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:10,268 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 409 transitions. [2022-04-28 10:11:10,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-28 10:11:10,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 409 transitions. [2022-04-28 10:11:11,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 409 transitions. [2022-04-28 10:11:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:11:11,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:11,571 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:11,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:11,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:11,772 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:11,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash -15323528, now seen corresponding path program 43 times [2022-04-28 10:11:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:11,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [925531481] [2022-04-28 10:11:11,774 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:11,774 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash -15323528, now seen corresponding path program 44 times [2022-04-28 10:11:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:11,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677279764] [2022-04-28 10:11:11,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:11,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:11,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {59857#(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); {59841#true} is VALID [2022-04-28 10:11:11,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {59841#true} assume true; {59841#true} is VALID [2022-04-28 10:11:11,971 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59841#true} {59841#true} #72#return; {59841#true} is VALID [2022-04-28 10:11:11,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {59841#true} call ULTIMATE.init(); {59857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:11,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {59857#(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); {59841#true} is VALID [2022-04-28 10:11:11,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {59841#true} assume true; {59841#true} is VALID [2022-04-28 10:11:11,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59841#true} {59841#true} #72#return; {59841#true} is VALID [2022-04-28 10:11:11,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {59841#true} call #t~ret13 := main(); {59841#true} is VALID [2022-04-28 10:11:11,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {59841#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59846#(= main_~y~0 0)} is VALID [2022-04-28 10:11:11,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {59846#(= 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; {59847#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:11,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {59847#(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; {59848#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:11,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {59848#(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; {59849#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:11,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {59849#(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; {59850#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:11,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {59850#(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; {59851#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:11,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {59851#(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; {59852#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:11,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {59852#(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; {59853#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:11,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {59853#(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; {59854#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:11,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {59854#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {59854#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:11,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {59854#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {59855#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:11,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {59855#(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; {59856#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:11,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {59856#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {59842#false} is VALID [2022-04-28 10:11:11,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:11,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:11,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:11,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:11,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:11,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:11,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:11,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:11,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {59842#false} assume !(~y~0 % 4294967296 > 0); {59842#false} is VALID [2022-04-28 10:11:11,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {59842#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {59842#false} is VALID [2022-04-28 10:11:11,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {59842#false} assume !(~x~0 % 4294967296 > 0); {59842#false} is VALID [2022-04-28 10:11:11,981 INFO L272 TraceCheckUtils]: 29: Hoare triple {59842#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {59842#false} is VALID [2022-04-28 10:11:11,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {59842#false} ~cond := #in~cond; {59842#false} is VALID [2022-04-28 10:11:11,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {59842#false} assume 0 == ~cond; {59842#false} is VALID [2022-04-28 10:11:11,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {59842#false} assume !false; {59842#false} is VALID [2022-04-28 10:11:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:11:11,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:11,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677279764] [2022-04-28 10:11:11,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677279764] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:11,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122285392] [2022-04-28 10:11:11,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:11,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:11,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:11,988 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:11,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-28 10:11:12,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:12,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:12,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:11:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:12,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:12,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {59841#true} call ULTIMATE.init(); {59841#true} is VALID [2022-04-28 10:11:12,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {59841#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); {59841#true} is VALID [2022-04-28 10:11:12,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {59841#true} assume true; {59841#true} is VALID [2022-04-28 10:11:12,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59841#true} {59841#true} #72#return; {59841#true} is VALID [2022-04-28 10:11:12,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {59841#true} call #t~ret13 := main(); {59841#true} is VALID [2022-04-28 10:11:12,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {59841#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59846#(= main_~y~0 0)} is VALID [2022-04-28 10:11:12,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {59846#(= 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; {59847#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:12,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {59847#(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; {59848#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:12,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {59848#(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; {59849#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:12,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {59849#(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; {59850#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:12,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {59850#(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; {59851#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:12,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {59851#(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; {59852#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:12,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {59852#(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; {59853#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:12,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {59853#(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; {59854#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:12,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {59854#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {59854#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:12,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {59854#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {59855#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:12,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {59855#(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; {59909#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:12,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {59909#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {59842#false} is VALID [2022-04-28 10:11:12,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {59842#false} assume !(~y~0 % 4294967296 > 0); {59842#false} is VALID [2022-04-28 10:11:12,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {59842#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {59842#false} is VALID [2022-04-28 10:11:12,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {59842#false} assume !(~x~0 % 4294967296 > 0); {59842#false} is VALID [2022-04-28 10:11:12,352 INFO L272 TraceCheckUtils]: 29: Hoare triple {59842#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {59842#false} is VALID [2022-04-28 10:11:12,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {59842#false} ~cond := #in~cond; {59842#false} is VALID [2022-04-28 10:11:12,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {59842#false} assume 0 == ~cond; {59842#false} is VALID [2022-04-28 10:11:12,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {59842#false} assume !false; {59842#false} is VALID [2022-04-28 10:11:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:11:12,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:12,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {59842#false} assume !false; {59842#false} is VALID [2022-04-28 10:11:12,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {59842#false} assume 0 == ~cond; {59842#false} is VALID [2022-04-28 10:11:12,627 INFO L290 TraceCheckUtils]: 30: Hoare triple {59842#false} ~cond := #in~cond; {59842#false} is VALID [2022-04-28 10:11:12,627 INFO L272 TraceCheckUtils]: 29: Hoare triple {59842#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {59842#false} is VALID [2022-04-28 10:11:12,627 INFO L290 TraceCheckUtils]: 28: Hoare triple {59842#false} assume !(~x~0 % 4294967296 > 0); {59842#false} is VALID [2022-04-28 10:11:12,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {59842#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {59842#false} is VALID [2022-04-28 10:11:12,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {59842#false} assume !(~y~0 % 4294967296 > 0); {59842#false} is VALID [2022-04-28 10:11:12,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {59842#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59842#false} is VALID [2022-04-28 10:11:12,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {60003#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {59842#false} is VALID [2022-04-28 10:11:12,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {60007#(< 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; {60003#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:12,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {60011#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {60007#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:12,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {60011#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {60011#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:12,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {60018#(< 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; {60011#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:12,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {60022#(< 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; {60018#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:12,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {60026#(< 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; {60022#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:12,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {60030#(< 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; {60026#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:12,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {60034#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60030#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:12,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {60038#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60034#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:12,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {60042#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60038#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:12,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {60046#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60042#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:12,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {59841#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {60046#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:12,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {59841#true} call #t~ret13 := main(); {59841#true} is VALID [2022-04-28 10:11:12,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59841#true} {59841#true} #72#return; {59841#true} is VALID [2022-04-28 10:11:12,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {59841#true} assume true; {59841#true} is VALID [2022-04-28 10:11:12,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {59841#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); {59841#true} is VALID [2022-04-28 10:11:12,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {59841#true} call ULTIMATE.init(); {59841#true} is VALID [2022-04-28 10:11:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:11:12,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122285392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:12,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:12,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:11:12,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:12,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [925531481] [2022-04-28 10:11:12,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [925531481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:12,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:12,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:11:12,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256956163] [2022-04-28 10:11:12,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:12,637 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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 33 [2022-04-28 10:11:12,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:12,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-28 10:11:12,654 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-28 10:11:12,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:11:12,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:12,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:11:12,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:11:12,655 INFO L87 Difference]: Start difference. First operand 300 states and 409 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-28 10:11:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:14,895 INFO L93 Difference]: Finished difference Result 383 states and 492 transitions. [2022-04-28 10:11:14,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:11:14,895 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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 33 [2022-04-28 10:11:14,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-28 10:11:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-28 10:11:14,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-28 10:11:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-28 10:11:14,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 68 transitions. [2022-04-28 10:11:14,956 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-28 10:11:14,961 INFO L225 Difference]: With dead ends: 383 [2022-04-28 10:11:14,961 INFO L226 Difference]: Without dead ends: 367 [2022-04-28 10:11:14,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:11:14,962 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 48 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:14,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 76 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:11:14,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-04-28 10:11:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 300. [2022-04-28 10:11:16,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:16,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 367 states. Second operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:16,041 INFO L74 IsIncluded]: Start isIncluded. First operand 367 states. Second operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:16,041 INFO L87 Difference]: Start difference. First operand 367 states. Second operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:16,046 INFO L93 Difference]: Finished difference Result 367 states and 476 transitions. [2022-04-28 10:11:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 476 transitions. [2022-04-28 10:11:16,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:16,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:16,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 3 states have call successors, (3), 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 367 states. [2022-04-28 10:11:16,046 INFO L87 Difference]: Start difference. First operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 3 states have call successors, (3), 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 367 states. [2022-04-28 10:11:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:16,051 INFO L93 Difference]: Finished difference Result 367 states and 476 transitions. [2022-04-28 10:11:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 476 transitions. [2022-04-28 10:11:16,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:16,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:16,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:16,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 408 transitions. [2022-04-28 10:11:16,056 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 408 transitions. Word has length 33 [2022-04-28 10:11:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:16,056 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 408 transitions. [2022-04-28 10:11:16,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-28 10:11:16,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 408 transitions. [2022-04-28 10:11:17,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 408 transitions. [2022-04-28 10:11:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:11:17,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:17,324 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:17,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:17,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-04-28 10:11:17,525 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:17,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:17,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1426067336, now seen corresponding path program 35 times [2022-04-28 10:11:17,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:17,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [360516989] [2022-04-28 10:11:17,527 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:17,527 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:17,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1426067336, now seen corresponding path program 36 times [2022-04-28 10:11:17,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:17,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298574612] [2022-04-28 10:11:17,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:17,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:17,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:17,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {62216#(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); {62191#true} is VALID [2022-04-28 10:11:17,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {62191#true} assume true; {62191#true} is VALID [2022-04-28 10:11:17,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62191#true} {62191#true} #72#return; {62191#true} is VALID [2022-04-28 10:11:17,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {62191#true} call ULTIMATE.init(); {62216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:17,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {62216#(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); {62191#true} is VALID [2022-04-28 10:11:17,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {62191#true} assume true; {62191#true} is VALID [2022-04-28 10:11:17,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62191#true} {62191#true} #72#return; {62191#true} is VALID [2022-04-28 10:11:17,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {62191#true} call #t~ret13 := main(); {62191#true} is VALID [2022-04-28 10:11:17,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {62191#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62196#(= main_~y~0 0)} is VALID [2022-04-28 10:11:17,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {62196#(= 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; {62197#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:17,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {62197#(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; {62198#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:17,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {62198#(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; {62199#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:17,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {62199#(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; {62200#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:17,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {62200#(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; {62201#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:17,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {62201#(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; {62202#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:17,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {62202#(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; {62203#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:17,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {62203#(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; {62204#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:17,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {62204#(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; {62205#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:17,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {62205#(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; {62206#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:17,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {62206#(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; {62207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:17,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {62207#(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; {62208#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:17,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {62208#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62209#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:17,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {62209#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62210#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:17,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {62210#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62211#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:17,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {62211#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62212#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:17,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {62212#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62213#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:17,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {62213#(and (<= main_~y~0 17) (<= 17 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; {62214#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:17,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {62214#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {62214#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:17,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {62214#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {62215#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID [2022-04-28 10:11:17,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {62215#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {62192#false} is VALID [2022-04-28 10:11:17,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {62192#false} assume !(~y~0 % 4294967296 > 0); {62192#false} is VALID [2022-04-28 10:11:17,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {62192#false} assume !(~x~0 % 4294967296 > 0); {62192#false} is VALID [2022-04-28 10:11:17,925 INFO L272 TraceCheckUtils]: 29: Hoare triple {62192#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {62192#false} is VALID [2022-04-28 10:11:17,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {62192#false} ~cond := #in~cond; {62192#false} is VALID [2022-04-28 10:11:17,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {62192#false} assume 0 == ~cond; {62192#false} is VALID [2022-04-28 10:11:17,925 INFO L290 TraceCheckUtils]: 32: Hoare triple {62192#false} assume !false; {62192#false} is VALID [2022-04-28 10:11:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:17,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298574612] [2022-04-28 10:11:17,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298574612] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:17,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920821632] [2022-04-28 10:11:17,925 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:17,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:17,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:17,926 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:17,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-28 10:11:18,295 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 10:11:18,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:18,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:11:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:18,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:18,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {62191#true} call ULTIMATE.init(); {62191#true} is VALID [2022-04-28 10:11:18,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {62191#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); {62191#true} is VALID [2022-04-28 10:11:18,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {62191#true} assume true; {62191#true} is VALID [2022-04-28 10:11:18,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62191#true} {62191#true} #72#return; {62191#true} is VALID [2022-04-28 10:11:18,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {62191#true} call #t~ret13 := main(); {62191#true} is VALID [2022-04-28 10:11:18,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {62191#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62196#(= main_~y~0 0)} is VALID [2022-04-28 10:11:18,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {62196#(= 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; {62197#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:18,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {62197#(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; {62198#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:18,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {62198#(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; {62199#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:18,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {62199#(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; {62200#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:18,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {62200#(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; {62201#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:18,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {62201#(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; {62202#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:18,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {62202#(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; {62203#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:18,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {62203#(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; {62204#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:18,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {62204#(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; {62205#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:18,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {62205#(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; {62206#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:18,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {62206#(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; {62207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:18,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {62207#(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; {62208#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:18,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {62208#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62209#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:18,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {62209#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62210#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:18,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {62210#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62211#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:18,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {62211#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62212#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:18,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {62212#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62213#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:18,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {62213#(and (<= main_~y~0 17) (<= 17 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; {62214#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:18,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {62214#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {62214#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:18,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {62214#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {62295#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:11:18,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {62295#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 > 0); {62192#false} is VALID [2022-04-28 10:11:18,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {62192#false} assume !(~y~0 % 4294967296 > 0); {62192#false} is VALID [2022-04-28 10:11:18,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {62192#false} assume !(~x~0 % 4294967296 > 0); {62192#false} is VALID [2022-04-28 10:11:18,617 INFO L272 TraceCheckUtils]: 29: Hoare triple {62192#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {62192#false} is VALID [2022-04-28 10:11:18,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {62192#false} ~cond := #in~cond; {62192#false} is VALID [2022-04-28 10:11:18,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {62192#false} assume 0 == ~cond; {62192#false} is VALID [2022-04-28 10:11:18,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {62192#false} assume !false; {62192#false} is VALID [2022-04-28 10:11:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:18,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:19,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {62192#false} assume !false; {62192#false} is VALID [2022-04-28 10:11:19,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {62192#false} assume 0 == ~cond; {62192#false} is VALID [2022-04-28 10:11:19,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {62192#false} ~cond := #in~cond; {62192#false} is VALID [2022-04-28 10:11:19,332 INFO L272 TraceCheckUtils]: 29: Hoare triple {62192#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {62192#false} is VALID [2022-04-28 10:11:19,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {62192#false} assume !(~x~0 % 4294967296 > 0); {62192#false} is VALID [2022-04-28 10:11:19,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {62192#false} assume !(~y~0 % 4294967296 > 0); {62192#false} is VALID [2022-04-28 10:11:19,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {62335#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {62192#false} is VALID [2022-04-28 10:11:19,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {62339#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {62335#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:19,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {62339#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {62339#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:19,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {62346#(< 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; {62339#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:19,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {62350#(< 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; {62346#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:19,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {62354#(< 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; {62350#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:19,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {62358#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62354#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:19,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {62362#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62358#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:19,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {62366#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62362#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:19,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {62370#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62366#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:19,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {62374#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62370#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:19,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {62378#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62374#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:19,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {62382#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62378#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:19,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {62386#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62382#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:19,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {62390#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62386#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:11:19,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {62394#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62390#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:11:19,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {62398#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62394#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:11:19,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {62402#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62398#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:11:19,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {62406#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62402#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:11:19,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {62410#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62406#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:11:19,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {62414#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62410#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:11:19,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {62191#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62414#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:11:19,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {62191#true} call #t~ret13 := main(); {62191#true} is VALID [2022-04-28 10:11:19,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62191#true} {62191#true} #72#return; {62191#true} is VALID [2022-04-28 10:11:19,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {62191#true} assume true; {62191#true} is VALID [2022-04-28 10:11:19,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {62191#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); {62191#true} is VALID [2022-04-28 10:11:19,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {62191#true} call ULTIMATE.init(); {62191#true} is VALID [2022-04-28 10:11:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:19,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920821632] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:19,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:19,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:11:19,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:19,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [360516989] [2022-04-28 10:11:19,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [360516989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:19,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:19,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:11:19,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050264831] [2022-04-28 10:11:19,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:19,347 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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 33 [2022-04-28 10:11:19,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:19,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:11:19,367 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-28 10:11:19,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:11:19,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:19,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:11:19,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:11:19,368 INFO L87 Difference]: Start difference. First operand 300 states and 408 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:11:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:24,253 INFO L93 Difference]: Finished difference Result 481 states and 740 transitions. [2022-04-28 10:11:24,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:11:24,253 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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 33 [2022-04-28 10:11:24,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:11:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 145 transitions. [2022-04-28 10:11:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:11:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 145 transitions. [2022-04-28 10:11:24,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 145 transitions. [2022-04-28 10:11:24,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:24,380 INFO L225 Difference]: With dead ends: 481 [2022-04-28 10:11:24,380 INFO L226 Difference]: Without dead ends: 456 [2022-04-28 10:11:24,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=910, Invalid=3122, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:11:24,381 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 130 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1980 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:24,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 155 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1980 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 10:11:24,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-04-28 10:11:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 317. [2022-04-28 10:11:25,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:25,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 456 states. Second operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:25,489 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:25,489 INFO L87 Difference]: Start difference. First operand 456 states. Second operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:25,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:25,495 INFO L93 Difference]: Finished difference Result 456 states and 573 transitions. [2022-04-28 10:11:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 573 transitions. [2022-04-28 10:11:25,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:25,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:25,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 3 states have call successors, (3), 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 456 states. [2022-04-28 10:11:25,496 INFO L87 Difference]: Start difference. First operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 3 states have call successors, (3), 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 456 states. [2022-04-28 10:11:25,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:25,503 INFO L93 Difference]: Finished difference Result 456 states and 573 transitions. [2022-04-28 10:11:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 573 transitions. [2022-04-28 10:11:25,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:25,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:25,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:25,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 433 transitions. [2022-04-28 10:11:25,508 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 433 transitions. Word has length 33 [2022-04-28 10:11:25,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:25,508 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 433 transitions. [2022-04-28 10:11:25,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:11:25,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 317 states and 433 transitions. [2022-04-28 10:11:27,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 433 transitions. [2022-04-28 10:11:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:11:27,087 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:27,087 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:27,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-04-28 10:11:27,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-04-28 10:11:27,288 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:27,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:27,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1901015744, now seen corresponding path program 21 times [2022-04-28 10:11:27,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:27,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [94628524] [2022-04-28 10:11:27,290 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:27,290 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:27,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1901015744, now seen corresponding path program 22 times [2022-04-28 10:11:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:27,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385267237] [2022-04-28 10:11:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:27,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:27,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:27,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {65002#(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); {64983#true} is VALID [2022-04-28 10:11:27,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {64983#true} assume true; {64983#true} is VALID [2022-04-28 10:11:27,546 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64983#true} {64983#true} #72#return; {64983#true} is VALID [2022-04-28 10:11:27,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {64983#true} call ULTIMATE.init(); {65002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:27,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {65002#(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); {64983#true} is VALID [2022-04-28 10:11:27,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {64983#true} assume true; {64983#true} is VALID [2022-04-28 10:11:27,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64983#true} {64983#true} #72#return; {64983#true} is VALID [2022-04-28 10:11:27,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {64983#true} call #t~ret13 := main(); {64983#true} is VALID [2022-04-28 10:11:27,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {64983#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64988#(= main_~y~0 0)} is VALID [2022-04-28 10:11:27,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {64988#(= 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; {64989#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:27,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {64989#(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; {64990#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:27,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {64990#(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; {64991#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:27,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {64991#(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; {64992#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:27,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {64992#(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; {64993#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:27,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {64993#(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; {64994#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:27,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {64994#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {64994#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:27,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {64994#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {64995#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:27,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {64995#(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; {64996#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:27,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {64996#(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; {64997#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:27,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {64997#(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; {64998#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:11:27,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {64998#(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; {64999#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:11:27,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {64999#(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; {65000#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:11:27,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {65000#(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; {65001#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:11:27,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {65001#(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; {64984#false} is VALID [2022-04-28 10:11:27,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {64984#false} assume !(~z~0 % 4294967296 > 0); {64984#false} is VALID [2022-04-28 10:11:27,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {64984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64984#false} is VALID [2022-04-28 10:11:27,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {64984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64984#false} is VALID [2022-04-28 10:11:27,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {64984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64984#false} is VALID [2022-04-28 10:11:27,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {64984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64984#false} is VALID [2022-04-28 10:11:27,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {64984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64984#false} is VALID [2022-04-28 10:11:27,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {64984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64984#false} is VALID [2022-04-28 10:11:27,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {64984#false} assume !(~y~0 % 4294967296 > 0); {64984#false} is VALID [2022-04-28 10:11:27,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {64984#false} assume !(~x~0 % 4294967296 > 0); {64984#false} is VALID [2022-04-28 10:11:27,558 INFO L272 TraceCheckUtils]: 30: Hoare triple {64984#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {64984#false} is VALID [2022-04-28 10:11:27,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {64984#false} ~cond := #in~cond; {64984#false} is VALID [2022-04-28 10:11:27,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {64984#false} assume 0 == ~cond; {64984#false} is VALID [2022-04-28 10:11:27,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {64984#false} assume !false; {64984#false} is VALID [2022-04-28 10:11:27,558 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:11:27,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:27,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385267237] [2022-04-28 10:11:27,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385267237] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:27,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059778815] [2022-04-28 10:11:27,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:27,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:27,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:27,560 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:27,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-28 10:11:27,607 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:27,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:27,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 10:11:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:27,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:27,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {64983#true} call ULTIMATE.init(); {64983#true} is VALID [2022-04-28 10:11:27,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {64983#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); {64983#true} is VALID [2022-04-28 10:11:27,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {64983#true} assume true; {64983#true} is VALID [2022-04-28 10:11:27,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64983#true} {64983#true} #72#return; {64983#true} is VALID [2022-04-28 10:11:27,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {64983#true} call #t~ret13 := main(); {64983#true} is VALID [2022-04-28 10:11:27,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {64983#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64988#(= main_~y~0 0)} is VALID [2022-04-28 10:11:27,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {64988#(= 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; {64989#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:27,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {64989#(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; {64990#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:27,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {64990#(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; {64991#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:27,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {64991#(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; {64992#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:27,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {64992#(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; {64993#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:27,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {64993#(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; {64994#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:27,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {64994#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {64994#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:27,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {64994#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {65045#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:27,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {65045#(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; {65049#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:11:27,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {65049#(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; {65053#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:27,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {65053#(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; {65057#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:11:27,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {65057#(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; {65061#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:27,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {65061#(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; {65065#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:27,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {65065#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65069#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:27,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {65069#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64984#false} is VALID [2022-04-28 10:11:27,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {64984#false} assume !(~z~0 % 4294967296 > 0); {64984#false} is VALID [2022-04-28 10:11:27,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {64984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64984#false} is VALID [2022-04-28 10:11:27,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {64984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64984#false} is VALID [2022-04-28 10:11:27,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {64984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64984#false} is VALID [2022-04-28 10:11:27,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {64984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64984#false} is VALID [2022-04-28 10:11:27,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {64984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64984#false} is VALID [2022-04-28 10:11:27,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {64984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64984#false} is VALID [2022-04-28 10:11:27,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {64984#false} assume !(~y~0 % 4294967296 > 0); {64984#false} is VALID [2022-04-28 10:11:27,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {64984#false} assume !(~x~0 % 4294967296 > 0); {64984#false} is VALID [2022-04-28 10:11:27,982 INFO L272 TraceCheckUtils]: 30: Hoare triple {64984#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {64984#false} is VALID [2022-04-28 10:11:27,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {64984#false} ~cond := #in~cond; {64984#false} is VALID [2022-04-28 10:11:27,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {64984#false} assume 0 == ~cond; {64984#false} is VALID [2022-04-28 10:11:27,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {64984#false} assume !false; {64984#false} is VALID [2022-04-28 10:11:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:11:27,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:28,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {64984#false} assume !false; {64984#false} is VALID [2022-04-28 10:11:28,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {64984#false} assume 0 == ~cond; {64984#false} is VALID [2022-04-28 10:11:28,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {64984#false} ~cond := #in~cond; {64984#false} is VALID [2022-04-28 10:11:28,497 INFO L272 TraceCheckUtils]: 30: Hoare triple {64984#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {64984#false} is VALID [2022-04-28 10:11:28,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {64984#false} assume !(~x~0 % 4294967296 > 0); {64984#false} is VALID [2022-04-28 10:11:28,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {65127#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {64984#false} is VALID [2022-04-28 10:11:28,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {65131#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65127#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:28,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {65135#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65131#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:28,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {65139#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65135#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:28,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {65143#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65139#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:28,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {65147#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65143#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:28,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {65151#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65147#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:28,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {65151#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {65151#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:28,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {65158#(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; {65151#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:28,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {65162#(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; {65158#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:28,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {65166#(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; {65162#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:28,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {65170#(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; {65166#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:28,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {65174#(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; {65170#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:28,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {65178#(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; {65174#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:28,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {65182#(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; {65178#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:11:28,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {64983#true} ~z~0 := ~y~0; {65182#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:11:28,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {64983#true} assume !(~x~0 % 4294967296 > 0); {64983#true} is VALID [2022-04-28 10:11:28,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {64983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64983#true} is VALID [2022-04-28 10:11:28,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {64983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64983#true} is VALID [2022-04-28 10:11:28,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {64983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64983#true} is VALID [2022-04-28 10:11:28,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {64983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64983#true} is VALID [2022-04-28 10:11:28,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {64983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64983#true} is VALID [2022-04-28 10:11:28,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {64983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64983#true} is VALID [2022-04-28 10:11:28,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {64983#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64983#true} is VALID [2022-04-28 10:11:28,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {64983#true} call #t~ret13 := main(); {64983#true} is VALID [2022-04-28 10:11:28,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64983#true} {64983#true} #72#return; {64983#true} is VALID [2022-04-28 10:11:28,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {64983#true} assume true; {64983#true} is VALID [2022-04-28 10:11:28,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {64983#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); {64983#true} is VALID [2022-04-28 10:11:28,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {64983#true} call ULTIMATE.init(); {64983#true} is VALID [2022-04-28 10:11:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:11:28,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059778815] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:28,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:28,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 38 [2022-04-28 10:11:28,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:28,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [94628524] [2022-04-28 10:11:28,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [94628524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:28,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:28,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:11:28,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132120404] [2022-04-28 10:11:28,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:28,512 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 34 [2022-04-28 10:11:28,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:28,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:11:28,532 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-28 10:11:28,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:11:28,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:28,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:11:28,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:11:28,532 INFO L87 Difference]: Start difference. First operand 317 states and 433 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:11:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:31,311 INFO L93 Difference]: Finished difference Result 377 states and 494 transitions. [2022-04-28 10:11:31,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 10:11:31,311 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 34 [2022-04-28 10:11:31,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:11:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 74 transitions. [2022-04-28 10:11:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:11:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 74 transitions. [2022-04-28 10:11:31,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 74 transitions. [2022-04-28 10:11:31,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:31,376 INFO L225 Difference]: With dead ends: 377 [2022-04-28 10:11:31,377 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 10:11:31,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=748, Invalid=3808, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 10:11:31,377 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:31,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 87 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:11:31,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 10:11:32,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 316. [2022-04-28 10:11:32,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:32,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:32,497 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:32,497 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:32,501 INFO L93 Difference]: Finished difference Result 339 states and 452 transitions. [2022-04-28 10:11:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 452 transitions. [2022-04-28 10:11:32,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:32,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:32,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 3 states have call successors, (3), 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 339 states. [2022-04-28 10:11:32,502 INFO L87 Difference]: Start difference. First operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 3 states have call successors, (3), 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 339 states. [2022-04-28 10:11:32,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:32,506 INFO L93 Difference]: Finished difference Result 339 states and 452 transitions. [2022-04-28 10:11:32,506 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 452 transitions. [2022-04-28 10:11:32,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:32,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:32,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:32,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:32,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 428 transitions. [2022-04-28 10:11:32,511 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 428 transitions. Word has length 34 [2022-04-28 10:11:32,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:32,511 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 428 transitions. [2022-04-28 10:11:32,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:11:32,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 316 states and 428 transitions. [2022-04-28 10:11:34,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 428 transitions. [2022-04-28 10:11:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:11:34,005 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:34,005 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:34,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:34,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:34,205 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:34,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:34,206 INFO L85 PathProgramCache]: Analyzing trace with hash -221709503, now seen corresponding path program 37 times [2022-04-28 10:11:34,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:34,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1535669089] [2022-04-28 10:11:34,208 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:34,208 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:34,208 INFO L85 PathProgramCache]: Analyzing trace with hash -221709503, now seen corresponding path program 38 times [2022-04-28 10:11:34,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:34,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104124886] [2022-04-28 10:11:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:34,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:34,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:34,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {67377#(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); {67351#true} is VALID [2022-04-28 10:11:34,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {67351#true} assume true; {67351#true} is VALID [2022-04-28 10:11:34,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67351#true} {67351#true} #72#return; {67351#true} is VALID [2022-04-28 10:11:34,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {67351#true} call ULTIMATE.init(); {67377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:34,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {67377#(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); {67351#true} is VALID [2022-04-28 10:11:34,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {67351#true} assume true; {67351#true} is VALID [2022-04-28 10:11:34,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67351#true} {67351#true} #72#return; {67351#true} is VALID [2022-04-28 10:11:34,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {67351#true} call #t~ret13 := main(); {67351#true} is VALID [2022-04-28 10:11:34,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {67351#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67356#(= main_~y~0 0)} is VALID [2022-04-28 10:11:34,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {67356#(= 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; {67357#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:34,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {67357#(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; {67358#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:34,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {67358#(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; {67359#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:34,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {67359#(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; {67360#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:34,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {67360#(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; {67361#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:34,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {67361#(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; {67362#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:34,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {67362#(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; {67363#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:34,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {67363#(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; {67364#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:34,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {67364#(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; {67365#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:34,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {67365#(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; {67366#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:34,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {67366#(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; {67367#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:34,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {67367#(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; {67368#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:34,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {67368#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67369#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:34,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {67369#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67370#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:34,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {67370#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67371#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:34,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {67371#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67372#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:34,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {67372#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67373#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:34,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {67373#(and (<= main_~y~0 17) (<= 17 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; {67374#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:34,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {67374#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67375#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:11:34,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {67375#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {67375#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:11:34,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {67375#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {67376#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:34,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {67376#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {67352#false} is VALID [2022-04-28 10:11:34,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {67352#false} assume !(~y~0 % 4294967296 > 0); {67352#false} is VALID [2022-04-28 10:11:34,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {67352#false} assume !(~x~0 % 4294967296 > 0); {67352#false} is VALID [2022-04-28 10:11:34,684 INFO L272 TraceCheckUtils]: 30: Hoare triple {67352#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {67352#false} is VALID [2022-04-28 10:11:34,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {67352#false} ~cond := #in~cond; {67352#false} is VALID [2022-04-28 10:11:34,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {67352#false} assume 0 == ~cond; {67352#false} is VALID [2022-04-28 10:11:34,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {67352#false} assume !false; {67352#false} is VALID [2022-04-28 10:11:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:34,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:34,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104124886] [2022-04-28 10:11:34,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104124886] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:34,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71041417] [2022-04-28 10:11:34,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:34,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:34,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:34,686 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:34,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-28 10:11:34,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:34,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:34,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:11:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:34,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:35,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {67351#true} call ULTIMATE.init(); {67351#true} is VALID [2022-04-28 10:11:35,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {67351#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); {67351#true} is VALID [2022-04-28 10:11:35,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {67351#true} assume true; {67351#true} is VALID [2022-04-28 10:11:35,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67351#true} {67351#true} #72#return; {67351#true} is VALID [2022-04-28 10:11:35,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {67351#true} call #t~ret13 := main(); {67351#true} is VALID [2022-04-28 10:11:35,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {67351#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67356#(= main_~y~0 0)} is VALID [2022-04-28 10:11:35,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {67356#(= 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; {67357#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:35,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {67357#(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; {67358#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:35,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {67358#(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; {67359#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:35,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {67359#(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; {67360#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:35,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {67360#(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; {67361#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:35,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {67361#(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; {67362#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:35,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {67362#(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; {67363#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:35,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {67363#(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; {67364#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:35,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {67364#(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; {67365#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:35,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {67365#(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; {67366#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:35,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {67366#(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; {67367#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:35,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {67367#(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; {67368#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:35,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {67368#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67369#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:35,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {67369#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67370#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:35,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {67370#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67371#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:35,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {67371#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67372#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:35,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {67372#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67373#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:35,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {67373#(and (<= main_~y~0 17) (<= 17 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; {67374#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:35,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {67374#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67375#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:11:35,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {67375#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {67375#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:11:35,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {67375#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {67459#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-28 10:11:35,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {67459#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !(~z~0 % 4294967296 > 0); {67352#false} is VALID [2022-04-28 10:11:35,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {67352#false} assume !(~y~0 % 4294967296 > 0); {67352#false} is VALID [2022-04-28 10:11:35,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {67352#false} assume !(~x~0 % 4294967296 > 0); {67352#false} is VALID [2022-04-28 10:11:35,077 INFO L272 TraceCheckUtils]: 30: Hoare triple {67352#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {67352#false} is VALID [2022-04-28 10:11:35,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {67352#false} ~cond := #in~cond; {67352#false} is VALID [2022-04-28 10:11:35,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {67352#false} assume 0 == ~cond; {67352#false} is VALID [2022-04-28 10:11:35,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {67352#false} assume !false; {67352#false} is VALID [2022-04-28 10:11:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:35,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:35,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {67352#false} assume !false; {67352#false} is VALID [2022-04-28 10:11:35,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {67352#false} assume 0 == ~cond; {67352#false} is VALID [2022-04-28 10:11:35,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {67352#false} ~cond := #in~cond; {67352#false} is VALID [2022-04-28 10:11:35,844 INFO L272 TraceCheckUtils]: 30: Hoare triple {67352#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {67352#false} is VALID [2022-04-28 10:11:35,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {67352#false} assume !(~x~0 % 4294967296 > 0); {67352#false} is VALID [2022-04-28 10:11:35,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {67352#false} assume !(~y~0 % 4294967296 > 0); {67352#false} is VALID [2022-04-28 10:11:35,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {67499#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {67352#false} is VALID [2022-04-28 10:11:35,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {67503#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {67499#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:35,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {67503#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {67503#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:35,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {67510#(< 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; {67503#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:35,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {67514#(< 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; {67510#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:35,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {67518#(< 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; {67514#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:35,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {67522#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67518#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:35,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {67526#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67522#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:35,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {67530#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67526#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:35,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {67534#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67530#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:35,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {67538#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67534#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:35,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {67542#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67538#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:35,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {67546#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67542#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:35,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {67550#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67546#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:35,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {67554#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67550#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:11:35,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {67558#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67554#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:11:35,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {67562#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67558#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:11:35,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {67566#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67562#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:11:35,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {67570#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67566#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:11:35,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {67574#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67570#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:11:35,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {67578#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67574#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:11:35,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {67582#(< 0 (mod (+ 19 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; {67578#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:11:35,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {67351#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67582#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:35,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {67351#true} call #t~ret13 := main(); {67351#true} is VALID [2022-04-28 10:11:35,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67351#true} {67351#true} #72#return; {67351#true} is VALID [2022-04-28 10:11:35,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {67351#true} assume true; {67351#true} is VALID [2022-04-28 10:11:35,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {67351#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); {67351#true} is VALID [2022-04-28 10:11:35,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {67351#true} call ULTIMATE.init(); {67351#true} is VALID [2022-04-28 10:11:35,859 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:35,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71041417] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:35,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:35,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:11:35,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:35,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1535669089] [2022-04-28 10:11:35,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1535669089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:35,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:35,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:11:35,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178469510] [2022-04-28 10:11:35,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:35,860 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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 34 [2022-04-28 10:11:35,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:35,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-28 10:11:35,881 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-28 10:11:35,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:11:35,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:35,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:11:35,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1579, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:11:35,882 INFO L87 Difference]: Start difference. First operand 316 states and 428 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-28 10:11:41,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:41,177 INFO L93 Difference]: Finished difference Result 504 states and 774 transitions. [2022-04-28 10:11:41,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:11:41,177 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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 34 [2022-04-28 10:11:41,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:41,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-28 10:11:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 152 transitions. [2022-04-28 10:11:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-28 10:11:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 152 transitions. [2022-04-28 10:11:41,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 152 transitions. [2022-04-28 10:11:41,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:41,315 INFO L225 Difference]: With dead ends: 504 [2022-04-28 10:11:41,315 INFO L226 Difference]: Without dead ends: 479 [2022-04-28 10:11:41,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=997, Invalid=3425, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:11:41,316 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 138 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2204 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:41,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 163 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2204 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 10:11:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-04-28 10:11:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 333. [2022-04-28 10:11:42,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:42,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 479 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:42,496 INFO L74 IsIncluded]: Start isIncluded. First operand 479 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:42,496 INFO L87 Difference]: Start difference. First operand 479 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:42,504 INFO L93 Difference]: Finished difference Result 479 states and 600 transitions. [2022-04-28 10:11:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 600 transitions. [2022-04-28 10:11:42,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:42,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:42,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 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 479 states. [2022-04-28 10:11:42,504 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 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 479 states. [2022-04-28 10:11:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:42,512 INFO L93 Difference]: Finished difference Result 479 states and 600 transitions. [2022-04-28 10:11:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 600 transitions. [2022-04-28 10:11:42,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:42,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:42,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:42,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 453 transitions. [2022-04-28 10:11:42,518 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 453 transitions. Word has length 34 [2022-04-28 10:11:42,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:42,518 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 453 transitions. [2022-04-28 10:11:42,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-28 10:11:42,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 453 transitions. [2022-04-28 10:11:44,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 453 transitions. [2022-04-28 10:11:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:11:44,208 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:44,208 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:44,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:44,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-04-28 10:11:44,423 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:44,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:44,424 INFO L85 PathProgramCache]: Analyzing trace with hash 144704712, now seen corresponding path program 45 times [2022-04-28 10:11:44,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:44,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [842155301] [2022-04-28 10:11:44,426 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:44,426 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash 144704712, now seen corresponding path program 46 times [2022-04-28 10:11:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:44,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550630404] [2022-04-28 10:11:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:44,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:44,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {70303#(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); {70277#true} is VALID [2022-04-28 10:11:44,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {70277#true} assume true; {70277#true} is VALID [2022-04-28 10:11:44,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70277#true} {70277#true} #72#return; {70277#true} is VALID [2022-04-28 10:11:44,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {70277#true} call ULTIMATE.init(); {70303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:44,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {70303#(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); {70277#true} is VALID [2022-04-28 10:11:44,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {70277#true} assume true; {70277#true} is VALID [2022-04-28 10:11:44,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70277#true} {70277#true} #72#return; {70277#true} is VALID [2022-04-28 10:11:44,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {70277#true} call #t~ret13 := main(); {70277#true} is VALID [2022-04-28 10:11:44,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {70277#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70282#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:11:44,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {70282#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70283#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)))} is VALID [2022-04-28 10:11:44,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {70283#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~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; {70284#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 2)))} is VALID [2022-04-28 10:11:44,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {70284#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) 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; {70285#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} is VALID [2022-04-28 10:11:44,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {70285#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70286#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 4)) (<= (+ (* main_~x~0 2) main_~y~0 4) (* main_~n~0 2)))} is VALID [2022-04-28 10:11:44,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {70286#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 4)) (<= (+ (* main_~x~0 2) main_~y~0 4) (* main_~n~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; {70287#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) 5 main_~y~0)) (<= (+ (* main_~x~0 2) 5 main_~y~0) (* main_~n~0 2)))} is VALID [2022-04-28 10:11:44,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {70287#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) 5 main_~y~0)) (<= (+ (* main_~x~0 2) 5 main_~y~0) (* main_~n~0 2)))} assume !(~x~0 % 4294967296 > 0); {70288#(and (<= (+ 5 main_~y~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ 5 main_~y~0 (* 8589934592 (div main_~x~0 4294967296)))))} is VALID [2022-04-28 10:11:44,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {70288#(and (<= (+ 5 main_~y~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ 5 main_~y~0 (* 8589934592 (div main_~x~0 4294967296)))))} ~z~0 := ~y~0; {70289#(and (<= (* main_~n~0 2) (+ 5 main_~z~0 (* 8589934592 (div main_~x~0 4294967296)))) (<= (+ 5 main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)))} is VALID [2022-04-28 10:11:44,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {70289#(and (<= (* main_~n~0 2) (+ 5 main_~z~0 (* 8589934592 (div main_~x~0 4294967296)))) (<= (+ 5 main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~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; {70290#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:44,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {70290#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 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; {70291#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:44,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {70291#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 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; {70292#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 10:11:44,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {70292#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 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; {70293#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0 9))} is VALID [2022-04-28 10:11:44,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {70293#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) 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; {70294#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} is VALID [2022-04-28 10:11:44,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {70294#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} assume !(~z~0 % 4294967296 > 0); {70294#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} is VALID [2022-04-28 10:11:44,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {70294#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70293#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0 9))} is VALID [2022-04-28 10:11:44,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {70293#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70292#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 10:11:44,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {70292#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70291#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:44,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {70291#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70290#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:44,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {70290#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70295#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 10:11:44,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {70295#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {70295#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 10:11:44,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {70295#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {70296#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} is VALID [2022-04-28 10:11:44,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {70296#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {70297#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:44,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {70297#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {70298#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} is VALID [2022-04-28 10:11:44,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {70298#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {70299#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} is VALID [2022-04-28 10:11:44,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {70299#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {70300#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:44,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {70300#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {70300#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:44,935 INFO L272 TraceCheckUtils]: 31: Hoare triple {70300#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {70301#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:11:44,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {70301#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {70302#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:11:44,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {70302#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {70278#false} is VALID [2022-04-28 10:11:44,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {70278#false} assume !false; {70278#false} is VALID [2022-04-28 10:11:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:44,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:44,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550630404] [2022-04-28 10:11:44,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550630404] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:44,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412212364] [2022-04-28 10:11:44,936 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:44,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:44,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:44,937 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:44,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-28 10:11:45,218 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:45,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:45,220 WARN L261 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 81 conjunts are in the unsatisfiable core [2022-04-28 10:11:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:45,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:46,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {70277#true} call ULTIMATE.init(); {70277#true} is VALID [2022-04-28 10:11:46,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {70277#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); {70277#true} is VALID [2022-04-28 10:11:46,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {70277#true} assume true; {70277#true} is VALID [2022-04-28 10:11:46,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70277#true} {70277#true} #72#return; {70277#true} is VALID [2022-04-28 10:11:46,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {70277#true} call #t~ret13 := main(); {70277#true} is VALID [2022-04-28 10:11:46,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {70277#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70282#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:11:46,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {70282#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70325#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= main_~y~0 1))} is VALID [2022-04-28 10:11:46,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {70325#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70329#(and (= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 10:11:46,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {70329#(and (= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0) (= (+ (- 1) 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; {70333#(and (= main_~y~0 3) (= (+ main_~x~0 3 (* (- 1) main_~n~0)) 0))} is VALID [2022-04-28 10:11:46,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {70333#(and (= main_~y~0 3) (= (+ main_~x~0 3 (* (- 1) main_~n~0)) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70337#(and (= (+ main_~x~0 4 (* (- 1) main_~n~0)) 0) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:11:46,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {70337#(and (= (+ main_~x~0 4 (* (- 1) main_~n~0)) 0) (= 3 (+ (- 1) 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; {70341#(and (= (+ 5 main_~x~0 (* (- 1) main_~n~0)) 0) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 10:11:46,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {70341#(and (= (+ 5 main_~x~0 (* (- 1) main_~n~0)) 0) (= (+ (- 2) main_~y~0) 3))} assume !(~x~0 % 4294967296 > 0); {70345#(and (= (+ 5 main_~x~0 (* (- 1) main_~n~0)) 0) (= (+ (- 2) main_~y~0) 3) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:46,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {70345#(and (= (+ 5 main_~x~0 (* (- 1) main_~n~0)) 0) (= (+ (- 2) main_~y~0) 3) (not (< 0 (mod main_~x~0 4294967296))))} ~z~0 := ~y~0; {70349#(and (= (+ 5 main_~x~0 (* (- 1) main_~n~0)) 0) (= 3 (+ (- 2) main_~z~0)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:46,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {70349#(and (= (+ 5 main_~x~0 (* (- 1) main_~n~0)) 0) (= 3 (+ (- 2) main_~z~0)) (not (< 0 (mod main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70353#(and (= (+ main_~x~0 4 (* (- 1) main_~n~0)) 0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= 3 (+ (- 1) main_~z~0)))} is VALID [2022-04-28 10:11:46,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {70353#(and (= (+ main_~x~0 4 (* (- 1) main_~n~0)) 0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= 3 (+ (- 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; {70357#(and (= (+ main_~z~0 1) 4) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (= (+ main_~x~0 3 (* (- 1) main_~n~0)) 0))} is VALID [2022-04-28 10:11:46,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {70357#(and (= (+ main_~z~0 1) 4) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (= (+ main_~x~0 3 (* (- 1) main_~n~0)) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70361#(and (= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (= (+ main_~z~0 2) 4))} is VALID [2022-04-28 10:11:46,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {70361#(and (= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (= (+ main_~z~0 2) 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; {70365#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= 2 (+ main_~z~0 1)) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))))} is VALID [2022-04-28 10:11:46,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {70365#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= 2 (+ main_~z~0 1)) (not (< 0 (mod (+ 4294967292 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; {70369#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= (+ main_~z~0 1) 1))} is VALID [2022-04-28 10:11:46,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {70369#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= (+ main_~z~0 1) 1))} assume !(~z~0 % 4294967296 > 0); {70369#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= (+ main_~z~0 1) 1))} is VALID [2022-04-28 10:11:46,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {70369#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= (+ main_~z~0 1) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70376#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= main_~z~0 1))} is VALID [2022-04-28 10:11:46,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {70376#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70380#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= main_~z~0 2))} is VALID [2022-04-28 10:11:46,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {70380#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70384#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= main_~z~0 3))} is VALID [2022-04-28 10:11:46,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {70384#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70388#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= 3 (+ (- 1) main_~z~0)))} is VALID [2022-04-28 10:11:46,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {70388#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= 3 (+ (- 1) main_~z~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70392#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= 5 main_~z~0))} is VALID [2022-04-28 10:11:46,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {70392#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= 5 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {70392#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= 5 main_~z~0))} is VALID [2022-04-28 10:11:46,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {70392#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= 5 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {70399#(and (= (+ main_~x~0 1) main_~n~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= main_~z~0 6))} is VALID [2022-04-28 10:11:46,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {70399#(and (= (+ main_~x~0 1) main_~n~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= main_~z~0 6))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {70403#(and (= 7 main_~z~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:11:46,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {70403#(and (= 7 main_~z~0) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {70407#(and (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)) (= 7 (+ (- 1) main_~z~0)))} is VALID [2022-04-28 10:11:46,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {70407#(and (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)) (= 7 (+ (- 1) main_~z~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {70411#(and (= (+ main_~x~0 3) (+ (- 1) main_~n~0)) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= main_~z~0 9))} is VALID [2022-04-28 10:11:46,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {70411#(and (= (+ main_~x~0 3) (+ (- 1) main_~n~0)) (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= main_~z~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {70415#(and (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= 9 (+ (- 1) main_~z~0)) (= (+ main_~x~0 4) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:11:46,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {70415#(and (not (< 0 (mod (+ 4294967291 main_~n~0) 4294967296))) (= 9 (+ (- 1) main_~z~0)) (= (+ main_~x~0 4) (+ (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {70419#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= main_~z~0 10))} is VALID [2022-04-28 10:11:46,644 INFO L272 TraceCheckUtils]: 31: Hoare triple {70419#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= main_~z~0 10))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {70423#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:11:46,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {70423#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {70427#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:11:46,644 INFO L290 TraceCheckUtils]: 33: Hoare triple {70427#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {70278#false} is VALID [2022-04-28 10:11:46,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {70278#false} assume !false; {70278#false} is VALID [2022-04-28 10:11:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:46,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:48,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {70278#false} assume !false; {70278#false} is VALID [2022-04-28 10:11:48,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {70427#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {70278#false} is VALID [2022-04-28 10:11:48,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {70423#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {70427#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:11:48,969 INFO L272 TraceCheckUtils]: 31: Hoare triple {70300#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {70423#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:11:48,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {70446#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {70300#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:48,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {70450#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {70446#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:11:48,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {70454#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {70450#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-28 10:11:48,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {70458#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {70454#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:11:48,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {70462#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {70458#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} is VALID [2022-04-28 10:11:48,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {70466#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {70462#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:11:48,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {70466#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !(~y~0 % 4294967296 > 0); {70466#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:11:48,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {70473#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70466#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:11:48,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {70477#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70473#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:11:48,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {70481#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70477#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:11:48,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {70485#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70481#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:11:48,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {70489#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70485#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:11:48,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {70489#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {70489#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:11:48,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {70496#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 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; {70489#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:11:48,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {70500#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~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; {70496#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:11:48,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {70504#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~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; {70500#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))))} is VALID [2022-04-28 10:11:48,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {70508#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~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; {70504#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:11:48,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {70512#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~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; {70508#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:11:48,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {70516#(or (< 0 (mod main_~x~0 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))))} ~z~0 := ~y~0; {70512#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:11:48,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {70516#(or (< 0 (mod main_~x~0 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))))} assume !(~x~0 % 4294967296 > 0); {70516#(or (< 0 (mod main_~x~0 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))))} is VALID [2022-04-28 10:11:48,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {70523#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6) (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70516#(or (< 0 (mod main_~x~0 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))))} is VALID [2022-04-28 10:11:48,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {70527#(or (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0) (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70523#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6) (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)))))} is VALID [2022-04-28 10:11:48,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {70531#(or (and (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70527#(or (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0) (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:11:48,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {70535#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9) (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) (* main_~n~0 2))) (< (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 10))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70531#(or (and (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:11:48,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {70539#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 10) (+ (* main_~n~0 2) (* (div (+ main_~y~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70535#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9) (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) (* main_~n~0 2))) (< (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 10))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:11:48,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {70277#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70539#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 10) (+ (* main_~n~0 2) (* (div (+ main_~y~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:11:48,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {70277#true} call #t~ret13 := main(); {70277#true} is VALID [2022-04-28 10:11:48,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70277#true} {70277#true} #72#return; {70277#true} is VALID [2022-04-28 10:11:49,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {70277#true} assume true; {70277#true} is VALID [2022-04-28 10:11:49,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {70277#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); {70277#true} is VALID [2022-04-28 10:11:49,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {70277#true} call ULTIMATE.init(); {70277#true} is VALID [2022-04-28 10:11:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:49,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412212364] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:49,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:49,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28, 27] total 71 [2022-04-28 10:11:49,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:49,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [842155301] [2022-04-28 10:11:49,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [842155301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:49,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:49,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:11:49,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539371607] [2022-04-28 10:11:49,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:49,001 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 22 states have internal predecessors, (31), 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 35 [2022-04-28 10:11:49,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:49,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 22 states have internal predecessors, (31), 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-28 10:11:49,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:49,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:11:49,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:49,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:11:49,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=4453, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 10:11:49,039 INFO L87 Difference]: Start difference. First operand 333 states and 453 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 22 states have internal predecessors, (31), 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-28 10:11:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:52,775 INFO L93 Difference]: Finished difference Result 350 states and 470 transitions. [2022-04-28 10:11:52,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:11:52,776 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 22 states have internal predecessors, (31), 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 35 [2022-04-28 10:11:52,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 22 states have internal predecessors, (31), 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-28 10:11:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 50 transitions. [2022-04-28 10:11:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 22 states have internal predecessors, (31), 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-28 10:11:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 50 transitions. [2022-04-28 10:11:52,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 50 transitions. [2022-04-28 10:11:52,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:52,840 INFO L225 Difference]: With dead ends: 350 [2022-04-28 10:11:52,840 INFO L226 Difference]: Without dead ends: 345 [2022-04-28 10:11:52,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2051 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=739, Invalid=8191, Unknown=0, NotChecked=0, Total=8930 [2022-04-28 10:11:52,841 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:52,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 113 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:11:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-28 10:11:54,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 333. [2022-04-28 10:11:54,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:54,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:54,076 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:54,076 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:54,080 INFO L93 Difference]: Finished difference Result 345 states and 465 transitions. [2022-04-28 10:11:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 465 transitions. [2022-04-28 10:11:54,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:54,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:54,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 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 345 states. [2022-04-28 10:11:54,081 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 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 345 states. [2022-04-28 10:11:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:54,085 INFO L93 Difference]: Finished difference Result 345 states and 465 transitions. [2022-04-28 10:11:54,085 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 465 transitions. [2022-04-28 10:11:54,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:54,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:54,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:54,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 453 transitions. [2022-04-28 10:11:54,090 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 453 transitions. Word has length 35 [2022-04-28 10:11:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:54,091 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 453 transitions. [2022-04-28 10:11:54,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 22 states have internal predecessors, (31), 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-28 10:11:54,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 453 transitions. [2022-04-28 10:11:55,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 453 transitions. [2022-04-28 10:11:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:11:55,956 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:55,956 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:55,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:56,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-04-28 10:11:56,161 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:56,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:56,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1479667000, now seen corresponding path program 47 times [2022-04-28 10:11:56,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:56,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1126003498] [2022-04-28 10:11:56,163 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:56,163 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:56,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1479667000, now seen corresponding path program 48 times [2022-04-28 10:11:56,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:56,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808606877] [2022-04-28 10:11:56,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:56,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:56,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:56,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {72681#(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); {72664#true} is VALID [2022-04-28 10:11:56,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {72664#true} assume true; {72664#true} is VALID [2022-04-28 10:11:56,341 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72664#true} {72664#true} #72#return; {72664#true} is VALID [2022-04-28 10:11:56,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {72664#true} call ULTIMATE.init(); {72681#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:56,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {72681#(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); {72664#true} is VALID [2022-04-28 10:11:56,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {72664#true} assume true; {72664#true} is VALID [2022-04-28 10:11:56,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72664#true} {72664#true} #72#return; {72664#true} is VALID [2022-04-28 10:11:56,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {72664#true} call #t~ret13 := main(); {72664#true} is VALID [2022-04-28 10:11:56,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {72664#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72669#(= main_~y~0 0)} is VALID [2022-04-28 10:11:56,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {72669#(= 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; {72670#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:56,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {72670#(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; {72671#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:56,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {72671#(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; {72672#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:56,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {72672#(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; {72673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:56,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {72673#(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; {72674#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:56,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {72674#(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; {72675#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:56,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {72675#(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; {72676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:56,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {72676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {72676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:56,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {72676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {72677#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:56,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {72677#(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; {72678#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:56,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {72678#(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; {72679#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:56,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {72679#(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; {72680#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:56,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {72680#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {72665#false} is VALID [2022-04-28 10:11:56,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:56,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:56,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:56,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:56,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:56,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:56,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:56,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {72665#false} assume !(~y~0 % 4294967296 > 0); {72665#false} is VALID [2022-04-28 10:11:56,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {72665#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {72665#false} is VALID [2022-04-28 10:11:56,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {72665#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {72665#false} is VALID [2022-04-28 10:11:56,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {72665#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {72665#false} is VALID [2022-04-28 10:11:56,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {72665#false} assume !(~x~0 % 4294967296 > 0); {72665#false} is VALID [2022-04-28 10:11:56,349 INFO L272 TraceCheckUtils]: 31: Hoare triple {72665#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {72665#false} is VALID [2022-04-28 10:11:56,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {72665#false} ~cond := #in~cond; {72665#false} is VALID [2022-04-28 10:11:56,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {72665#false} assume 0 == ~cond; {72665#false} is VALID [2022-04-28 10:11:56,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {72665#false} assume !false; {72665#false} is VALID [2022-04-28 10:11:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 10:11:56,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:56,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808606877] [2022-04-28 10:11:56,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808606877] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:56,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061284737] [2022-04-28 10:11:56,350 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:56,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:56,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:56,352 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:56,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-28 10:11:56,469 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:11:56,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:56,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:11:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:56,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:56,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {72664#true} call ULTIMATE.init(); {72664#true} is VALID [2022-04-28 10:11:56,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {72664#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); {72664#true} is VALID [2022-04-28 10:11:56,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {72664#true} assume true; {72664#true} is VALID [2022-04-28 10:11:56,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72664#true} {72664#true} #72#return; {72664#true} is VALID [2022-04-28 10:11:56,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {72664#true} call #t~ret13 := main(); {72664#true} is VALID [2022-04-28 10:11:56,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {72664#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72669#(= main_~y~0 0)} is VALID [2022-04-28 10:11:56,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {72669#(= 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; {72670#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:56,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {72670#(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; {72671#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:56,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {72671#(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; {72672#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:56,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {72672#(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; {72673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:56,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {72673#(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; {72674#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:56,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {72674#(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; {72675#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:56,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {72675#(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; {72676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:56,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {72676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {72676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:56,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {72676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {72677#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:56,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {72677#(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; {72678#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:56,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {72678#(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; {72679#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:56,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {72679#(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; {72736#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:56,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {72736#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {72665#false} is VALID [2022-04-28 10:11:56,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:56,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:56,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:56,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:56,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:56,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:56,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:56,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {72665#false} assume !(~y~0 % 4294967296 > 0); {72665#false} is VALID [2022-04-28 10:11:56,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {72665#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {72665#false} is VALID [2022-04-28 10:11:56,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {72665#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {72665#false} is VALID [2022-04-28 10:11:56,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {72665#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {72665#false} is VALID [2022-04-28 10:11:56,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {72665#false} assume !(~x~0 % 4294967296 > 0); {72665#false} is VALID [2022-04-28 10:11:56,738 INFO L272 TraceCheckUtils]: 31: Hoare triple {72665#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {72665#false} is VALID [2022-04-28 10:11:56,738 INFO L290 TraceCheckUtils]: 32: Hoare triple {72665#false} ~cond := #in~cond; {72665#false} is VALID [2022-04-28 10:11:56,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {72665#false} assume 0 == ~cond; {72665#false} is VALID [2022-04-28 10:11:56,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {72665#false} assume !false; {72665#false} is VALID [2022-04-28 10:11:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 10:11:56,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:57,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {72665#false} assume !false; {72665#false} is VALID [2022-04-28 10:11:57,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {72665#false} assume 0 == ~cond; {72665#false} is VALID [2022-04-28 10:11:57,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {72665#false} ~cond := #in~cond; {72665#false} is VALID [2022-04-28 10:11:57,111 INFO L272 TraceCheckUtils]: 31: Hoare triple {72665#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {72665#false} is VALID [2022-04-28 10:11:57,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {72665#false} assume !(~x~0 % 4294967296 > 0); {72665#false} is VALID [2022-04-28 10:11:57,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {72665#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {72665#false} is VALID [2022-04-28 10:11:57,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {72665#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {72665#false} is VALID [2022-04-28 10:11:57,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {72665#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {72665#false} is VALID [2022-04-28 10:11:57,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {72665#false} assume !(~y~0 % 4294967296 > 0); {72665#false} is VALID [2022-04-28 10:11:57,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:57,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:57,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:57,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:57,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:57,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:57,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {72665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72665#false} is VALID [2022-04-28 10:11:57,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {72836#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {72665#false} is VALID [2022-04-28 10:11:57,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {72840#(< 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; {72836#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:57,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {72844#(< 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; {72840#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:57,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {72848#(< 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; {72844#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:57,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {72852#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {72848#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:57,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {72852#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {72852#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:57,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {72859#(< 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; {72852#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:57,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {72863#(< 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; {72859#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:57,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {72867#(< 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; {72863#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:57,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {72871#(< 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; {72867#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:57,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {72875#(< 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; {72871#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:57,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {72879#(< 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; {72875#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:57,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {72883#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72879#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:57,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {72664#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72883#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:57,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {72664#true} call #t~ret13 := main(); {72664#true} is VALID [2022-04-28 10:11:57,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72664#true} {72664#true} #72#return; {72664#true} is VALID [2022-04-28 10:11:57,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {72664#true} assume true; {72664#true} is VALID [2022-04-28 10:11:57,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {72664#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); {72664#true} is VALID [2022-04-28 10:11:57,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {72664#true} call ULTIMATE.init(); {72664#true} is VALID [2022-04-28 10:11:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 10:11:57,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061284737] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:57,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:57,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:11:57,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:57,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1126003498] [2022-04-28 10:11:57,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1126003498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:57,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:57,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:11:57,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175793568] [2022-04-28 10:11:57,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:57,126 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 35 [2022-04-28 10:11:57,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:57,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:11:57,149 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-28 10:11:57,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:11:57,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:57,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:11:57,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:11:57,150 INFO L87 Difference]: Start difference. First operand 333 states and 453 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:11:59,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:59,744 INFO L93 Difference]: Finished difference Result 395 states and 515 transitions. [2022-04-28 10:11:59,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:11:59,744 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 35 [2022-04-28 10:11:59,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:11:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2022-04-28 10:11:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:11:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2022-04-28 10:11:59,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 68 transitions. [2022-04-28 10:11:59,800 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-28 10:11:59,806 INFO L225 Difference]: With dead ends: 395 [2022-04-28 10:11:59,806 INFO L226 Difference]: Without dead ends: 378 [2022-04-28 10:11:59,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=403, Invalid=1577, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 10:11:59,806 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:59,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 82 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:11:59,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-04-28 10:12:01,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 333. [2022-04-28 10:12:01,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:01,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 378 states. Second operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:01,047 INFO L74 IsIncluded]: Start isIncluded. First operand 378 states. Second operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:01,047 INFO L87 Difference]: Start difference. First operand 378 states. Second operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:01,052 INFO L93 Difference]: Finished difference Result 378 states and 498 transitions. [2022-04-28 10:12:01,052 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 498 transitions. [2022-04-28 10:12:01,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:01,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:01,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 3 states have call successors, (3), 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 378 states. [2022-04-28 10:12:01,053 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 3 states have call successors, (3), 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 378 states. [2022-04-28 10:12:01,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:01,057 INFO L93 Difference]: Finished difference Result 378 states and 498 transitions. [2022-04-28 10:12:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 498 transitions. [2022-04-28 10:12:01,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:01,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:01,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:01,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 452 transitions. [2022-04-28 10:12:01,063 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 452 transitions. Word has length 35 [2022-04-28 10:12:01,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:01,063 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 452 transitions. [2022-04-28 10:12:01,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:12:01,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 452 transitions. [2022-04-28 10:12:02,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 452 transitions. [2022-04-28 10:12:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:12:02,779 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:02,779 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:02,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:02,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:02,979 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:02,980 INFO L85 PathProgramCache]: Analyzing trace with hash 648860760, now seen corresponding path program 49 times [2022-04-28 10:12:02,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:02,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [963461745] [2022-04-28 10:12:02,982 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:02,982 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash 648860760, now seen corresponding path program 50 times [2022-04-28 10:12:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:02,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379368517] [2022-04-28 10:12:02,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:02,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:03,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:03,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {75167#(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); {75150#true} is VALID [2022-04-28 10:12:03,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {75150#true} assume true; {75150#true} is VALID [2022-04-28 10:12:03,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75150#true} {75150#true} #72#return; {75150#true} is VALID [2022-04-28 10:12:03,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {75150#true} call ULTIMATE.init(); {75167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:03,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {75167#(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); {75150#true} is VALID [2022-04-28 10:12:03,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {75150#true} assume true; {75150#true} is VALID [2022-04-28 10:12:03,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75150#true} {75150#true} #72#return; {75150#true} is VALID [2022-04-28 10:12:03,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {75150#true} call #t~ret13 := main(); {75150#true} is VALID [2022-04-28 10:12:03,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {75150#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75155#(= main_~y~0 0)} is VALID [2022-04-28 10:12:03,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {75155#(= 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; {75156#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:03,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {75156#(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; {75157#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:03,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {75157#(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; {75158#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:03,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {75158#(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; {75159#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:03,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {75159#(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; {75160#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:03,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {75160#(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; {75161#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:03,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {75161#(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; {75162#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:03,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {75162#(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; {75163#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:03,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {75163#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {75163#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:03,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {75163#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {75164#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:03,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {75164#(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; {75165#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:03,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {75165#(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; {75166#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:03,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {75166#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {75151#false} is VALID [2022-04-28 10:12:03,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {75151#false} assume !(~y~0 % 4294967296 > 0); {75151#false} is VALID [2022-04-28 10:12:03,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {75151#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {75151#false} is VALID [2022-04-28 10:12:03,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {75151#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {75151#false} is VALID [2022-04-28 10:12:03,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {75151#false} assume !(~x~0 % 4294967296 > 0); {75151#false} is VALID [2022-04-28 10:12:03,179 INFO L272 TraceCheckUtils]: 31: Hoare triple {75151#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {75151#false} is VALID [2022-04-28 10:12:03,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {75151#false} ~cond := #in~cond; {75151#false} is VALID [2022-04-28 10:12:03,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {75151#false} assume 0 == ~cond; {75151#false} is VALID [2022-04-28 10:12:03,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {75151#false} assume !false; {75151#false} is VALID [2022-04-28 10:12:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 10:12:03,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:03,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379368517] [2022-04-28 10:12:03,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379368517] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:03,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311307412] [2022-04-28 10:12:03,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:03,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:03,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:03,181 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:03,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-28 10:12:03,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:03,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:03,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:12:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:03,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:03,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {75150#true} call ULTIMATE.init(); {75150#true} is VALID [2022-04-28 10:12:03,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {75150#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); {75150#true} is VALID [2022-04-28 10:12:03,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {75150#true} assume true; {75150#true} is VALID [2022-04-28 10:12:03,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75150#true} {75150#true} #72#return; {75150#true} is VALID [2022-04-28 10:12:03,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {75150#true} call #t~ret13 := main(); {75150#true} is VALID [2022-04-28 10:12:03,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {75150#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75155#(= main_~y~0 0)} is VALID [2022-04-28 10:12:03,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {75155#(= 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; {75156#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:03,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {75156#(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; {75157#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:03,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {75157#(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; {75158#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:03,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {75158#(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; {75159#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:03,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {75159#(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; {75160#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:03,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {75160#(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; {75161#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:03,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {75161#(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; {75162#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:03,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {75162#(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; {75163#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:03,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {75163#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {75163#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:03,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {75163#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {75164#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:03,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {75164#(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; {75165#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:03,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {75165#(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; {75222#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:03,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {75222#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {75151#false} is VALID [2022-04-28 10:12:03,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {75151#false} assume !(~y~0 % 4294967296 > 0); {75151#false} is VALID [2022-04-28 10:12:03,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {75151#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {75151#false} is VALID [2022-04-28 10:12:03,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {75151#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {75151#false} is VALID [2022-04-28 10:12:03,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {75151#false} assume !(~x~0 % 4294967296 > 0); {75151#false} is VALID [2022-04-28 10:12:03,475 INFO L272 TraceCheckUtils]: 31: Hoare triple {75151#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {75151#false} is VALID [2022-04-28 10:12:03,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {75151#false} ~cond := #in~cond; {75151#false} is VALID [2022-04-28 10:12:03,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {75151#false} assume 0 == ~cond; {75151#false} is VALID [2022-04-28 10:12:03,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {75151#false} assume !false; {75151#false} is VALID [2022-04-28 10:12:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 10:12:03,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:03,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {75151#false} assume !false; {75151#false} is VALID [2022-04-28 10:12:03,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {75151#false} assume 0 == ~cond; {75151#false} is VALID [2022-04-28 10:12:03,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {75151#false} ~cond := #in~cond; {75151#false} is VALID [2022-04-28 10:12:03,799 INFO L272 TraceCheckUtils]: 31: Hoare triple {75151#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {75151#false} is VALID [2022-04-28 10:12:03,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {75151#false} assume !(~x~0 % 4294967296 > 0); {75151#false} is VALID [2022-04-28 10:12:03,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {75151#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {75151#false} is VALID [2022-04-28 10:12:03,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {75151#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {75151#false} is VALID [2022-04-28 10:12:03,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {75151#false} assume !(~y~0 % 4294967296 > 0); {75151#false} is VALID [2022-04-28 10:12:03,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {75151#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75151#false} is VALID [2022-04-28 10:12:03,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {75322#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {75151#false} is VALID [2022-04-28 10:12:03,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {75326#(< 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; {75322#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:03,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {75330#(< 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; {75326#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:03,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {75334#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {75330#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:03,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {75334#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {75334#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:03,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {75341#(< 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; {75334#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:03,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {75345#(< 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; {75341#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:03,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {75349#(< 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; {75345#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:03,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {75353#(< 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; {75349#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:03,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {75357#(< 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; {75353#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:03,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {75361#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75357#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:03,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {75365#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75361#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:03,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {75369#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75365#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:03,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {75150#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75369#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:03,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {75150#true} call #t~ret13 := main(); {75150#true} is VALID [2022-04-28 10:12:03,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75150#true} {75150#true} #72#return; {75150#true} is VALID [2022-04-28 10:12:03,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {75150#true} assume true; {75150#true} is VALID [2022-04-28 10:12:03,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {75150#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); {75150#true} is VALID [2022-04-28 10:12:03,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {75150#true} call ULTIMATE.init(); {75150#true} is VALID [2022-04-28 10:12:03,809 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 10:12:03,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311307412] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:03,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:03,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:12:03,809 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:03,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [963461745] [2022-04-28 10:12:03,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [963461745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:03,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:03,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:12:03,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245894706] [2022-04-28 10:12:03,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:03,810 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 35 [2022-04-28 10:12:03,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:03,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:12:03,828 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-28 10:12:03,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:12:03,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:03,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:12:03,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:12:03,829 INFO L87 Difference]: Start difference. First operand 333 states and 452 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:12:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:06,419 INFO L93 Difference]: Finished difference Result 408 states and 527 transitions. [2022-04-28 10:12:06,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:12:06,419 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 35 [2022-04-28 10:12:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:12:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-04-28 10:12:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:12:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-04-28 10:12:06,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 71 transitions. [2022-04-28 10:12:06,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:06,483 INFO L225 Difference]: With dead ends: 408 [2022-04-28 10:12:06,483 INFO L226 Difference]: Without dead ends: 391 [2022-04-28 10:12:06,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:12:06,484 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:06,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 85 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:12:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-04-28 10:12:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 333. [2022-04-28 10:12:07,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:07,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:07,722 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:07,722 INFO L87 Difference]: Start difference. First operand 391 states. Second operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:07,728 INFO L93 Difference]: Finished difference Result 391 states and 510 transitions. [2022-04-28 10:12:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 510 transitions. [2022-04-28 10:12:07,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:07,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:07,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 3 states have call successors, (3), 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 391 states. [2022-04-28 10:12:07,728 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 3 states have call successors, (3), 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 391 states. [2022-04-28 10:12:07,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:07,733 INFO L93 Difference]: Finished difference Result 391 states and 510 transitions. [2022-04-28 10:12:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 510 transitions. [2022-04-28 10:12:07,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:07,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:07,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:07,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 451 transitions. [2022-04-28 10:12:07,739 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 451 transitions. Word has length 35 [2022-04-28 10:12:07,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:07,739 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 451 transitions. [2022-04-28 10:12:07,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:12:07,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 451 transitions. [2022-04-28 10:12:09,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 451 transitions. [2022-04-28 10:12:09,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:12:09,602 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:09,602 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:09,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:09,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:09,803 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:09,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:09,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1222139704, now seen corresponding path program 51 times [2022-04-28 10:12:09,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:09,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118707470] [2022-04-28 10:12:09,805 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:09,805 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1222139704, now seen corresponding path program 52 times [2022-04-28 10:12:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:09,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546394029] [2022-04-28 10:12:09,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:10,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:10,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {77701#(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); {77684#true} is VALID [2022-04-28 10:12:10,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {77684#true} assume true; {77684#true} is VALID [2022-04-28 10:12:10,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77684#true} {77684#true} #72#return; {77684#true} is VALID [2022-04-28 10:12:10,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {77684#true} call ULTIMATE.init(); {77701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:10,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {77701#(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); {77684#true} is VALID [2022-04-28 10:12:10,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {77684#true} assume true; {77684#true} is VALID [2022-04-28 10:12:10,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77684#true} {77684#true} #72#return; {77684#true} is VALID [2022-04-28 10:12:10,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {77684#true} call #t~ret13 := main(); {77684#true} is VALID [2022-04-28 10:12:10,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {77684#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77689#(= main_~y~0 0)} is VALID [2022-04-28 10:12:10,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {77689#(= 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; {77690#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:10,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {77690#(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; {77691#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:10,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {77691#(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; {77692#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:10,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {77692#(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; {77693#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:10,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {77693#(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; {77694#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:10,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {77694#(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; {77695#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:10,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {77695#(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; {77696#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:10,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {77696#(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; {77697#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:10,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {77697#(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; {77698#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:10,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {77698#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {77698#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:10,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {77698#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {77699#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:10,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {77699#(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; {77700#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:10,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {77700#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {77685#false} is VALID [2022-04-28 10:12:10,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {77685#false} assume !(~y~0 % 4294967296 > 0); {77685#false} is VALID [2022-04-28 10:12:10,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {77685#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {77685#false} is VALID [2022-04-28 10:12:10,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {77685#false} assume !(~x~0 % 4294967296 > 0); {77685#false} is VALID [2022-04-28 10:12:10,013 INFO L272 TraceCheckUtils]: 31: Hoare triple {77685#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {77685#false} is VALID [2022-04-28 10:12:10,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {77685#false} ~cond := #in~cond; {77685#false} is VALID [2022-04-28 10:12:10,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {77685#false} assume 0 == ~cond; {77685#false} is VALID [2022-04-28 10:12:10,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {77685#false} assume !false; {77685#false} is VALID [2022-04-28 10:12:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:12:10,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:10,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546394029] [2022-04-28 10:12:10,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546394029] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:10,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931843174] [2022-04-28 10:12:10,014 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:10,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:10,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:10,015 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:10,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-28 10:12:10,058 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:10,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:10,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:12:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:10,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:10,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {77684#true} call ULTIMATE.init(); {77684#true} is VALID [2022-04-28 10:12:10,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {77684#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); {77684#true} is VALID [2022-04-28 10:12:10,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {77684#true} assume true; {77684#true} is VALID [2022-04-28 10:12:10,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77684#true} {77684#true} #72#return; {77684#true} is VALID [2022-04-28 10:12:10,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {77684#true} call #t~ret13 := main(); {77684#true} is VALID [2022-04-28 10:12:10,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {77684#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77689#(= main_~y~0 0)} is VALID [2022-04-28 10:12:10,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {77689#(= 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; {77690#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:10,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {77690#(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; {77691#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:10,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {77691#(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; {77692#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:10,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {77692#(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; {77693#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:10,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {77693#(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; {77694#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:10,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {77694#(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; {77695#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:10,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {77695#(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; {77696#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:10,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {77696#(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; {77697#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:10,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {77697#(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; {77698#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:10,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {77698#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {77698#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:10,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {77698#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {77699#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:10,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {77699#(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; {77756#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:10,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {77756#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {77685#false} is VALID [2022-04-28 10:12:10,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {77685#false} assume !(~y~0 % 4294967296 > 0); {77685#false} is VALID [2022-04-28 10:12:10,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {77685#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {77685#false} is VALID [2022-04-28 10:12:10,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {77685#false} assume !(~x~0 % 4294967296 > 0); {77685#false} is VALID [2022-04-28 10:12:10,319 INFO L272 TraceCheckUtils]: 31: Hoare triple {77685#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {77685#false} is VALID [2022-04-28 10:12:10,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {77685#false} ~cond := #in~cond; {77685#false} is VALID [2022-04-28 10:12:10,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {77685#false} assume 0 == ~cond; {77685#false} is VALID [2022-04-28 10:12:10,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {77685#false} assume !false; {77685#false} is VALID [2022-04-28 10:12:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:12:10,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:10,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {77685#false} assume !false; {77685#false} is VALID [2022-04-28 10:12:10,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {77685#false} assume 0 == ~cond; {77685#false} is VALID [2022-04-28 10:12:10,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {77685#false} ~cond := #in~cond; {77685#false} is VALID [2022-04-28 10:12:10,640 INFO L272 TraceCheckUtils]: 31: Hoare triple {77685#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {77685#false} is VALID [2022-04-28 10:12:10,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {77685#false} assume !(~x~0 % 4294967296 > 0); {77685#false} is VALID [2022-04-28 10:12:10,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {77685#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {77685#false} is VALID [2022-04-28 10:12:10,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {77685#false} assume !(~y~0 % 4294967296 > 0); {77685#false} is VALID [2022-04-28 10:12:10,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {77685#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77685#false} is VALID [2022-04-28 10:12:10,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {77856#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {77685#false} is VALID [2022-04-28 10:12:10,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {77860#(< 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; {77856#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:10,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {77864#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {77860#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:10,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {77864#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {77864#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:10,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {77871#(< 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; {77864#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:10,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {77875#(< 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; {77871#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:10,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {77879#(< 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; {77875#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:10,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {77883#(< 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; {77879#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:10,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {77887#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77883#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:10,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {77891#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77887#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:10,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {77895#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77891#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:10,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {77899#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77895#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:10,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {77903#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77899#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:10,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {77684#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77903#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:10,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {77684#true} call #t~ret13 := main(); {77684#true} is VALID [2022-04-28 10:12:10,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77684#true} {77684#true} #72#return; {77684#true} is VALID [2022-04-28 10:12:10,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {77684#true} assume true; {77684#true} is VALID [2022-04-28 10:12:10,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {77684#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); {77684#true} is VALID [2022-04-28 10:12:10,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {77684#true} call ULTIMATE.init(); {77684#true} is VALID [2022-04-28 10:12:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:12:10,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931843174] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:10,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:10,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:12:10,650 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:10,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1118707470] [2022-04-28 10:12:10,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1118707470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:10,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:10,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:12:10,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937048394] [2022-04-28 10:12:10,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:10,651 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 35 [2022-04-28 10:12:10,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:10,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:12:10,668 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-28 10:12:10,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:12:10,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:10,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:12:10,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:12:10,669 INFO L87 Difference]: Start difference. First operand 333 states and 451 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:12:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:13,434 INFO L93 Difference]: Finished difference Result 423 states and 541 transitions. [2022-04-28 10:12:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:12:13,435 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 35 [2022-04-28 10:12:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:12:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-28 10:12:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:12:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-28 10:12:13,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 74 transitions. [2022-04-28 10:12:13,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:13,501 INFO L225 Difference]: With dead ends: 423 [2022-04-28 10:12:13,501 INFO L226 Difference]: Without dead ends: 406 [2022-04-28 10:12:13,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 10:12:13,502 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:13,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 89 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:12:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-04-28 10:12:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 333. [2022-04-28 10:12:14,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:14,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 406 states. Second operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:14,757 INFO L74 IsIncluded]: Start isIncluded. First operand 406 states. Second operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:14,757 INFO L87 Difference]: Start difference. First operand 406 states. Second operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:14,763 INFO L93 Difference]: Finished difference Result 406 states and 524 transitions. [2022-04-28 10:12:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 524 transitions. [2022-04-28 10:12:14,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:14,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:14,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 3 states have call successors, (3), 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 406 states. [2022-04-28 10:12:14,764 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 3 states have call successors, (3), 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 406 states. [2022-04-28 10:12:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:14,769 INFO L93 Difference]: Finished difference Result 406 states and 524 transitions. [2022-04-28 10:12:14,769 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 524 transitions. [2022-04-28 10:12:14,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:14,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:14,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:14,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 450 transitions. [2022-04-28 10:12:14,775 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 450 transitions. Word has length 35 [2022-04-28 10:12:14,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:14,775 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 450 transitions. [2022-04-28 10:12:14,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-28 10:12:14,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 450 transitions. [2022-04-28 10:12:16,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 450 edges. 450 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:16,319 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 450 transitions. [2022-04-28 10:12:16,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:12:16,320 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:16,320 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:16,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:16,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-04-28 10:12:16,520 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:16,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:16,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1541322344, now seen corresponding path program 39 times [2022-04-28 10:12:16,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:16,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [661211789] [2022-04-28 10:12:16,522 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:16,523 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:16,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1541322344, now seen corresponding path program 40 times [2022-04-28 10:12:16,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:16,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057530573] [2022-04-28 10:12:16,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:16,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:16,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:17,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {80301#(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); {80274#true} is VALID [2022-04-28 10:12:17,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {80274#true} assume true; {80274#true} is VALID [2022-04-28 10:12:17,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80274#true} {80274#true} #72#return; {80274#true} is VALID [2022-04-28 10:12:17,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {80274#true} call ULTIMATE.init(); {80301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:17,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {80301#(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); {80274#true} is VALID [2022-04-28 10:12:17,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {80274#true} assume true; {80274#true} is VALID [2022-04-28 10:12:17,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80274#true} {80274#true} #72#return; {80274#true} is VALID [2022-04-28 10:12:17,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {80274#true} call #t~ret13 := main(); {80274#true} is VALID [2022-04-28 10:12:17,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {80274#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80279#(= main_~y~0 0)} is VALID [2022-04-28 10:12:17,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {80279#(= 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; {80280#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:17,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {80280#(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; {80281#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:17,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {80281#(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; {80282#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:17,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {80282#(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; {80283#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:17,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {80283#(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; {80284#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:17,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {80284#(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; {80285#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:17,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {80285#(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; {80286#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:17,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {80286#(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; {80287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:17,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {80287#(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; {80288#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {80288#(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; {80289#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:17,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {80289#(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; {80290#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:17,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {80290#(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; {80291#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:17,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {80291#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80292#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:17,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {80292#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80293#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:17,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {80293#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80294#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:17,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {80294#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80295#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:17,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {80295#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80296#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:17,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {80296#(and (<= main_~y~0 17) (<= 17 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; {80297#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:17,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {80297#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80298#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:17,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {80298#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80299#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:17,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {80299#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {80299#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:17,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {80299#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {80300#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} is VALID [2022-04-28 10:12:17,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {80300#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {80275#false} is VALID [2022-04-28 10:12:17,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {80275#false} assume !(~y~0 % 4294967296 > 0); {80275#false} is VALID [2022-04-28 10:12:17,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {80275#false} assume !(~x~0 % 4294967296 > 0); {80275#false} is VALID [2022-04-28 10:12:17,016 INFO L272 TraceCheckUtils]: 31: Hoare triple {80275#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {80275#false} is VALID [2022-04-28 10:12:17,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {80275#false} ~cond := #in~cond; {80275#false} is VALID [2022-04-28 10:12:17,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {80275#false} assume 0 == ~cond; {80275#false} is VALID [2022-04-28 10:12:17,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {80275#false} assume !false; {80275#false} is VALID [2022-04-28 10:12:17,016 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:17,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:17,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057530573] [2022-04-28 10:12:17,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057530573] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:17,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162604538] [2022-04-28 10:12:17,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:17,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:17,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:17,018 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:17,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-28 10:12:17,065 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:17,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:17,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:12:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:17,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:17,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {80274#true} call ULTIMATE.init(); {80274#true} is VALID [2022-04-28 10:12:17,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {80274#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); {80274#true} is VALID [2022-04-28 10:12:17,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {80274#true} assume true; {80274#true} is VALID [2022-04-28 10:12:17,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80274#true} {80274#true} #72#return; {80274#true} is VALID [2022-04-28 10:12:17,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {80274#true} call #t~ret13 := main(); {80274#true} is VALID [2022-04-28 10:12:17,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {80274#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80279#(= main_~y~0 0)} is VALID [2022-04-28 10:12:17,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {80279#(= 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; {80280#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:17,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {80280#(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; {80281#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:17,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {80281#(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; {80282#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:17,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {80282#(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; {80283#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:17,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {80283#(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; {80284#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:17,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {80284#(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; {80285#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:17,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {80285#(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; {80286#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:17,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {80286#(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; {80287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:17,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {80287#(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; {80288#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {80288#(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; {80289#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:17,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {80289#(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; {80290#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:17,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {80290#(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; {80291#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:17,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {80291#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80292#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:17,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {80292#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80293#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:17,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {80293#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80294#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:17,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {80294#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80295#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:17,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {80295#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80296#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:17,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {80296#(and (<= main_~y~0 17) (<= 17 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; {80297#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:17,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {80297#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80298#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:17,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {80298#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80299#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:17,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {80299#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {80299#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:17,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {80299#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {80386#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-28 10:12:17,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {80386#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {80275#false} is VALID [2022-04-28 10:12:17,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {80275#false} assume !(~y~0 % 4294967296 > 0); {80275#false} is VALID [2022-04-28 10:12:17,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {80275#false} assume !(~x~0 % 4294967296 > 0); {80275#false} is VALID [2022-04-28 10:12:17,412 INFO L272 TraceCheckUtils]: 31: Hoare triple {80275#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {80275#false} is VALID [2022-04-28 10:12:17,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {80275#false} ~cond := #in~cond; {80275#false} is VALID [2022-04-28 10:12:17,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {80275#false} assume 0 == ~cond; {80275#false} is VALID [2022-04-28 10:12:17,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {80275#false} assume !false; {80275#false} is VALID [2022-04-28 10:12:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:17,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:18,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {80275#false} assume !false; {80275#false} is VALID [2022-04-28 10:12:18,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {80275#false} assume 0 == ~cond; {80275#false} is VALID [2022-04-28 10:12:18,252 INFO L290 TraceCheckUtils]: 32: Hoare triple {80275#false} ~cond := #in~cond; {80275#false} is VALID [2022-04-28 10:12:18,252 INFO L272 TraceCheckUtils]: 31: Hoare triple {80275#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {80275#false} is VALID [2022-04-28 10:12:18,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {80275#false} assume !(~x~0 % 4294967296 > 0); {80275#false} is VALID [2022-04-28 10:12:18,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {80275#false} assume !(~y~0 % 4294967296 > 0); {80275#false} is VALID [2022-04-28 10:12:18,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {80426#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {80275#false} is VALID [2022-04-28 10:12:18,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {80430#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {80426#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:18,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {80430#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {80430#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:18,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {80437#(< 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; {80430#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:18,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {80441#(< 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; {80437#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:18,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {80445#(< 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; {80441#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:18,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {80449#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80445#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:18,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {80453#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80449#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:18,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {80457#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80453#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:18,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {80461#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80457#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:18,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {80465#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80461#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:18,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {80469#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80465#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:18,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {80473#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80469#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:18,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {80477#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80473#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:18,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {80481#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80477#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:18,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {80485#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80481#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:12:18,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {80489#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80485#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:12:18,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {80493#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80489#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:12:18,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {80497#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80493#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:12:18,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {80501#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80497#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:12:18,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {80505#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80501#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:12:18,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {80509#(< 0 (mod (+ 19 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; {80505#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:12:18,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {80513#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80509#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:18,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {80274#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80513#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:12:18,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {80274#true} call #t~ret13 := main(); {80274#true} is VALID [2022-04-28 10:12:18,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80274#true} {80274#true} #72#return; {80274#true} is VALID [2022-04-28 10:12:18,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {80274#true} assume true; {80274#true} is VALID [2022-04-28 10:12:18,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {80274#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); {80274#true} is VALID [2022-04-28 10:12:18,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {80274#true} call ULTIMATE.init(); {80274#true} is VALID [2022-04-28 10:12:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:18,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162604538] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:18,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:18,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:12:18,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:18,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [661211789] [2022-04-28 10:12:18,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [661211789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:18,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:18,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:12:18,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902749746] [2022-04-28 10:12:18,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:18,268 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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 35 [2022-04-28 10:12:18,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:18,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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-28 10:12:18,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:18,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:12:18,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:18,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:12:18,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1720, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:12:18,290 INFO L87 Difference]: Start difference. First operand 333 states and 450 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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-28 10:12:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:24,134 INFO L93 Difference]: Finished difference Result 528 states and 810 transitions. [2022-04-28 10:12:24,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:12:24,134 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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 35 [2022-04-28 10:12:24,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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-28 10:12:24,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 159 transitions. [2022-04-28 10:12:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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-28 10:12:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 159 transitions. [2022-04-28 10:12:24,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 159 transitions. [2022-04-28 10:12:24,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:24,275 INFO L225 Difference]: With dead ends: 528 [2022-04-28 10:12:24,276 INFO L226 Difference]: Without dead ends: 503 [2022-04-28 10:12:24,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1088, Invalid=3742, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:12:24,276 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 146 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2440 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 2527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:24,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 171 Invalid, 2527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2440 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 10:12:24,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-04-28 10:12:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 350. [2022-04-28 10:12:25,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:25,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:25,577 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:25,577 INFO L87 Difference]: Start difference. First operand 503 states. Second operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:25,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:25,585 INFO L93 Difference]: Finished difference Result 503 states and 629 transitions. [2022-04-28 10:12:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 629 transitions. [2022-04-28 10:12:25,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:25,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:25,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 3 states have call successors, (3), 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 503 states. [2022-04-28 10:12:25,585 INFO L87 Difference]: Start difference. First operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 3 states have call successors, (3), 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 503 states. [2022-04-28 10:12:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:25,593 INFO L93 Difference]: Finished difference Result 503 states and 629 transitions. [2022-04-28 10:12:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 629 transitions. [2022-04-28 10:12:25,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:25,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:25,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:25,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 475 transitions. [2022-04-28 10:12:25,599 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 475 transitions. Word has length 35 [2022-04-28 10:12:25,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:25,599 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 475 transitions. [2022-04-28 10:12:25,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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-28 10:12:25,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 350 states and 475 transitions. [2022-04-28 10:12:27,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 475 transitions. [2022-04-28 10:12:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:12:27,403 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:27,403 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:27,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:27,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:27,607 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:27,607 INFO L85 PathProgramCache]: Analyzing trace with hash 225373872, now seen corresponding path program 53 times [2022-04-28 10:12:27,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:27,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1101675976] [2022-04-28 10:12:27,610 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:27,610 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:27,610 INFO L85 PathProgramCache]: Analyzing trace with hash 225373872, now seen corresponding path program 54 times [2022-04-28 10:12:27,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:27,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892996605] [2022-04-28 10:12:27,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:27,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:27,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:27,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {83351#(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); {83340#true} is VALID [2022-04-28 10:12:27,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {83340#true} assume true; {83340#true} is VALID [2022-04-28 10:12:27,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83340#true} {83340#true} #72#return; {83340#true} is VALID [2022-04-28 10:12:27,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {83340#true} call ULTIMATE.init(); {83351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:27,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {83351#(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); {83340#true} is VALID [2022-04-28 10:12:27,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {83340#true} assume true; {83340#true} is VALID [2022-04-28 10:12:27,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83340#true} {83340#true} #72#return; {83340#true} is VALID [2022-04-28 10:12:27,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {83340#true} call #t~ret13 := main(); {83340#true} is VALID [2022-04-28 10:12:27,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {83340#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83340#true} is VALID [2022-04-28 10:12:27,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {83340#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83340#true} is VALID [2022-04-28 10:12:27,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {83340#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83340#true} is VALID [2022-04-28 10:12:27,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {83340#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83340#true} is VALID [2022-04-28 10:12:27,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {83340#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83340#true} is VALID [2022-04-28 10:12:27,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {83340#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83340#true} is VALID [2022-04-28 10:12:27,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {83340#true} assume !(~x~0 % 4294967296 > 0); {83345#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:12:27,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {83345#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {83345#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:12:27,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {83345#(<= 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; {83346#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:12:27,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {83346#(<= 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; {83347#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:27,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {83347#(<= 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; {83348#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:27,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {83348#(<= 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; {83349#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:27,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {83349#(<= 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; {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:27,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:27,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:27,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:27,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:27,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:27,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:27,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:27,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83349#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:27,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {83349#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83348#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:27,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {83348#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83347#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:27,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {83347#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83346#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:12:27,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {83346#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83345#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:12:27,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {83345#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83341#false} is VALID [2022-04-28 10:12:27,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {83341#false} assume !(~x~0 % 4294967296 > 0); {83341#false} is VALID [2022-04-28 10:12:27,728 INFO L272 TraceCheckUtils]: 32: Hoare triple {83341#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {83341#false} is VALID [2022-04-28 10:12:27,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {83341#false} ~cond := #in~cond; {83341#false} is VALID [2022-04-28 10:12:27,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {83341#false} assume 0 == ~cond; {83341#false} is VALID [2022-04-28 10:12:27,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {83341#false} assume !false; {83341#false} is VALID [2022-04-28 10:12:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:12:27,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:27,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892996605] [2022-04-28 10:12:27,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892996605] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:27,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243477786] [2022-04-28 10:12:27,729 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:12:27,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:27,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:27,730 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:27,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-28 10:12:27,798 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:12:27,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:27,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:12:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:27,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:28,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {83340#true} call ULTIMATE.init(); {83340#true} is VALID [2022-04-28 10:12:28,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {83340#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); {83340#true} is VALID [2022-04-28 10:12:28,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {83340#true} assume true; {83340#true} is VALID [2022-04-28 10:12:28,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83340#true} {83340#true} #72#return; {83340#true} is VALID [2022-04-28 10:12:28,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {83340#true} call #t~ret13 := main(); {83340#true} is VALID [2022-04-28 10:12:28,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {83340#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83340#true} is VALID [2022-04-28 10:12:28,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {83340#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83340#true} is VALID [2022-04-28 10:12:28,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {83340#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83340#true} is VALID [2022-04-28 10:12:28,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {83340#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83340#true} is VALID [2022-04-28 10:12:28,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {83340#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83340#true} is VALID [2022-04-28 10:12:28,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {83340#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83340#true} is VALID [2022-04-28 10:12:28,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {83340#true} assume !(~x~0 % 4294967296 > 0); {83345#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:12:28,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {83345#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {83345#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:12:28,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {83345#(<= 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; {83346#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:12:28,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {83346#(<= 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; {83347#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:28,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {83347#(<= 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; {83348#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:28,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {83348#(<= 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; {83349#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:28,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {83349#(<= 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; {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:28,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:28,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:28,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:28,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:28,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:28,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:28,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:12:28,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {83350#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83349#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:28,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {83349#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83348#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:28,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {83348#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83347#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:28,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {83347#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83346#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:12:28,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {83346#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83345#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:12:28,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {83345#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83445#(<= (+ main_~x~0 1) (* (div (+ main_~x~0 1) 4294967296) 4294967296))} is VALID [2022-04-28 10:12:28,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {83445#(<= (+ main_~x~0 1) (* (div (+ main_~x~0 1) 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {83341#false} is VALID [2022-04-28 10:12:28,077 INFO L272 TraceCheckUtils]: 32: Hoare triple {83341#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {83341#false} is VALID [2022-04-28 10:12:28,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {83341#false} ~cond := #in~cond; {83341#false} is VALID [2022-04-28 10:12:28,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {83341#false} assume 0 == ~cond; {83341#false} is VALID [2022-04-28 10:12:28,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {83341#false} assume !false; {83341#false} is VALID [2022-04-28 10:12:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:12:28,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:28,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {83341#false} assume !false; {83341#false} is VALID [2022-04-28 10:12:28,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {83341#false} assume 0 == ~cond; {83341#false} is VALID [2022-04-28 10:12:28,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {83341#false} ~cond := #in~cond; {83341#false} is VALID [2022-04-28 10:12:28,388 INFO L272 TraceCheckUtils]: 32: Hoare triple {83341#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {83341#false} is VALID [2022-04-28 10:12:28,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {83473#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {83341#false} is VALID [2022-04-28 10:12:28,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {83477#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83473#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:28,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {83481#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83477#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:28,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {83485#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83481#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:28,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {83489#(< 0 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83485#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:28,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {83493#(< 0 (mod (+ 4294967291 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83489#(< 0 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:28,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {83493#(< 0 (mod (+ 4294967291 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:28,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !(~y~0 % 4294967296 > 0); {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:28,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:28,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:28,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:28,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:28,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:28,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:28,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {83493#(< 0 (mod (+ 4294967291 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; {83497#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:28,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {83489#(< 0 (mod (+ 4294967292 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; {83493#(< 0 (mod (+ 4294967291 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:28,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {83485#(< 0 (mod (+ main_~x~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; {83489#(< 0 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:28,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {83481#(< 0 (mod (+ main_~x~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; {83485#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:28,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {83477#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83481#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:28,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {83477#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} ~z~0 := ~y~0; {83477#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:28,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {83340#true} assume !(~x~0 % 4294967296 > 0); {83477#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:28,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {83340#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83340#true} is VALID [2022-04-28 10:12:28,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {83340#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83340#true} is VALID [2022-04-28 10:12:28,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {83340#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83340#true} is VALID [2022-04-28 10:12:28,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {83340#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83340#true} is VALID [2022-04-28 10:12:28,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {83340#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83340#true} is VALID [2022-04-28 10:12:28,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {83340#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83340#true} is VALID [2022-04-28 10:12:28,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {83340#true} call #t~ret13 := main(); {83340#true} is VALID [2022-04-28 10:12:28,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83340#true} {83340#true} #72#return; {83340#true} is VALID [2022-04-28 10:12:28,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {83340#true} assume true; {83340#true} is VALID [2022-04-28 10:12:28,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {83340#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); {83340#true} is VALID [2022-04-28 10:12:28,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {83340#true} call ULTIMATE.init(); {83340#true} is VALID [2022-04-28 10:12:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:12:28,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243477786] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:28,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:28,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-04-28 10:12:28,412 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:28,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1101675976] [2022-04-28 10:12:28,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1101675976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:28,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:28,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:12:28,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709379770] [2022-04-28 10:12:28,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:28,412 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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 36 [2022-04-28 10:12:28,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:28,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-28 10:12:28,436 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-28 10:12:28,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:12:28,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:28,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:12:28,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:12:28,437 INFO L87 Difference]: Start difference. First operand 350 states and 475 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-28 10:12:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:30,495 INFO L93 Difference]: Finished difference Result 374 states and 500 transitions. [2022-04-28 10:12:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:12:30,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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 36 [2022-04-28 10:12:30,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-28 10:12:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 10:12:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-28 10:12:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 10:12:30,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-28 10:12:30,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:30,551 INFO L225 Difference]: With dead ends: 374 [2022-04-28 10:12:30,551 INFO L226 Difference]: Without dead ends: 349 [2022-04-28 10:12:30,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:12:30,552 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 39 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:30,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 64 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:12:30,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-04-28 10:12:31,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 344. [2022-04-28 10:12:31,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:31,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 349 states. Second operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:31,865 INFO L74 IsIncluded]: Start isIncluded. First operand 349 states. Second operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:31,865 INFO L87 Difference]: Start difference. First operand 349 states. Second operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:31,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:31,869 INFO L93 Difference]: Finished difference Result 349 states and 473 transitions. [2022-04-28 10:12:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 473 transitions. [2022-04-28 10:12:31,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:31,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:31,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 3 states have call successors, (3), 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 349 states. [2022-04-28 10:12:31,870 INFO L87 Difference]: Start difference. First operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 3 states have call successors, (3), 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 349 states. [2022-04-28 10:12:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:31,874 INFO L93 Difference]: Finished difference Result 349 states and 473 transitions. [2022-04-28 10:12:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 473 transitions. [2022-04-28 10:12:31,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:31,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:31,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:31,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 468 transitions. [2022-04-28 10:12:31,883 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 468 transitions. Word has length 36 [2022-04-28 10:12:31,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:31,883 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 468 transitions. [2022-04-28 10:12:31,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-28 10:12:31,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 468 transitions. [2022-04-28 10:12:33,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 468 transitions. [2022-04-28 10:12:33,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:12:33,476 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:33,476 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:33,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:33,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2022-04-28 10:12:33,676 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:33,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:33,677 INFO L85 PathProgramCache]: Analyzing trace with hash 382085168, now seen corresponding path program 23 times [2022-04-28 10:12:33,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:33,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [439523386] [2022-04-28 10:12:33,679 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:33,679 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:33,679 INFO L85 PathProgramCache]: Analyzing trace with hash 382085168, now seen corresponding path program 24 times [2022-04-28 10:12:33,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:33,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615763878] [2022-04-28 10:12:33,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:33,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:33,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:33,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {85740#(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); {85721#true} is VALID [2022-04-28 10:12:33,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {85721#true} assume true; {85721#true} is VALID [2022-04-28 10:12:33,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85721#true} {85721#true} #72#return; {85721#true} is VALID [2022-04-28 10:12:33,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {85721#true} call ULTIMATE.init(); {85740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:33,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {85740#(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); {85721#true} is VALID [2022-04-28 10:12:33,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {85721#true} assume true; {85721#true} is VALID [2022-04-28 10:12:33,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85721#true} {85721#true} #72#return; {85721#true} is VALID [2022-04-28 10:12:33,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {85721#true} call #t~ret13 := main(); {85721#true} is VALID [2022-04-28 10:12:33,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {85721#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85721#true} is VALID [2022-04-28 10:12:33,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {85721#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85726#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:33,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {85726#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85727#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:12:33,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {85727#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85728#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:33,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {85728#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85729#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:33,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {85729#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85730#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:33,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {85730#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85731#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:33,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {85731#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85732#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:12:33,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {85732#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {85732#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:12:33,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {85732#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {85732#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:12:33,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {85732#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85733#(<= (+ (* 4294967296 (div (+ main_~x~0 6) 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:12:33,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {85733#(<= (+ (* 4294967296 (div (+ main_~x~0 6) 4294967296)) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85734#(<= (+ 2 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:12:33,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {85734#(<= (+ 2 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85735#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 3) main_~x~0)} is VALID [2022-04-28 10:12:33,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {85735#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 3) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85736#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4) main_~x~0)} is VALID [2022-04-28 10:12:33,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {85736#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85737#(<= (+ 5 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:12:33,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {85737#(<= (+ 5 (* (div (+ main_~x~0 2) 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; {85738#(<= (+ 6 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:12:33,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {85738#(<= (+ 6 (* (div (+ main_~x~0 1) 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; {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:33,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:33,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:33,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:33,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:33,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:33,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:33,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:33,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:33,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:33,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {85739#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {85722#false} is VALID [2022-04-28 10:12:33,954 INFO L272 TraceCheckUtils]: 32: Hoare triple {85722#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {85722#false} is VALID [2022-04-28 10:12:33,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {85722#false} ~cond := #in~cond; {85722#false} is VALID [2022-04-28 10:12:33,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {85722#false} assume 0 == ~cond; {85722#false} is VALID [2022-04-28 10:12:33,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {85722#false} assume !false; {85722#false} is VALID [2022-04-28 10:12:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:12:33,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:33,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615763878] [2022-04-28 10:12:33,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615763878] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:33,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838500904] [2022-04-28 10:12:33,955 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:12:33,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:33,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:33,956 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:33,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-28 10:12:34,068 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:12:34,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:34,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 10:12:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:34,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:34,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {85721#true} call ULTIMATE.init(); {85721#true} is VALID [2022-04-28 10:12:34,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {85721#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); {85721#true} is VALID [2022-04-28 10:12:34,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {85721#true} assume true; {85721#true} is VALID [2022-04-28 10:12:34,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85721#true} {85721#true} #72#return; {85721#true} is VALID [2022-04-28 10:12:34,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {85721#true} call #t~ret13 := main(); {85721#true} is VALID [2022-04-28 10:12:34,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {85721#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85721#true} is VALID [2022-04-28 10:12:34,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {85721#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85726#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:34,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {85726#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:12:34,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {85765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {85769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:12:34,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {85773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {85777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:12:34,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {85781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85785#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:12:34,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {85785#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {85785#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:12:34,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {85785#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} ~z~0 := ~y~0; {85785#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:12:34,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {85785#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:12:34,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {85781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {85777#(<= main_~x~0 (+ 4294967290 (* (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; {85773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:12:34,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {85773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {85769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {85765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:12:34,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {85765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85726#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:34,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {85726#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {85722#false} is VALID [2022-04-28 10:12:34,462 INFO L272 TraceCheckUtils]: 32: Hoare triple {85722#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {85722#false} is VALID [2022-04-28 10:12:34,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {85722#false} ~cond := #in~cond; {85722#false} is VALID [2022-04-28 10:12:34,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {85722#false} assume 0 == ~cond; {85722#false} is VALID [2022-04-28 10:12:34,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {85722#false} assume !false; {85722#false} is VALID [2022-04-28 10:12:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:12:34,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:34,622 INFO L290 TraceCheckUtils]: 35: Hoare triple {85722#false} assume !false; {85722#false} is VALID [2022-04-28 10:12:34,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {85722#false} assume 0 == ~cond; {85722#false} is VALID [2022-04-28 10:12:34,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {85722#false} ~cond := #in~cond; {85722#false} is VALID [2022-04-28 10:12:34,622 INFO L272 TraceCheckUtils]: 32: Hoare triple {85722#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {85722#false} is VALID [2022-04-28 10:12:34,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {85722#false} is VALID [2022-04-28 10:12:34,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {85726#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {85765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85726#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:34,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {85769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {85765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:12:34,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {85773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {85777#(<= main_~x~0 (+ 4294967290 (* (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; {85773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:12:34,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {85781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {85785#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:12:34,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {85785#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} ~z~0 := ~y~0; {85785#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:12:34,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {85785#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {85785#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:12:34,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {85781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85785#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:12:34,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {85777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:12:34,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {85773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {85769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:12:34,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {85765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:34,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {85726#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:12:34,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {85721#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85726#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:34,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {85721#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85721#true} is VALID [2022-04-28 10:12:34,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {85721#true} call #t~ret13 := main(); {85721#true} is VALID [2022-04-28 10:12:34,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85721#true} {85721#true} #72#return; {85721#true} is VALID [2022-04-28 10:12:34,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {85721#true} assume true; {85721#true} is VALID [2022-04-28 10:12:34,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {85721#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); {85721#true} is VALID [2022-04-28 10:12:34,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {85721#true} call ULTIMATE.init(); {85721#true} is VALID [2022-04-28 10:12:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:12:34,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838500904] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:34,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:34,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 24 [2022-04-28 10:12:34,637 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:34,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [439523386] [2022-04-28 10:12:34,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [439523386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:34,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:34,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:12:34,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613013630] [2022-04-28 10:12:34,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:34,638 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 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 36 [2022-04-28 10:12:34,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:34,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:34,663 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-28 10:12:34,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:12:34,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:34,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:12:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:12:34,663 INFO L87 Difference]: Start difference. First operand 344 states and 468 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:37,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:37,463 INFO L93 Difference]: Finished difference Result 400 states and 553 transitions. [2022-04-28 10:12:37,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:12:37,463 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 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 36 [2022-04-28 10:12:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 91 transitions. [2022-04-28 10:12:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 91 transitions. [2022-04-28 10:12:37,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 91 transitions. [2022-04-28 10:12:37,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:37,562 INFO L225 Difference]: With dead ends: 400 [2022-04-28 10:12:37,562 INFO L226 Difference]: Without dead ends: 395 [2022-04-28 10:12:37,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=1093, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:12:37,563 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 74 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:37,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 73 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:12:37,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-04-28 10:12:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 382. [2022-04-28 10:12:39,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:39,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:39,097 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:39,097 INFO L87 Difference]: Start difference. First operand 395 states. Second operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:39,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:39,103 INFO L93 Difference]: Finished difference Result 395 states and 542 transitions. [2022-04-28 10:12:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 542 transitions. [2022-04-28 10:12:39,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:39,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:39,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 3 states have call successors, (3), 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 395 states. [2022-04-28 10:12:39,104 INFO L87 Difference]: Start difference. First operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 3 states have call successors, (3), 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 395 states. [2022-04-28 10:12:39,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:39,109 INFO L93 Difference]: Finished difference Result 395 states and 542 transitions. [2022-04-28 10:12:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 542 transitions. [2022-04-28 10:12:39,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:39,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:39,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:39,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 522 transitions. [2022-04-28 10:12:39,115 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 522 transitions. Word has length 36 [2022-04-28 10:12:39,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:39,116 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 522 transitions. [2022-04-28 10:12:39,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:39,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 382 states and 522 transitions. [2022-04-28 10:12:41,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 522 transitions. [2022-04-28 10:12:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:12:41,659 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:41,659 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:41,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:41,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-04-28 10:12:41,863 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:41,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:41,863 INFO L85 PathProgramCache]: Analyzing trace with hash 500352545, now seen corresponding path program 41 times [2022-04-28 10:12:41,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:41,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [675975423] [2022-04-28 10:12:41,865 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:41,865 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:41,865 INFO L85 PathProgramCache]: Analyzing trace with hash 500352545, now seen corresponding path program 42 times [2022-04-28 10:12:41,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:41,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783884136] [2022-04-28 10:12:41,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:41,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:42,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:42,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {88373#(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); {88345#true} is VALID [2022-04-28 10:12:42,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {88345#true} assume true; {88345#true} is VALID [2022-04-28 10:12:42,296 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88345#true} {88345#true} #72#return; {88345#true} is VALID [2022-04-28 10:12:42,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {88345#true} call ULTIMATE.init(); {88373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:42,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {88373#(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); {88345#true} is VALID [2022-04-28 10:12:42,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {88345#true} assume true; {88345#true} is VALID [2022-04-28 10:12:42,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88345#true} {88345#true} #72#return; {88345#true} is VALID [2022-04-28 10:12:42,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {88345#true} call #t~ret13 := main(); {88345#true} is VALID [2022-04-28 10:12:42,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {88345#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {88350#(= main_~y~0 0)} is VALID [2022-04-28 10:12:42,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {88350#(= 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; {88351#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:42,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {88351#(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; {88352#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:42,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {88352#(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; {88353#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:42,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {88353#(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; {88354#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:42,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {88354#(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; {88355#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:42,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {88355#(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; {88356#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:42,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {88356#(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; {88357#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:42,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {88357#(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; {88358#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:42,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {88358#(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; {88359#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:42,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {88359#(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; {88360#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:42,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {88360#(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; {88361#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:42,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {88361#(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; {88362#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:42,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {88362#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88363#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:42,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {88363#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88364#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:42,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {88364#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88365#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:42,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {88365#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88366#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:42,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {88366#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88367#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:42,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {88367#(and (<= main_~y~0 17) (<= 17 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; {88368#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:42,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {88368#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88369#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:42,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {88369#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88370#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:42,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {88370#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88371#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:12:42,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {88371#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {88371#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:12:42,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {88371#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {88372#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} is VALID [2022-04-28 10:12:42,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {88372#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {88346#false} is VALID [2022-04-28 10:12:42,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {88346#false} assume !(~y~0 % 4294967296 > 0); {88346#false} is VALID [2022-04-28 10:12:42,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {88346#false} assume !(~x~0 % 4294967296 > 0); {88346#false} is VALID [2022-04-28 10:12:42,310 INFO L272 TraceCheckUtils]: 32: Hoare triple {88346#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {88346#false} is VALID [2022-04-28 10:12:42,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {88346#false} ~cond := #in~cond; {88346#false} is VALID [2022-04-28 10:12:42,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {88346#false} assume 0 == ~cond; {88346#false} is VALID [2022-04-28 10:12:42,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {88346#false} assume !false; {88346#false} is VALID [2022-04-28 10:12:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:42,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:42,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783884136] [2022-04-28 10:12:42,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783884136] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:42,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292277908] [2022-04-28 10:12:42,311 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:12:42,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:42,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:42,313 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:42,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-28 10:12:43,164 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 10:12:43,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:43,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:12:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:43,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:43,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {88345#true} call ULTIMATE.init(); {88345#true} is VALID [2022-04-28 10:12:43,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {88345#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); {88345#true} is VALID [2022-04-28 10:12:43,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {88345#true} assume true; {88345#true} is VALID [2022-04-28 10:12:43,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88345#true} {88345#true} #72#return; {88345#true} is VALID [2022-04-28 10:12:43,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {88345#true} call #t~ret13 := main(); {88345#true} is VALID [2022-04-28 10:12:43,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {88345#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {88350#(= main_~y~0 0)} is VALID [2022-04-28 10:12:43,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {88350#(= 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; {88351#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:43,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {88351#(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; {88352#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:43,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {88352#(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; {88353#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:43,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {88353#(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; {88354#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:43,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {88354#(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; {88355#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:43,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {88355#(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; {88356#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:43,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {88356#(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; {88357#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:43,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {88357#(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; {88358#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:43,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {88358#(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; {88359#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:43,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {88359#(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; {88360#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:43,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {88360#(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; {88361#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:43,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {88361#(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; {88362#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:43,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {88362#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88363#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:43,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {88363#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88364#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:43,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {88364#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88365#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:43,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {88365#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88366#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:43,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {88366#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88367#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:43,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {88367#(and (<= main_~y~0 17) (<= 17 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; {88368#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:43,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {88368#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88369#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:43,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {88369#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88370#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:43,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {88370#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88371#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:12:43,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {88371#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {88371#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:12:43,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {88371#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {88461#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:12:43,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {88461#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {88346#false} is VALID [2022-04-28 10:12:43,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {88346#false} assume !(~y~0 % 4294967296 > 0); {88346#false} is VALID [2022-04-28 10:12:43,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {88346#false} assume !(~x~0 % 4294967296 > 0); {88346#false} is VALID [2022-04-28 10:12:43,521 INFO L272 TraceCheckUtils]: 32: Hoare triple {88346#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {88346#false} is VALID [2022-04-28 10:12:43,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {88346#false} ~cond := #in~cond; {88346#false} is VALID [2022-04-28 10:12:43,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {88346#false} assume 0 == ~cond; {88346#false} is VALID [2022-04-28 10:12:43,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {88346#false} assume !false; {88346#false} is VALID [2022-04-28 10:12:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:43,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:44,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {88346#false} assume !false; {88346#false} is VALID [2022-04-28 10:12:44,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {88346#false} assume 0 == ~cond; {88346#false} is VALID [2022-04-28 10:12:44,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {88346#false} ~cond := #in~cond; {88346#false} is VALID [2022-04-28 10:12:44,432 INFO L272 TraceCheckUtils]: 32: Hoare triple {88346#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {88346#false} is VALID [2022-04-28 10:12:44,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {88346#false} assume !(~x~0 % 4294967296 > 0); {88346#false} is VALID [2022-04-28 10:12:44,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {88346#false} assume !(~y~0 % 4294967296 > 0); {88346#false} is VALID [2022-04-28 10:12:44,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {88501#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {88346#false} is VALID [2022-04-28 10:12:44,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {88505#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {88501#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:44,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {88505#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {88505#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:44,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {88512#(< 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; {88505#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:44,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {88516#(< 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; {88512#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:44,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {88520#(< 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; {88516#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:44,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {88524#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88520#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:44,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {88528#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88524#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:44,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {88532#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88528#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:44,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {88536#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88532#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:44,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {88540#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88536#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:44,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {88544#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88540#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:44,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {88548#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88544#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:44,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {88552#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88548#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:44,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {88556#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88552#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:44,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {88560#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88556#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:12:44,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {88564#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88560#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:12:44,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {88568#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88564#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:12:44,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {88572#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88568#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:12:44,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {88576#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88572#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:12:44,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {88580#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88576#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:12:44,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {88584#(< 0 (mod (+ 19 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; {88580#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:12:44,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {88588#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88584#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:44,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {88592#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88588#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:12:44,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {88345#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {88592#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:12:44,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {88345#true} call #t~ret13 := main(); {88345#true} is VALID [2022-04-28 10:12:44,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88345#true} {88345#true} #72#return; {88345#true} is VALID [2022-04-28 10:12:44,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {88345#true} assume true; {88345#true} is VALID [2022-04-28 10:12:44,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {88345#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); {88345#true} is VALID [2022-04-28 10:12:44,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {88345#true} call ULTIMATE.init(); {88345#true} is VALID [2022-04-28 10:12:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:44,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292277908] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:44,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:44,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:12:44,451 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:44,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [675975423] [2022-04-28 10:12:44,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [675975423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:44,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:44,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:12:44,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417528023] [2022-04-28 10:12:44,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:44,452 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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 36 [2022-04-28 10:12:44,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:44,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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-28 10:12:44,478 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-28 10:12:44,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:12:44,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:44,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:12:44,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=1867, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:12:44,479 INFO L87 Difference]: Start difference. First operand 382 states and 522 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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-28 10:12:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:51,032 INFO L93 Difference]: Finished difference Result 612 states and 948 transitions. [2022-04-28 10:12:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:12:51,032 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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 36 [2022-04-28 10:12:51,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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-28 10:12:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 162 transitions. [2022-04-28 10:12:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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-28 10:12:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 162 transitions. [2022-04-28 10:12:51,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 162 transitions. [2022-04-28 10:12:51,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:51,187 INFO L225 Difference]: With dead ends: 612 [2022-04-28 10:12:51,187 INFO L226 Difference]: Without dead ends: 584 [2022-04-28 10:12:51,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1183, Invalid=4073, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 10:12:51,188 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 146 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2599 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 2690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:51,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 176 Invalid, 2690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2599 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 10:12:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-04-28 10:12:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 401. [2022-04-28 10:12:52,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:52,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:52,784 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:52,784 INFO L87 Difference]: Start difference. First operand 584 states. Second operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:52,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:52,794 INFO L93 Difference]: Finished difference Result 584 states and 734 transitions. [2022-04-28 10:12:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 734 transitions. [2022-04-28 10:12:52,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:52,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:52,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 3 states have call successors, (3), 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 584 states. [2022-04-28 10:12:52,795 INFO L87 Difference]: Start difference. First operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 3 states have call successors, (3), 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 584 states. [2022-04-28 10:12:52,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:52,806 INFO L93 Difference]: Finished difference Result 584 states and 734 transitions. [2022-04-28 10:12:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 734 transitions. [2022-04-28 10:12:52,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:52,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:52,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:52,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 550 transitions. [2022-04-28 10:12:52,814 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 550 transitions. Word has length 36 [2022-04-28 10:12:52,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:52,814 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 550 transitions. [2022-04-28 10:12:52,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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-28 10:12:52,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 550 transitions. [2022-04-28 10:12:55,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 550 edges. 550 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:55,252 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 550 transitions. [2022-04-28 10:12:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:12:55,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:55,253 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:55,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:55,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:55,453 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:55,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:55,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1873101146, now seen corresponding path program 55 times [2022-04-28 10:12:55,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:55,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1063284006] [2022-04-28 10:12:55,456 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:55,456 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:55,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1873101146, now seen corresponding path program 56 times [2022-04-28 10:12:55,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:55,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043037921] [2022-04-28 10:12:55,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:55,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:55,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:55,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {91871#(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); {91853#true} is VALID [2022-04-28 10:12:55,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {91853#true} assume true; {91853#true} is VALID [2022-04-28 10:12:55,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91853#true} {91853#true} #72#return; {91853#true} is VALID [2022-04-28 10:12:55,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {91853#true} call ULTIMATE.init(); {91871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:55,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {91871#(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); {91853#true} is VALID [2022-04-28 10:12:55,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {91853#true} assume true; {91853#true} is VALID [2022-04-28 10:12:55,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91853#true} {91853#true} #72#return; {91853#true} is VALID [2022-04-28 10:12:55,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {91853#true} call #t~ret13 := main(); {91853#true} is VALID [2022-04-28 10:12:55,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {91853#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91858#(= main_~y~0 0)} is VALID [2022-04-28 10:12:55,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {91858#(= 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; {91859#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:55,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {91859#(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; {91860#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:55,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {91860#(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; {91861#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:55,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {91861#(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; {91862#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:55,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {91862#(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; {91863#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:55,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {91863#(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; {91864#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:55,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {91864#(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; {91865#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:55,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {91865#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {91865#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:55,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {91865#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {91866#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:55,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {91866#(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; {91867#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:55,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {91867#(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; {91868#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:55,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {91868#(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; {91869#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:12:55,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {91869#(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; {91870#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:55,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {91870#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {91854#false} is VALID [2022-04-28 10:12:55,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:55,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:55,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:55,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:55,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:55,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:55,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:55,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {91854#false} assume !(~y~0 % 4294967296 > 0); {91854#false} is VALID [2022-04-28 10:12:55,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {91854#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {91854#false} is VALID [2022-04-28 10:12:55,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {91854#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {91854#false} is VALID [2022-04-28 10:12:55,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {91854#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {91854#false} is VALID [2022-04-28 10:12:55,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {91854#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {91854#false} is VALID [2022-04-28 10:12:55,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {91854#false} assume !(~x~0 % 4294967296 > 0); {91854#false} is VALID [2022-04-28 10:12:55,706 INFO L272 TraceCheckUtils]: 33: Hoare triple {91854#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {91854#false} is VALID [2022-04-28 10:12:55,706 INFO L290 TraceCheckUtils]: 34: Hoare triple {91854#false} ~cond := #in~cond; {91854#false} is VALID [2022-04-28 10:12:55,706 INFO L290 TraceCheckUtils]: 35: Hoare triple {91854#false} assume 0 == ~cond; {91854#false} is VALID [2022-04-28 10:12:55,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {91854#false} assume !false; {91854#false} is VALID [2022-04-28 10:12:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 10:12:55,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:55,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043037921] [2022-04-28 10:12:55,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043037921] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:55,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047091219] [2022-04-28 10:12:55,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:55,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:55,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:55,712 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:55,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-28 10:12:55,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:55,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:55,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 10:12:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:55,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:56,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {91853#true} call ULTIMATE.init(); {91853#true} is VALID [2022-04-28 10:12:56,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {91853#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); {91853#true} is VALID [2022-04-28 10:12:56,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {91853#true} assume true; {91853#true} is VALID [2022-04-28 10:12:56,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91853#true} {91853#true} #72#return; {91853#true} is VALID [2022-04-28 10:12:56,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {91853#true} call #t~ret13 := main(); {91853#true} is VALID [2022-04-28 10:12:56,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {91853#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91858#(= main_~y~0 0)} is VALID [2022-04-28 10:12:56,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {91858#(= 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; {91859#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:56,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {91859#(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; {91860#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:56,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {91860#(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; {91861#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:56,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {91861#(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; {91862#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:56,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {91862#(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; {91863#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:56,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {91863#(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; {91864#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:56,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {91864#(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; {91865#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:56,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {91865#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {91865#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:56,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {91865#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {91917#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:56,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {91917#(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; {91921#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:12:56,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {91921#(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; {91925#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:56,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {91925#(and (= main_~y~0 (+ main_~z~0 2)) (<= 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; {91929#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:56,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {91929#(and (= (+ (- 2) main_~y~0) (+ 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; {91933#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:12:56,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {91933#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {91854#false} is VALID [2022-04-28 10:12:56,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:56,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:56,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:56,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:56,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:56,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:56,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:56,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {91854#false} assume !(~y~0 % 4294967296 > 0); {91854#false} is VALID [2022-04-28 10:12:56,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {91854#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {91854#false} is VALID [2022-04-28 10:12:56,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {91854#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {91854#false} is VALID [2022-04-28 10:12:56,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {91854#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {91854#false} is VALID [2022-04-28 10:12:56,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {91854#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {91854#false} is VALID [2022-04-28 10:12:56,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {91854#false} assume !(~x~0 % 4294967296 > 0); {91854#false} is VALID [2022-04-28 10:12:56,108 INFO L272 TraceCheckUtils]: 33: Hoare triple {91854#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {91854#false} is VALID [2022-04-28 10:12:56,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {91854#false} ~cond := #in~cond; {91854#false} is VALID [2022-04-28 10:12:56,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {91854#false} assume 0 == ~cond; {91854#false} is VALID [2022-04-28 10:12:56,108 INFO L290 TraceCheckUtils]: 36: Hoare triple {91854#false} assume !false; {91854#false} is VALID [2022-04-28 10:12:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 10:12:56,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:56,476 INFO L290 TraceCheckUtils]: 36: Hoare triple {91854#false} assume !false; {91854#false} is VALID [2022-04-28 10:12:56,477 INFO L290 TraceCheckUtils]: 35: Hoare triple {91854#false} assume 0 == ~cond; {91854#false} is VALID [2022-04-28 10:12:56,477 INFO L290 TraceCheckUtils]: 34: Hoare triple {91854#false} ~cond := #in~cond; {91854#false} is VALID [2022-04-28 10:12:56,477 INFO L272 TraceCheckUtils]: 33: Hoare triple {91854#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {91854#false} is VALID [2022-04-28 10:12:56,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {91854#false} assume !(~x~0 % 4294967296 > 0); {91854#false} is VALID [2022-04-28 10:12:56,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {91854#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {91854#false} is VALID [2022-04-28 10:12:56,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {91854#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {91854#false} is VALID [2022-04-28 10:12:56,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {91854#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {91854#false} is VALID [2022-04-28 10:12:56,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {91854#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {91854#false} is VALID [2022-04-28 10:12:56,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {91854#false} assume !(~y~0 % 4294967296 > 0); {91854#false} is VALID [2022-04-28 10:12:56,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:56,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {91854#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:56,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {92024#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91854#false} is VALID [2022-04-28 10:12:56,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {92028#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {92024#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:12:56,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {92032#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {92028#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:12:56,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {92036#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {92032#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:12:56,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {92040#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {92036#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:12:56,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {92044#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {92040#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:12:56,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {92048#(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; {92044#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:12:56,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {92052#(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; {92048#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:12:56,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {92056#(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; {92052#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:12:56,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {92060#(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; {92056#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:12:56,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {91853#true} ~z~0 := ~y~0; {92060#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:12:56,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {91853#true} assume !(~x~0 % 4294967296 > 0); {91853#true} is VALID [2022-04-28 10:12:56,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {91853#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91853#true} is VALID [2022-04-28 10:12:56,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {91853#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91853#true} is VALID [2022-04-28 10:12:56,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {91853#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91853#true} is VALID [2022-04-28 10:12:56,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {91853#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91853#true} is VALID [2022-04-28 10:12:56,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {91853#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91853#true} is VALID [2022-04-28 10:12:56,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {91853#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91853#true} is VALID [2022-04-28 10:12:56,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {91853#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91853#true} is VALID [2022-04-28 10:12:56,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {91853#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91853#true} is VALID [2022-04-28 10:12:56,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {91853#true} call #t~ret13 := main(); {91853#true} is VALID [2022-04-28 10:12:56,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91853#true} {91853#true} #72#return; {91853#true} is VALID [2022-04-28 10:12:56,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {91853#true} assume true; {91853#true} is VALID [2022-04-28 10:12:56,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {91853#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); {91853#true} is VALID [2022-04-28 10:12:56,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {91853#true} call ULTIMATE.init(); {91853#true} is VALID [2022-04-28 10:12:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-28 10:12:56,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047091219] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:56,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:56,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 12] total 31 [2022-04-28 10:12:56,487 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:56,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1063284006] [2022-04-28 10:12:56,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1063284006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:56,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:56,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:12:56,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238309749] [2022-04-28 10:12:56,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:56,488 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 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 37 [2022-04-28 10:12:56,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:56,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:56,519 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-28 10:12:56,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:12:56,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:56,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:12:56,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:12:56,519 INFO L87 Difference]: Start difference. First operand 401 states and 550 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:59,486 INFO L93 Difference]: Finished difference Result 466 states and 615 transitions. [2022-04-28 10:12:59,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:12:59,486 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 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 37 [2022-04-28 10:12:59,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2022-04-28 10:12:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2022-04-28 10:12:59,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 64 transitions. [2022-04-28 10:12:59,539 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-28 10:12:59,547 INFO L225 Difference]: With dead ends: 466 [2022-04-28 10:12:59,547 INFO L226 Difference]: Without dead ends: 448 [2022-04-28 10:12:59,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=290, Invalid=1966, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:12:59,548 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:59,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 75 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:12:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-04-28 10:13:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 401. [2022-04-28 10:13:01,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:01,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 448 states. Second operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:01,147 INFO L74 IsIncluded]: Start isIncluded. First operand 448 states. Second operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:01,147 INFO L87 Difference]: Start difference. First operand 448 states. Second operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:01,153 INFO L93 Difference]: Finished difference Result 448 states and 597 transitions. [2022-04-28 10:13:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 597 transitions. [2022-04-28 10:13:01,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:01,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:01,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 3 states have call successors, (3), 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 448 states. [2022-04-28 10:13:01,154 INFO L87 Difference]: Start difference. First operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 3 states have call successors, (3), 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 448 states. [2022-04-28 10:13:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:01,161 INFO L93 Difference]: Finished difference Result 448 states and 597 transitions. [2022-04-28 10:13:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 597 transitions. [2022-04-28 10:13:01,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:01,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:01,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:01,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 549 transitions. [2022-04-28 10:13:01,168 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 549 transitions. Word has length 37 [2022-04-28 10:13:01,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:01,168 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 549 transitions. [2022-04-28 10:13:01,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:01,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 549 transitions. [2022-04-28 10:13:03,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 549 edges. 549 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 549 transitions. [2022-04-28 10:13:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:13:03,792 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:03,792 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:03,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:03,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:03,992 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:03,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:03,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1394492966, now seen corresponding path program 25 times [2022-04-28 10:13:03,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:03,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1645527627] [2022-04-28 10:13:03,995 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:03,995 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1394492966, now seen corresponding path program 26 times [2022-04-28 10:13:03,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:03,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539532623] [2022-04-28 10:13:03,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:03,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:04,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:04,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {94793#(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); {94772#true} is VALID [2022-04-28 10:13:04,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {94772#true} assume true; {94772#true} is VALID [2022-04-28 10:13:04,248 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94772#true} {94772#true} #72#return; {94772#true} is VALID [2022-04-28 10:13:04,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {94772#true} call ULTIMATE.init(); {94793#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:04,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {94793#(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); {94772#true} is VALID [2022-04-28 10:13:04,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {94772#true} assume true; {94772#true} is VALID [2022-04-28 10:13:04,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94772#true} {94772#true} #72#return; {94772#true} is VALID [2022-04-28 10:13:04,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {94772#true} call #t~ret13 := main(); {94772#true} is VALID [2022-04-28 10:13:04,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {94772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94777#(= main_~y~0 0)} is VALID [2022-04-28 10:13:04,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {94777#(= 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; {94778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:04,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {94778#(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; {94779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:04,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {94779#(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; {94780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:04,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {94780#(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; {94781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:04,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {94781#(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; {94782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:04,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {94782#(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; {94783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:04,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {94783#(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; {94784#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:04,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {94784#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {94784#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:04,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {94784#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {94785#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:04,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {94785#(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; {94786#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:04,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {94786#(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; {94787#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:13:04,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {94787#(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; {94788#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:13:04,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {94788#(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; {94789#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:13:04,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {94789#(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; {94790#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:13:04,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {94790#(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; {94791#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:13:04,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {94791#(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; {94792#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:13:04,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {94792#(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; {94773#false} is VALID [2022-04-28 10:13:04,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {94773#false} assume !(~z~0 % 4294967296 > 0); {94773#false} is VALID [2022-04-28 10:13:04,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {94773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94773#false} is VALID [2022-04-28 10:13:04,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {94773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94773#false} is VALID [2022-04-28 10:13:04,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {94773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94773#false} is VALID [2022-04-28 10:13:04,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {94773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94773#false} is VALID [2022-04-28 10:13:04,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {94773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94773#false} is VALID [2022-04-28 10:13:04,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {94773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94773#false} is VALID [2022-04-28 10:13:04,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {94773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94773#false} is VALID [2022-04-28 10:13:04,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {94773#false} assume !(~y~0 % 4294967296 > 0); {94773#false} is VALID [2022-04-28 10:13:04,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {94773#false} assume !(~x~0 % 4294967296 > 0); {94773#false} is VALID [2022-04-28 10:13:04,259 INFO L272 TraceCheckUtils]: 33: Hoare triple {94773#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {94773#false} is VALID [2022-04-28 10:13:04,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {94773#false} ~cond := #in~cond; {94773#false} is VALID [2022-04-28 10:13:04,259 INFO L290 TraceCheckUtils]: 35: Hoare triple {94773#false} assume 0 == ~cond; {94773#false} is VALID [2022-04-28 10:13:04,259 INFO L290 TraceCheckUtils]: 36: Hoare triple {94773#false} assume !false; {94773#false} is VALID [2022-04-28 10:13:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:13:04,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:04,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539532623] [2022-04-28 10:13:04,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539532623] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:04,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38130030] [2022-04-28 10:13:04,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:13:04,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:04,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:04,268 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:04,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-28 10:13:04,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:13:04,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:04,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 10:13:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:04,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:04,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {94772#true} call ULTIMATE.init(); {94772#true} is VALID [2022-04-28 10:13:04,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {94772#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); {94772#true} is VALID [2022-04-28 10:13:04,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {94772#true} assume true; {94772#true} is VALID [2022-04-28 10:13:04,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94772#true} {94772#true} #72#return; {94772#true} is VALID [2022-04-28 10:13:04,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {94772#true} call #t~ret13 := main(); {94772#true} is VALID [2022-04-28 10:13:04,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {94772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94777#(= main_~y~0 0)} is VALID [2022-04-28 10:13:04,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {94777#(= 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; {94778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:04,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {94778#(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; {94779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:04,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {94779#(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; {94780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:04,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {94780#(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; {94781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:04,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {94781#(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; {94782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:04,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {94782#(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; {94783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:04,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {94783#(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; {94784#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:04,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {94784#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {94784#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:04,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {94784#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {94839#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:04,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {94839#(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; {94843#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:13:04,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {94843#(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; {94847#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:13:04,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {94847#(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; {94851#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:04,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {94851#(and (= (+ (- 2) main_~y~0) (+ 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; {94855#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:13:04,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {94855#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 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; {94859#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:04,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {94859#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 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; {94863#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 4)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:04,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {94863#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 4)) (<= 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; {94867#(and (= (+ (- 2) main_~y~0) (+ 5 main_~z~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:04,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {94867#(and (= (+ (- 2) main_~y~0) (+ 5 main_~z~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; {94773#false} is VALID [2022-04-28 10:13:04,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {94773#false} assume !(~z~0 % 4294967296 > 0); {94773#false} is VALID [2022-04-28 10:13:04,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {94773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94773#false} is VALID [2022-04-28 10:13:04,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {94773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94773#false} is VALID [2022-04-28 10:13:04,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {94773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94773#false} is VALID [2022-04-28 10:13:04,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {94773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94773#false} is VALID [2022-04-28 10:13:04,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {94773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94773#false} is VALID [2022-04-28 10:13:04,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {94773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94773#false} is VALID [2022-04-28 10:13:04,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {94773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94773#false} is VALID [2022-04-28 10:13:04,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {94773#false} assume !(~y~0 % 4294967296 > 0); {94773#false} is VALID [2022-04-28 10:13:04,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {94773#false} assume !(~x~0 % 4294967296 > 0); {94773#false} is VALID [2022-04-28 10:13:04,695 INFO L272 TraceCheckUtils]: 33: Hoare triple {94773#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {94773#false} is VALID [2022-04-28 10:13:04,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {94773#false} ~cond := #in~cond; {94773#false} is VALID [2022-04-28 10:13:04,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {94773#false} assume 0 == ~cond; {94773#false} is VALID [2022-04-28 10:13:04,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {94773#false} assume !false; {94773#false} is VALID [2022-04-28 10:13:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:13:04,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:05,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {94773#false} assume !false; {94773#false} is VALID [2022-04-28 10:13:05,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {94773#false} assume 0 == ~cond; {94773#false} is VALID [2022-04-28 10:13:05,275 INFO L290 TraceCheckUtils]: 34: Hoare triple {94773#false} ~cond := #in~cond; {94773#false} is VALID [2022-04-28 10:13:05,275 INFO L272 TraceCheckUtils]: 33: Hoare triple {94773#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {94773#false} is VALID [2022-04-28 10:13:05,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {94773#false} assume !(~x~0 % 4294967296 > 0); {94773#false} is VALID [2022-04-28 10:13:05,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {94928#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {94773#false} is VALID [2022-04-28 10:13:05,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {94932#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94928#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:05,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {94936#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94932#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:05,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {94940#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94936#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:05,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {94944#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94940#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:05,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {94948#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94944#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:05,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {94952#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94948#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:05,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {94956#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94952#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:05,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {94956#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~z~0 % 4294967296 > 0); {94956#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:13:05,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {94963#(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; {94956#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:13:05,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {94967#(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; {94963#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:13:05,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {94971#(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; {94967#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:13:05,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {94975#(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; {94971#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:13:05,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {94979#(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; {94975#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:13:05,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {94983#(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; {94979#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:13:05,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {94987#(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; {94983#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:13:05,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {94991#(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; {94987#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:13:05,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {94772#true} ~z~0 := ~y~0; {94991#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-28 10:13:05,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {94772#true} assume !(~x~0 % 4294967296 > 0); {94772#true} is VALID [2022-04-28 10:13:05,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {94772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94772#true} is VALID [2022-04-28 10:13:05,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {94772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94772#true} is VALID [2022-04-28 10:13:05,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {94772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94772#true} is VALID [2022-04-28 10:13:05,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {94772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94772#true} is VALID [2022-04-28 10:13:05,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {94772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94772#true} is VALID [2022-04-28 10:13:05,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {94772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94772#true} is VALID [2022-04-28 10:13:05,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {94772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94772#true} is VALID [2022-04-28 10:13:05,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {94772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94772#true} is VALID [2022-04-28 10:13:05,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {94772#true} call #t~ret13 := main(); {94772#true} is VALID [2022-04-28 10:13:05,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94772#true} {94772#true} #72#return; {94772#true} is VALID [2022-04-28 10:13:05,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {94772#true} assume true; {94772#true} is VALID [2022-04-28 10:13:05,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {94772#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); {94772#true} is VALID [2022-04-28 10:13:05,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {94772#true} call ULTIMATE.init(); {94772#true} is VALID [2022-04-28 10:13:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:13:05,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38130030] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:05,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:05,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 43 [2022-04-28 10:13:05,292 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:05,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1645527627] [2022-04-28 10:13:05,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1645527627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:05,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:05,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:13:05,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854128080] [2022-04-28 10:13:05,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:05,292 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 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 37 [2022-04-28 10:13:05,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:05,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:05,313 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-28 10:13:05,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:13:05,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:05,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:13:05,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:13:05,314 INFO L87 Difference]: Start difference. First operand 401 states and 549 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:09,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:09,082 INFO L93 Difference]: Finished difference Result 469 states and 618 transitions. [2022-04-28 10:13:09,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 10:13:09,082 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 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 37 [2022-04-28 10:13:09,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 79 transitions. [2022-04-28 10:13:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 79 transitions. [2022-04-28 10:13:09,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 79 transitions. [2022-04-28 10:13:09,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:09,156 INFO L225 Difference]: With dead ends: 469 [2022-04-28 10:13:09,156 INFO L226 Difference]: Without dead ends: 426 [2022-04-28 10:13:09,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=954, Invalid=5052, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 10:13:09,157 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:09,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 99 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:13:09,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-04-28 10:13:10,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 400. [2022-04-28 10:13:10,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:10,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 426 states. Second operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:10,768 INFO L74 IsIncluded]: Start isIncluded. First operand 426 states. Second operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:10,768 INFO L87 Difference]: Start difference. First operand 426 states. Second operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:10,774 INFO L93 Difference]: Finished difference Result 426 states and 571 transitions. [2022-04-28 10:13:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 571 transitions. [2022-04-28 10:13:10,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:10,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:10,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 3 states have call successors, (3), 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 426 states. [2022-04-28 10:13:10,775 INFO L87 Difference]: Start difference. First operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 3 states have call successors, (3), 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 426 states. [2022-04-28 10:13:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:10,781 INFO L93 Difference]: Finished difference Result 426 states and 571 transitions. [2022-04-28 10:13:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 571 transitions. [2022-04-28 10:13:10,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:10,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:10,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:10,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 544 transitions. [2022-04-28 10:13:10,788 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 544 transitions. Word has length 37 [2022-04-28 10:13:10,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:10,788 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 544 transitions. [2022-04-28 10:13:10,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:10,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 544 transitions. [2022-04-28 10:13:12,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 544 edges. 544 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 544 transitions. [2022-04-28 10:13:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:13:12,922 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:12,922 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:12,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:13,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-04-28 10:13:13,123 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:13,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:13,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1905915000, now seen corresponding path program 57 times [2022-04-28 10:13:13,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:13,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [13331249] [2022-04-28 10:13:13,127 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:13,127 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:13,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1905915000, now seen corresponding path program 58 times [2022-04-28 10:13:13,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:13,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398405144] [2022-04-28 10:13:13,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:13,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:13,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:13,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {97717#(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); {97699#true} is VALID [2022-04-28 10:13:13,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {97699#true} assume true; {97699#true} is VALID [2022-04-28 10:13:13,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97699#true} {97699#true} #72#return; {97699#true} is VALID [2022-04-28 10:13:13,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {97699#true} call ULTIMATE.init(); {97717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:13,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {97717#(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); {97699#true} is VALID [2022-04-28 10:13:13,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {97699#true} assume true; {97699#true} is VALID [2022-04-28 10:13:13,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97699#true} {97699#true} #72#return; {97699#true} is VALID [2022-04-28 10:13:13,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {97699#true} call #t~ret13 := main(); {97699#true} is VALID [2022-04-28 10:13:13,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {97699#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97704#(= main_~y~0 0)} is VALID [2022-04-28 10:13:13,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {97704#(= 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; {97705#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:13,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {97705#(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; {97706#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:13,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {97706#(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; {97707#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:13,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {97707#(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; {97708#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:13,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {97708#(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; {97709#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:13,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {97709#(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; {97710#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:13,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {97710#(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; {97711#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:13,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {97711#(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; {97712#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:13,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {97712#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {97712#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:13,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {97712#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {97713#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:13,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {97713#(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; {97714#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:13,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {97714#(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; {97715#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:13,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {97715#(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; {97716#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:13:13,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {97716#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {97700#false} is VALID [2022-04-28 10:13:13,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {97700#false} assume !(~y~0 % 4294967296 > 0); {97700#false} is VALID [2022-04-28 10:13:13,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {97700#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {97700#false} is VALID [2022-04-28 10:13:13,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {97700#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {97700#false} is VALID [2022-04-28 10:13:13,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {97700#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {97700#false} is VALID [2022-04-28 10:13:13,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {97700#false} assume !(~x~0 % 4294967296 > 0); {97700#false} is VALID [2022-04-28 10:13:13,349 INFO L272 TraceCheckUtils]: 33: Hoare triple {97700#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {97700#false} is VALID [2022-04-28 10:13:13,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {97700#false} ~cond := #in~cond; {97700#false} is VALID [2022-04-28 10:13:13,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {97700#false} assume 0 == ~cond; {97700#false} is VALID [2022-04-28 10:13:13,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {97700#false} assume !false; {97700#false} is VALID [2022-04-28 10:13:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:13:13,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:13,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398405144] [2022-04-28 10:13:13,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398405144] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:13,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601505728] [2022-04-28 10:13:13,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:13,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:13,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:13,351 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:13,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-28 10:13:13,394 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:13,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:13,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:13:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:13,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:13,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {97699#true} call ULTIMATE.init(); {97699#true} is VALID [2022-04-28 10:13:13,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {97699#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); {97699#true} is VALID [2022-04-28 10:13:13,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {97699#true} assume true; {97699#true} is VALID [2022-04-28 10:13:13,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97699#true} {97699#true} #72#return; {97699#true} is VALID [2022-04-28 10:13:13,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {97699#true} call #t~ret13 := main(); {97699#true} is VALID [2022-04-28 10:13:13,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {97699#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97704#(= main_~y~0 0)} is VALID [2022-04-28 10:13:13,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {97704#(= 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; {97705#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:13,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {97705#(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; {97706#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:13,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {97706#(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; {97707#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:13,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {97707#(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; {97708#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:13,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {97708#(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; {97709#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:13,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {97709#(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; {97710#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:13,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {97710#(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; {97711#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:13,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {97711#(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; {97712#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:13,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {97712#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {97712#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:13,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {97712#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {97713#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:13,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {97713#(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; {97714#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:13,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {97714#(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; {97715#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:13,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {97715#(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; {97775#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:13:13,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {97775#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {97700#false} is VALID [2022-04-28 10:13:13,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:13,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {97700#false} assume !(~y~0 % 4294967296 > 0); {97700#false} is VALID [2022-04-28 10:13:13,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {97700#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {97700#false} is VALID [2022-04-28 10:13:13,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {97700#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {97700#false} is VALID [2022-04-28 10:13:13,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {97700#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {97700#false} is VALID [2022-04-28 10:13:13,666 INFO L290 TraceCheckUtils]: 32: Hoare triple {97700#false} assume !(~x~0 % 4294967296 > 0); {97700#false} is VALID [2022-04-28 10:13:13,666 INFO L272 TraceCheckUtils]: 33: Hoare triple {97700#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {97700#false} is VALID [2022-04-28 10:13:13,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {97700#false} ~cond := #in~cond; {97700#false} is VALID [2022-04-28 10:13:13,666 INFO L290 TraceCheckUtils]: 35: Hoare triple {97700#false} assume 0 == ~cond; {97700#false} is VALID [2022-04-28 10:13:13,667 INFO L290 TraceCheckUtils]: 36: Hoare triple {97700#false} assume !false; {97700#false} is VALID [2022-04-28 10:13:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:13:13,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:14,049 INFO L290 TraceCheckUtils]: 36: Hoare triple {97700#false} assume !false; {97700#false} is VALID [2022-04-28 10:13:14,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {97700#false} assume 0 == ~cond; {97700#false} is VALID [2022-04-28 10:13:14,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {97700#false} ~cond := #in~cond; {97700#false} is VALID [2022-04-28 10:13:14,049 INFO L272 TraceCheckUtils]: 33: Hoare triple {97700#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {97700#false} is VALID [2022-04-28 10:13:14,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {97700#false} assume !(~x~0 % 4294967296 > 0); {97700#false} is VALID [2022-04-28 10:13:14,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {97700#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {97700#false} is VALID [2022-04-28 10:13:14,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {97700#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {97700#false} is VALID [2022-04-28 10:13:14,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {97700#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {97700#false} is VALID [2022-04-28 10:13:14,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {97700#false} assume !(~y~0 % 4294967296 > 0); {97700#false} is VALID [2022-04-28 10:13:14,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:14,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:14,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:14,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:14,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:14,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:14,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:14,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {97700#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97700#false} is VALID [2022-04-28 10:13:14,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {97881#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {97700#false} is VALID [2022-04-28 10:13:14,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {97885#(< 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; {97881#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:14,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {97889#(< 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; {97885#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:14,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {97893#(< 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; {97889#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:14,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {97897#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {97893#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:14,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {97897#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {97897#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:14,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {97904#(< 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; {97897#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:14,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {97908#(< 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; {97904#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:14,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {97912#(< 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; {97908#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:14,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {97916#(< 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; {97912#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:14,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {97920#(< 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; {97916#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:14,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {97924#(< 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; {97920#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:14,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {97928#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97924#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:14,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {97932#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97928#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:14,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {97699#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97932#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:14,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {97699#true} call #t~ret13 := main(); {97699#true} is VALID [2022-04-28 10:13:14,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97699#true} {97699#true} #72#return; {97699#true} is VALID [2022-04-28 10:13:14,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {97699#true} assume true; {97699#true} is VALID [2022-04-28 10:13:14,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {97699#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); {97699#true} is VALID [2022-04-28 10:13:14,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {97699#true} call ULTIMATE.init(); {97699#true} is VALID [2022-04-28 10:13:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:13:14,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601505728] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:14,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:14,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:13:14,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:14,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [13331249] [2022-04-28 10:13:14,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [13331249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:14,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:14,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:13:14,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543589426] [2022-04-28 10:13:14,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:14,063 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 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 37 [2022-04-28 10:13:14,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:14,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:14,082 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-28 10:13:14,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:13:14,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:14,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:13:14,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:13:14,082 INFO L87 Difference]: Start difference. First operand 400 states and 544 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:17,251 INFO L93 Difference]: Finished difference Result 478 states and 622 transitions. [2022-04-28 10:13:17,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:13:17,251 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 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 37 [2022-04-28 10:13:17,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions. [2022-04-28 10:13:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions. [2022-04-28 10:13:17,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 70 transitions. [2022-04-28 10:13:17,310 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-28 10:13:17,319 INFO L225 Difference]: With dead ends: 478 [2022-04-28 10:13:17,319 INFO L226 Difference]: Without dead ends: 460 [2022-04-28 10:13:17,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=454, Invalid=1802, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:13:17,319 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:17,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 89 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:13:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-04-28 10:13:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 400. [2022-04-28 10:13:18,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:18,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 460 states. Second operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:18,927 INFO L74 IsIncluded]: Start isIncluded. First operand 460 states. Second operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:18,927 INFO L87 Difference]: Start difference. First operand 460 states. Second operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:18,934 INFO L93 Difference]: Finished difference Result 460 states and 604 transitions. [2022-04-28 10:13:18,934 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 604 transitions. [2022-04-28 10:13:18,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:18,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:18,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 3 states have call successors, (3), 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 460 states. [2022-04-28 10:13:18,934 INFO L87 Difference]: Start difference. First operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 3 states have call successors, (3), 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 460 states. [2022-04-28 10:13:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:18,941 INFO L93 Difference]: Finished difference Result 460 states and 604 transitions. [2022-04-28 10:13:18,941 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 604 transitions. [2022-04-28 10:13:18,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:18,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:18,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:18,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 543 transitions. [2022-04-28 10:13:18,948 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 543 transitions. Word has length 37 [2022-04-28 10:13:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:18,948 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 543 transitions. [2022-04-28 10:13:18,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:18,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 543 transitions. [2022-04-28 10:13:21,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 543 edges. 543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:21,757 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 543 transitions. [2022-04-28 10:13:21,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:13:21,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:21,758 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:21,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:21,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-04-28 10:13:21,959 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:21,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:21,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1335082086, now seen corresponding path program 59 times [2022-04-28 10:13:21,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:21,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1037253373] [2022-04-28 10:13:21,962 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:21,962 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:21,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1335082086, now seen corresponding path program 60 times [2022-04-28 10:13:21,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:21,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401155609] [2022-04-28 10:13:21,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:21,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:22,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:22,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {100683#(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); {100665#true} is VALID [2022-04-28 10:13:22,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {100665#true} assume true; {100665#true} is VALID [2022-04-28 10:13:22,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100665#true} {100665#true} #72#return; {100665#true} is VALID [2022-04-28 10:13:22,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {100665#true} call ULTIMATE.init(); {100683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:22,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {100683#(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); {100665#true} is VALID [2022-04-28 10:13:22,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {100665#true} assume true; {100665#true} is VALID [2022-04-28 10:13:22,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100665#true} {100665#true} #72#return; {100665#true} is VALID [2022-04-28 10:13:22,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {100665#true} call #t~ret13 := main(); {100665#true} is VALID [2022-04-28 10:13:22,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {100665#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {100670#(= main_~y~0 0)} is VALID [2022-04-28 10:13:22,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {100670#(= 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; {100671#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:22,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {100671#(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; {100672#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:22,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {100672#(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; {100673#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:22,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {100673#(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; {100674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:22,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {100674#(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; {100675#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:22,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {100675#(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; {100676#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:22,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {100676#(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; {100677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:22,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {100677#(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; {100678#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:22,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {100678#(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; {100679#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:22,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {100679#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {100679#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:22,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {100679#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {100680#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:13:22,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {100680#(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; {100681#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:22,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {100681#(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; {100682#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:13:22,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {100682#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {100666#false} is VALID [2022-04-28 10:13:22,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {100666#false} assume !(~y~0 % 4294967296 > 0); {100666#false} is VALID [2022-04-28 10:13:22,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {100666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {100666#false} is VALID [2022-04-28 10:13:22,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {100666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {100666#false} is VALID [2022-04-28 10:13:22,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {100666#false} assume !(~x~0 % 4294967296 > 0); {100666#false} is VALID [2022-04-28 10:13:22,220 INFO L272 TraceCheckUtils]: 33: Hoare triple {100666#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {100666#false} is VALID [2022-04-28 10:13:22,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {100666#false} ~cond := #in~cond; {100666#false} is VALID [2022-04-28 10:13:22,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {100666#false} assume 0 == ~cond; {100666#false} is VALID [2022-04-28 10:13:22,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {100666#false} assume !false; {100666#false} is VALID [2022-04-28 10:13:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 10:13:22,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:22,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401155609] [2022-04-28 10:13:22,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401155609] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:22,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817921936] [2022-04-28 10:13:22,221 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:22,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:22,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:22,222 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:22,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-28 10:13:22,331 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:13:22,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:22,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:13:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:22,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:22,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {100665#true} call ULTIMATE.init(); {100665#true} is VALID [2022-04-28 10:13:22,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {100665#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); {100665#true} is VALID [2022-04-28 10:13:22,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {100665#true} assume true; {100665#true} is VALID [2022-04-28 10:13:22,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100665#true} {100665#true} #72#return; {100665#true} is VALID [2022-04-28 10:13:22,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {100665#true} call #t~ret13 := main(); {100665#true} is VALID [2022-04-28 10:13:22,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {100665#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {100670#(= main_~y~0 0)} is VALID [2022-04-28 10:13:22,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {100670#(= 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; {100671#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:22,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {100671#(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; {100672#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:22,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {100672#(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; {100673#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:22,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {100673#(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; {100674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:22,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {100674#(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; {100675#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:22,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {100675#(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; {100676#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:22,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {100676#(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; {100677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:22,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {100677#(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; {100678#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:22,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {100678#(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; {100679#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:22,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {100679#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {100679#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:22,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {100679#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {100680#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:13:22,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {100680#(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; {100681#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:22,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {100681#(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; {100741#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:22,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {100741#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {100666#false} is VALID [2022-04-28 10:13:22,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {100666#false} assume !(~y~0 % 4294967296 > 0); {100666#false} is VALID [2022-04-28 10:13:22,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {100666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {100666#false} is VALID [2022-04-28 10:13:22,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {100666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {100666#false} is VALID [2022-04-28 10:13:22,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {100666#false} assume !(~x~0 % 4294967296 > 0); {100666#false} is VALID [2022-04-28 10:13:22,586 INFO L272 TraceCheckUtils]: 33: Hoare triple {100666#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {100666#false} is VALID [2022-04-28 10:13:22,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {100666#false} ~cond := #in~cond; {100666#false} is VALID [2022-04-28 10:13:22,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {100666#false} assume 0 == ~cond; {100666#false} is VALID [2022-04-28 10:13:22,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {100666#false} assume !false; {100666#false} is VALID [2022-04-28 10:13:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 10:13:22,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:22,939 INFO L290 TraceCheckUtils]: 36: Hoare triple {100666#false} assume !false; {100666#false} is VALID [2022-04-28 10:13:22,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {100666#false} assume 0 == ~cond; {100666#false} is VALID [2022-04-28 10:13:22,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {100666#false} ~cond := #in~cond; {100666#false} is VALID [2022-04-28 10:13:22,939 INFO L272 TraceCheckUtils]: 33: Hoare triple {100666#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {100666#false} is VALID [2022-04-28 10:13:22,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {100666#false} assume !(~x~0 % 4294967296 > 0); {100666#false} is VALID [2022-04-28 10:13:22,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {100666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {100666#false} is VALID [2022-04-28 10:13:22,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {100666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {100666#false} is VALID [2022-04-28 10:13:22,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {100666#false} assume !(~y~0 % 4294967296 > 0); {100666#false} is VALID [2022-04-28 10:13:22,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {100666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {100666#false} is VALID [2022-04-28 10:13:22,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {100847#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {100666#false} is VALID [2022-04-28 10:13:22,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {100851#(< 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; {100847#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:22,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {100855#(< 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; {100851#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:22,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {100859#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {100855#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:22,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {100859#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {100859#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:22,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {100866#(< 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; {100859#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:22,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {100870#(< 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; {100866#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:22,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {100874#(< 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; {100870#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:22,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {100878#(< 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; {100874#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:22,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {100882#(< 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; {100878#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:22,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {100886#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100882#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:22,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {100890#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100886#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:22,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {100894#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100890#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:22,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {100898#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100894#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:22,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {100665#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {100898#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:22,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {100665#true} call #t~ret13 := main(); {100665#true} is VALID [2022-04-28 10:13:22,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100665#true} {100665#true} #72#return; {100665#true} is VALID [2022-04-28 10:13:22,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {100665#true} assume true; {100665#true} is VALID [2022-04-28 10:13:22,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {100665#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); {100665#true} is VALID [2022-04-28 10:13:22,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {100665#true} call ULTIMATE.init(); {100665#true} is VALID [2022-04-28 10:13:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 10:13:22,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817921936] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:22,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:22,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:13:22,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:22,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1037253373] [2022-04-28 10:13:22,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1037253373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:22,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:22,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:13:22,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713617491] [2022-04-28 10:13:22,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:22,952 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 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 37 [2022-04-28 10:13:22,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:22,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:22,981 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-28 10:13:22,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:13:22,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:22,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:13:22,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:13:22,982 INFO L87 Difference]: Start difference. First operand 400 states and 543 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:26,170 INFO L93 Difference]: Finished difference Result 493 states and 636 transitions. [2022-04-28 10:13:26,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:13:26,170 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 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 37 [2022-04-28 10:13:26,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 73 transitions. [2022-04-28 10:13:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 73 transitions. [2022-04-28 10:13:26,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 73 transitions. [2022-04-28 10:13:26,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:26,240 INFO L225 Difference]: With dead ends: 493 [2022-04-28 10:13:26,240 INFO L226 Difference]: Without dead ends: 475 [2022-04-28 10:13:26,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=426, Invalid=1644, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:13:26,241 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:26,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 82 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:13:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-28 10:13:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 400. [2022-04-28 10:13:27,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:27,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:27,828 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:27,828 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:27,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:27,835 INFO L93 Difference]: Finished difference Result 475 states and 618 transitions. [2022-04-28 10:13:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 618 transitions. [2022-04-28 10:13:27,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:27,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:27,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 3 states have call successors, (3), 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 475 states. [2022-04-28 10:13:27,836 INFO L87 Difference]: Start difference. First operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 3 states have call successors, (3), 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 475 states. [2022-04-28 10:13:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:27,843 INFO L93 Difference]: Finished difference Result 475 states and 618 transitions. [2022-04-28 10:13:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 618 transitions. [2022-04-28 10:13:27,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:27,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:27,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:27,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 542 transitions. [2022-04-28 10:13:27,850 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 542 transitions. Word has length 37 [2022-04-28 10:13:27,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:27,851 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 542 transitions. [2022-04-28 10:13:27,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:27,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 542 transitions. [2022-04-28 10:13:29,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 542 edges. 542 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 542 transitions. [2022-04-28 10:13:29,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:13:29,970 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:29,970 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:29,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:30,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:30,171 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:30,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:30,171 INFO L85 PathProgramCache]: Analyzing trace with hash 208289464, now seen corresponding path program 61 times [2022-04-28 10:13:30,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:30,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2091952961] [2022-04-28 10:13:30,174 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:30,174 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:30,174 INFO L85 PathProgramCache]: Analyzing trace with hash 208289464, now seen corresponding path program 62 times [2022-04-28 10:13:30,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:30,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016540641] [2022-04-28 10:13:30,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:30,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:30,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:30,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {103705#(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); {103687#true} is VALID [2022-04-28 10:13:30,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {103687#true} assume true; {103687#true} is VALID [2022-04-28 10:13:30,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {103687#true} {103687#true} #72#return; {103687#true} is VALID [2022-04-28 10:13:30,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {103687#true} call ULTIMATE.init(); {103705#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:30,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {103705#(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); {103687#true} is VALID [2022-04-28 10:13:30,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {103687#true} assume true; {103687#true} is VALID [2022-04-28 10:13:30,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103687#true} {103687#true} #72#return; {103687#true} is VALID [2022-04-28 10:13:30,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {103687#true} call #t~ret13 := main(); {103687#true} is VALID [2022-04-28 10:13:30,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {103687#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {103692#(= main_~y~0 0)} is VALID [2022-04-28 10:13:30,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {103692#(= 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; {103693#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:30,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {103693#(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; {103694#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:30,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {103694#(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; {103695#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:30,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {103695#(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; {103696#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:30,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {103696#(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; {103697#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:30,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {103697#(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; {103698#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:30,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {103698#(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; {103699#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:30,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {103699#(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; {103700#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:30,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {103700#(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; {103701#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:30,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {103701#(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; {103702#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:30,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {103702#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {103702#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:30,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {103702#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {103703#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:13:30,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {103703#(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; {103704#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:13:30,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {103704#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {103688#false} is VALID [2022-04-28 10:13:30,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {103688#false} assume !(~y~0 % 4294967296 > 0); {103688#false} is VALID [2022-04-28 10:13:30,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {103688#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {103688#false} is VALID [2022-04-28 10:13:30,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {103688#false} assume !(~x~0 % 4294967296 > 0); {103688#false} is VALID [2022-04-28 10:13:30,387 INFO L272 TraceCheckUtils]: 33: Hoare triple {103688#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {103688#false} is VALID [2022-04-28 10:13:30,387 INFO L290 TraceCheckUtils]: 34: Hoare triple {103688#false} ~cond := #in~cond; {103688#false} is VALID [2022-04-28 10:13:30,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {103688#false} assume 0 == ~cond; {103688#false} is VALID [2022-04-28 10:13:30,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {103688#false} assume !false; {103688#false} is VALID [2022-04-28 10:13:30,387 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:13:30,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:30,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016540641] [2022-04-28 10:13:30,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016540641] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:30,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122424632] [2022-04-28 10:13:30,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:13:30,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:30,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:30,390 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:30,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-28 10:13:30,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:13:30,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:30,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:13:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:30,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:30,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {103687#true} call ULTIMATE.init(); {103687#true} is VALID [2022-04-28 10:13:30,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {103687#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); {103687#true} is VALID [2022-04-28 10:13:30,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {103687#true} assume true; {103687#true} is VALID [2022-04-28 10:13:30,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103687#true} {103687#true} #72#return; {103687#true} is VALID [2022-04-28 10:13:30,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {103687#true} call #t~ret13 := main(); {103687#true} is VALID [2022-04-28 10:13:30,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {103687#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {103692#(= main_~y~0 0)} is VALID [2022-04-28 10:13:30,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {103692#(= 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; {103693#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:30,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {103693#(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; {103694#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:30,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {103694#(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; {103695#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:30,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {103695#(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; {103696#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:30,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {103696#(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; {103697#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:30,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {103697#(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; {103698#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:30,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {103698#(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; {103699#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:30,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {103699#(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; {103700#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:30,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {103700#(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; {103701#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:30,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {103701#(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; {103702#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:30,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {103702#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {103702#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:30,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {103702#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {103703#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:13:30,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {103703#(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; {103763#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:13:30,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {103763#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {103688#false} is VALID [2022-04-28 10:13:30,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:30,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {103688#false} assume !(~y~0 % 4294967296 > 0); {103688#false} is VALID [2022-04-28 10:13:30,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {103688#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {103688#false} is VALID [2022-04-28 10:13:30,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {103688#false} assume !(~x~0 % 4294967296 > 0); {103688#false} is VALID [2022-04-28 10:13:30,710 INFO L272 TraceCheckUtils]: 33: Hoare triple {103688#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {103688#false} is VALID [2022-04-28 10:13:30,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {103688#false} ~cond := #in~cond; {103688#false} is VALID [2022-04-28 10:13:30,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {103688#false} assume 0 == ~cond; {103688#false} is VALID [2022-04-28 10:13:30,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {103688#false} assume !false; {103688#false} is VALID [2022-04-28 10:13:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:13:30,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:31,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {103688#false} assume !false; {103688#false} is VALID [2022-04-28 10:13:31,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {103688#false} assume 0 == ~cond; {103688#false} is VALID [2022-04-28 10:13:31,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {103688#false} ~cond := #in~cond; {103688#false} is VALID [2022-04-28 10:13:31,062 INFO L272 TraceCheckUtils]: 33: Hoare triple {103688#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {103688#false} is VALID [2022-04-28 10:13:31,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {103688#false} assume !(~x~0 % 4294967296 > 0); {103688#false} is VALID [2022-04-28 10:13:31,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {103688#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {103688#false} is VALID [2022-04-28 10:13:31,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {103688#false} assume !(~y~0 % 4294967296 > 0); {103688#false} is VALID [2022-04-28 10:13:31,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:31,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:31,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:31,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:31,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:31,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:31,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:31,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:31,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:31,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {103688#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {103688#false} is VALID [2022-04-28 10:13:31,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {103869#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {103688#false} is VALID [2022-04-28 10:13:31,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {103873#(< 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; {103869#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:31,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {103877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {103873#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:31,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {103877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {103877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:31,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {103884#(< 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; {103877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:31,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {103888#(< 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; {103884#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:31,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {103892#(< 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; {103888#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:31,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {103896#(< 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; {103892#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:31,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {103900#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103896#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:31,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {103904#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103900#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:31,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {103908#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103904#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:31,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {103912#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103908#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:31,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {103916#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103912#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:31,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {103920#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {103916#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:13:31,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {103687#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {103920#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:13:31,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {103687#true} call #t~ret13 := main(); {103687#true} is VALID [2022-04-28 10:13:31,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103687#true} {103687#true} #72#return; {103687#true} is VALID [2022-04-28 10:13:31,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {103687#true} assume true; {103687#true} is VALID [2022-04-28 10:13:31,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {103687#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); {103687#true} is VALID [2022-04-28 10:13:31,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {103687#true} call ULTIMATE.init(); {103687#true} is VALID [2022-04-28 10:13:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:13:31,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122424632] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:31,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:31,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:13:31,072 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:31,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2091952961] [2022-04-28 10:13:31,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2091952961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:31,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:31,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:13:31,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802987673] [2022-04-28 10:13:31,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:31,073 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 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 37 [2022-04-28 10:13:31,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:31,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:31,091 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-28 10:13:31,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:13:31,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:31,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:13:31,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:13:31,092 INFO L87 Difference]: Start difference. First operand 400 states and 542 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:34,416 INFO L93 Difference]: Finished difference Result 510 states and 652 transitions. [2022-04-28 10:13:34,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:13:34,416 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 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 37 [2022-04-28 10:13:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-28 10:13:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-28 10:13:34,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 76 transitions. [2022-04-28 10:13:34,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:34,495 INFO L225 Difference]: With dead ends: 510 [2022-04-28 10:13:34,495 INFO L226 Difference]: Without dead ends: 492 [2022-04-28 10:13:34,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:13:34,495 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:34,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 94 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:13:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-04-28 10:13:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 400. [2022-04-28 10:13:36,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:36,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 492 states. Second operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:36,147 INFO L74 IsIncluded]: Start isIncluded. First operand 492 states. Second operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:36,147 INFO L87 Difference]: Start difference. First operand 492 states. Second operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:36,155 INFO L93 Difference]: Finished difference Result 492 states and 634 transitions. [2022-04-28 10:13:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 634 transitions. [2022-04-28 10:13:36,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:36,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:36,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-28 10:13:36,160 INFO L87 Difference]: Start difference. First operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-28 10:13:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:36,172 INFO L93 Difference]: Finished difference Result 492 states and 634 transitions. [2022-04-28 10:13:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 634 transitions. [2022-04-28 10:13:36,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:36,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:36,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:36,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 541 transitions. [2022-04-28 10:13:36,180 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 541 transitions. Word has length 37 [2022-04-28 10:13:36,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:36,181 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 541 transitions. [2022-04-28 10:13:36,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:36,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 541 transitions. [2022-04-28 10:13:38,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 541 edges. 541 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 541 transitions. [2022-04-28 10:13:38,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:13:38,807 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:38,807 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:38,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:39,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-04-28 10:13:39,008 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:39,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:39,008 INFO L85 PathProgramCache]: Analyzing trace with hash -632235336, now seen corresponding path program 43 times [2022-04-28 10:13:39,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:39,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1880526478] [2022-04-28 10:13:39,010 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:39,010 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:39,010 INFO L85 PathProgramCache]: Analyzing trace with hash -632235336, now seen corresponding path program 44 times [2022-04-28 10:13:39,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:39,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530061465] [2022-04-28 10:13:39,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:39,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:39,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:39,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {106802#(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); {106773#true} is VALID [2022-04-28 10:13:39,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {106773#true} assume true; {106773#true} is VALID [2022-04-28 10:13:39,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {106773#true} {106773#true} #72#return; {106773#true} is VALID [2022-04-28 10:13:39,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {106773#true} call ULTIMATE.init(); {106802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:39,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {106802#(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); {106773#true} is VALID [2022-04-28 10:13:39,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {106773#true} assume true; {106773#true} is VALID [2022-04-28 10:13:39,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106773#true} {106773#true} #72#return; {106773#true} is VALID [2022-04-28 10:13:39,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {106773#true} call #t~ret13 := main(); {106773#true} is VALID [2022-04-28 10:13:39,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {106773#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {106778#(= main_~y~0 0)} is VALID [2022-04-28 10:13:39,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {106778#(= 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; {106779#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:39,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {106779#(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; {106780#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:39,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {106780#(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; {106781#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:39,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {106781#(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; {106782#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:39,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {106782#(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; {106783#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:39,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {106783#(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; {106784#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:39,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {106784#(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; {106785#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:39,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {106785#(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; {106786#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:39,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {106786#(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; {106787#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:39,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {106787#(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; {106788#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:39,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {106788#(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; {106789#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:39,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {106789#(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; {106790#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:39,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {106790#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106791#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:39,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {106791#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106792#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:39,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {106792#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106793#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:39,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {106793#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106794#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:39,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {106794#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106795#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:39,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {106795#(and (<= main_~y~0 17) (<= 17 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; {106796#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:39,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {106796#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106797#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:13:39,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {106797#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106798#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:13:39,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {106798#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106799#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:13:39,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {106799#(and (<= main_~y~0 21) (<= 21 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; {106800#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:13:39,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {106800#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {106800#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:13:39,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {106800#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {106801#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:13:39,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {106801#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {106774#false} is VALID [2022-04-28 10:13:39,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {106774#false} assume !(~y~0 % 4294967296 > 0); {106774#false} is VALID [2022-04-28 10:13:39,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {106774#false} assume !(~x~0 % 4294967296 > 0); {106774#false} is VALID [2022-04-28 10:13:39,478 INFO L272 TraceCheckUtils]: 33: Hoare triple {106774#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {106774#false} is VALID [2022-04-28 10:13:39,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {106774#false} ~cond := #in~cond; {106774#false} is VALID [2022-04-28 10:13:39,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {106774#false} assume 0 == ~cond; {106774#false} is VALID [2022-04-28 10:13:39,478 INFO L290 TraceCheckUtils]: 36: Hoare triple {106774#false} assume !false; {106774#false} is VALID [2022-04-28 10:13:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:39,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:39,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530061465] [2022-04-28 10:13:39,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530061465] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:39,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921518393] [2022-04-28 10:13:39,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:13:39,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:39,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:39,480 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:39,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-28 10:13:39,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:13:39,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:39,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 10:13:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:39,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:39,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {106773#true} call ULTIMATE.init(); {106773#true} is VALID [2022-04-28 10:13:39,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {106773#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); {106773#true} is VALID [2022-04-28 10:13:39,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {106773#true} assume true; {106773#true} is VALID [2022-04-28 10:13:39,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106773#true} {106773#true} #72#return; {106773#true} is VALID [2022-04-28 10:13:39,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {106773#true} call #t~ret13 := main(); {106773#true} is VALID [2022-04-28 10:13:39,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {106773#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {106778#(= main_~y~0 0)} is VALID [2022-04-28 10:13:39,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {106778#(= 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; {106779#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:39,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {106779#(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; {106780#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:39,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {106780#(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; {106781#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:39,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {106781#(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; {106782#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:40,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {106782#(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; {106783#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:40,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {106783#(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; {106784#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:40,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {106784#(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; {106785#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:40,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {106785#(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; {106786#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:40,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {106786#(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; {106787#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:40,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {106787#(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; {106788#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:40,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {106788#(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; {106789#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:40,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {106789#(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; {106790#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:40,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {106790#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106791#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:40,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {106791#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106792#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:40,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {106792#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106793#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:40,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {106793#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106794#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:40,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {106794#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106795#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:40,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {106795#(and (<= main_~y~0 17) (<= 17 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; {106796#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:40,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {106796#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106797#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:13:40,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {106797#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106798#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:13:40,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {106798#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106799#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:13:40,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {106799#(and (<= main_~y~0 21) (<= 21 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; {106800#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:13:40,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {106800#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {106800#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:13:40,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {106800#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {106893#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:13:40,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {106893#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {106774#false} is VALID [2022-04-28 10:13:40,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {106774#false} assume !(~y~0 % 4294967296 > 0); {106774#false} is VALID [2022-04-28 10:13:40,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {106774#false} assume !(~x~0 % 4294967296 > 0); {106774#false} is VALID [2022-04-28 10:13:40,012 INFO L272 TraceCheckUtils]: 33: Hoare triple {106774#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {106774#false} is VALID [2022-04-28 10:13:40,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {106774#false} ~cond := #in~cond; {106774#false} is VALID [2022-04-28 10:13:40,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {106774#false} assume 0 == ~cond; {106774#false} is VALID [2022-04-28 10:13:40,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {106774#false} assume !false; {106774#false} is VALID [2022-04-28 10:13:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:40,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:41,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {106774#false} assume !false; {106774#false} is VALID [2022-04-28 10:13:41,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {106774#false} assume 0 == ~cond; {106774#false} is VALID [2022-04-28 10:13:41,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {106774#false} ~cond := #in~cond; {106774#false} is VALID [2022-04-28 10:13:41,025 INFO L272 TraceCheckUtils]: 33: Hoare triple {106774#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {106774#false} is VALID [2022-04-28 10:13:41,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {106774#false} assume !(~x~0 % 4294967296 > 0); {106774#false} is VALID [2022-04-28 10:13:41,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {106774#false} assume !(~y~0 % 4294967296 > 0); {106774#false} is VALID [2022-04-28 10:13:41,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {106933#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {106774#false} is VALID [2022-04-28 10:13:41,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {106937#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {106933#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:41,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {106937#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {106937#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:41,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {106944#(< 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; {106937#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:41,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {106948#(< 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; {106944#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:41,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {106952#(< 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; {106948#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:41,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {106956#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106952#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:41,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {106960#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106956#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:41,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {106964#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106960#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:41,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {106968#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106964#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:41,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {106972#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106968#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:41,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {106976#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106972#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:13:41,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {106980#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106976#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:13:41,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {106984#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106980#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:13:41,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {106988#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106984#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:13:41,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {106992#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106988#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:13:41,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {106996#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106992#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:13:41,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {107000#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {106996#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:13:41,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {107004#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107000#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:13:41,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {107008#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107004#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:13:41,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {107012#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107008#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:13:41,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {107016#(< 0 (mod (+ 19 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; {107012#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:13:41,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {107020#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107016#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:41,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {107024#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107020#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:13:41,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {107028#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107024#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:13:41,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {106773#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {107028#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:13:41,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {106773#true} call #t~ret13 := main(); {106773#true} is VALID [2022-04-28 10:13:41,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106773#true} {106773#true} #72#return; {106773#true} is VALID [2022-04-28 10:13:41,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {106773#true} assume true; {106773#true} is VALID [2022-04-28 10:13:41,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {106773#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); {106773#true} is VALID [2022-04-28 10:13:41,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {106773#true} call ULTIMATE.init(); {106773#true} is VALID [2022-04-28 10:13:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:41,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921518393] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:41,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:41,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-28 10:13:41,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:41,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1880526478] [2022-04-28 10:13:41,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1880526478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:41,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:41,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:13:41,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322289995] [2022-04-28 10:13:41,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:41,043 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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 37 [2022-04-28 10:13:41,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:41,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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-28 10:13:41,065 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-28 10:13:41,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:13:41,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:41,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:13:41,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=2020, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:13:41,066 INFO L87 Difference]: Start difference. First operand 400 states and 541 transitions. Second operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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-28 10:13:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:48,166 INFO L93 Difference]: Finished difference Result 638 states and 983 transitions. [2022-04-28 10:13:48,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:13:48,166 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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 37 [2022-04-28 10:13:48,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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-28 10:13:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 169 transitions. [2022-04-28 10:13:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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-28 10:13:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 169 transitions. [2022-04-28 10:13:48,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 169 transitions. [2022-04-28 10:13:48,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:48,319 INFO L225 Difference]: With dead ends: 638 [2022-04-28 10:13:48,319 INFO L226 Difference]: Without dead ends: 610 [2022-04-28 10:13:48,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1282, Invalid=4418, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 10:13:48,320 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 153 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2902 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:48,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 186 Invalid, 2996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2902 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 10:13:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-04-28 10:13:49,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 419. [2022-04-28 10:13:49,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:49,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 610 states. Second operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:49,997 INFO L74 IsIncluded]: Start isIncluded. First operand 610 states. Second operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:49,997 INFO L87 Difference]: Start difference. First operand 610 states. Second operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:50,008 INFO L93 Difference]: Finished difference Result 610 states and 761 transitions. [2022-04-28 10:13:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 761 transitions. [2022-04-28 10:13:50,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:50,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:50,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 3 states have call successors, (3), 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 610 states. [2022-04-28 10:13:50,009 INFO L87 Difference]: Start difference. First operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 3 states have call successors, (3), 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 610 states. [2022-04-28 10:13:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:50,023 INFO L93 Difference]: Finished difference Result 610 states and 761 transitions. [2022-04-28 10:13:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 761 transitions. [2022-04-28 10:13:50,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:50,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:50,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:50,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 569 transitions. [2022-04-28 10:13:50,031 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 569 transitions. Word has length 37 [2022-04-28 10:13:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:50,031 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 569 transitions. [2022-04-28 10:13:50,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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-28 10:13:50,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 419 states and 569 transitions. [2022-04-28 10:13:52,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 569 transitions. [2022-04-28 10:13:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:13:52,629 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:52,629 INFO L195 NwaCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:52,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:52,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-04-28 10:13:52,831 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:52,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:52,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1382721279, now seen corresponding path program 45 times [2022-04-28 10:13:52,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:52,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2053097358] [2022-04-28 10:13:52,834 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:52,834 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1382721279, now seen corresponding path program 46 times [2022-04-28 10:13:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:52,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380509785] [2022-04-28 10:13:52,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:52,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:53,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:53,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {110461#(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); {110431#true} is VALID [2022-04-28 10:13:53,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {110431#true} assume true; {110431#true} is VALID [2022-04-28 10:13:53,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110431#true} {110431#true} #72#return; {110431#true} is VALID [2022-04-28 10:13:53,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {110431#true} call ULTIMATE.init(); {110461#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:53,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {110461#(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); {110431#true} is VALID [2022-04-28 10:13:53,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {110431#true} assume true; {110431#true} is VALID [2022-04-28 10:13:53,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110431#true} {110431#true} #72#return; {110431#true} is VALID [2022-04-28 10:13:53,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {110431#true} call #t~ret13 := main(); {110431#true} is VALID [2022-04-28 10:13:53,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {110431#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {110436#(= main_~y~0 0)} is VALID [2022-04-28 10:13:53,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {110436#(= 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; {110437#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:53,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {110437#(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; {110438#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:53,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {110438#(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; {110439#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:53,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {110439#(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; {110440#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:53,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {110440#(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; {110441#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:53,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {110441#(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; {110442#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:53,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {110442#(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; {110443#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:53,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {110443#(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; {110444#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:53,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {110444#(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; {110445#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:53,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {110445#(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; {110446#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:53,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {110446#(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; {110447#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:53,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {110447#(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; {110448#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:53,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {110448#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110449#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:53,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {110449#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110450#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:53,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {110450#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110451#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:53,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {110451#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110452#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:53,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {110452#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110453#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:53,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {110453#(and (<= main_~y~0 17) (<= 17 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; {110454#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:53,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {110454#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110455#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:13:53,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {110455#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110456#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:13:53,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {110456#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110457#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:13:53,410 INFO L290 TraceCheckUtils]: 27: Hoare triple {110457#(and (<= main_~y~0 21) (<= 21 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; {110458#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:13:53,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {110458#(and (<= main_~y~0 22) (<= 22 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; {110459#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:13:53,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {110459#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {110459#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:13:53,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {110459#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {110460#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} is VALID [2022-04-28 10:13:53,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {110460#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {110432#false} is VALID [2022-04-28 10:13:53,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {110432#false} assume !(~y~0 % 4294967296 > 0); {110432#false} is VALID [2022-04-28 10:13:53,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {110432#false} assume !(~x~0 % 4294967296 > 0); {110432#false} is VALID [2022-04-28 10:13:53,412 INFO L272 TraceCheckUtils]: 34: Hoare triple {110432#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {110432#false} is VALID [2022-04-28 10:13:53,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {110432#false} ~cond := #in~cond; {110432#false} is VALID [2022-04-28 10:13:53,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {110432#false} assume 0 == ~cond; {110432#false} is VALID [2022-04-28 10:13:53,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {110432#false} assume !false; {110432#false} is VALID [2022-04-28 10:13:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:53,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:53,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380509785] [2022-04-28 10:13:53,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380509785] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:53,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185471290] [2022-04-28 10:13:53,413 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:53,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:53,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:53,414 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:53,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-04-28 10:13:53,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:53,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:53,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 10:13:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:53,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:53,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {110431#true} call ULTIMATE.init(); {110431#true} is VALID [2022-04-28 10:13:53,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {110431#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); {110431#true} is VALID [2022-04-28 10:13:53,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {110431#true} assume true; {110431#true} is VALID [2022-04-28 10:13:53,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110431#true} {110431#true} #72#return; {110431#true} is VALID [2022-04-28 10:13:53,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {110431#true} call #t~ret13 := main(); {110431#true} is VALID [2022-04-28 10:13:53,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {110431#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {110436#(= main_~y~0 0)} is VALID [2022-04-28 10:13:53,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {110436#(= 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; {110437#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:53,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {110437#(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; {110438#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:53,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {110438#(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; {110439#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:53,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {110439#(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; {110440#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:53,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {110440#(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; {110441#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:53,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {110441#(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; {110442#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:53,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {110442#(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; {110443#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:53,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {110443#(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; {110444#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:53,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {110444#(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; {110445#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:53,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {110445#(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; {110446#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:53,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {110446#(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; {110447#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:53,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {110447#(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; {110448#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:53,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {110448#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110449#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:53,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {110449#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110450#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:53,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {110450#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110451#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:53,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {110451#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110452#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:53,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {110452#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110453#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:53,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {110453#(and (<= main_~y~0 17) (<= 17 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; {110454#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:53,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {110454#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110455#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:13:53,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {110455#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110456#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:13:53,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {110456#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110457#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:13:53,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {110457#(and (<= main_~y~0 21) (<= 21 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; {110458#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:13:53,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {110458#(and (<= main_~y~0 22) (<= 22 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; {110459#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:13:53,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {110459#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {110459#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:13:53,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {110459#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {110555#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-28 10:13:53,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {110555#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !(~z~0 % 4294967296 > 0); {110432#false} is VALID [2022-04-28 10:13:53,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {110432#false} assume !(~y~0 % 4294967296 > 0); {110432#false} is VALID [2022-04-28 10:13:53,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {110432#false} assume !(~x~0 % 4294967296 > 0); {110432#false} is VALID [2022-04-28 10:13:53,855 INFO L272 TraceCheckUtils]: 34: Hoare triple {110432#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {110432#false} is VALID [2022-04-28 10:13:53,855 INFO L290 TraceCheckUtils]: 35: Hoare triple {110432#false} ~cond := #in~cond; {110432#false} is VALID [2022-04-28 10:13:53,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {110432#false} assume 0 == ~cond; {110432#false} is VALID [2022-04-28 10:13:53,855 INFO L290 TraceCheckUtils]: 37: Hoare triple {110432#false} assume !false; {110432#false} is VALID [2022-04-28 10:13:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:53,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:54,919 INFO L290 TraceCheckUtils]: 37: Hoare triple {110432#false} assume !false; {110432#false} is VALID [2022-04-28 10:13:54,919 INFO L290 TraceCheckUtils]: 36: Hoare triple {110432#false} assume 0 == ~cond; {110432#false} is VALID [2022-04-28 10:13:54,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {110432#false} ~cond := #in~cond; {110432#false} is VALID [2022-04-28 10:13:54,919 INFO L272 TraceCheckUtils]: 34: Hoare triple {110432#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {110432#false} is VALID [2022-04-28 10:13:54,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {110432#false} assume !(~x~0 % 4294967296 > 0); {110432#false} is VALID [2022-04-28 10:13:54,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {110432#false} assume !(~y~0 % 4294967296 > 0); {110432#false} is VALID [2022-04-28 10:13:54,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {110595#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {110432#false} is VALID [2022-04-28 10:13:54,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {110599#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {110595#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:54,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {110599#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {110599#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:54,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {110606#(< 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; {110599#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:54,922 INFO L290 TraceCheckUtils]: 27: Hoare triple {110610#(< 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; {110606#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:54,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {110614#(< 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; {110610#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:54,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {110618#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110614#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:54,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {110622#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110618#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:54,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {110626#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110622#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:54,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {110630#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110626#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:54,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {110634#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110630#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:54,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {110638#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110634#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:13:54,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {110642#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110638#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:13:54,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {110646#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110642#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:13:54,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {110650#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110646#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:13:54,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {110654#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110650#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:13:54,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {110658#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110654#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:13:54,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {110662#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110658#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:13:54,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {110666#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110662#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:13:54,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {110670#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110666#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:13:54,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {110674#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110670#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:13:54,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {110678#(< 0 (mod (+ 19 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; {110674#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:13:54,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {110682#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110678#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:54,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {110686#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110682#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:13:54,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {110690#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {110686#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:13:54,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {110694#(< 0 (mod (+ 23 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; {110690#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:13:54,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {110431#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {110694#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:54,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {110431#true} call #t~ret13 := main(); {110431#true} is VALID [2022-04-28 10:13:54,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110431#true} {110431#true} #72#return; {110431#true} is VALID [2022-04-28 10:13:54,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {110431#true} assume true; {110431#true} is VALID [2022-04-28 10:13:54,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {110431#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); {110431#true} is VALID [2022-04-28 10:13:54,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {110431#true} call ULTIMATE.init(); {110431#true} is VALID [2022-04-28 10:13:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:54,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185471290] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:54,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:54,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-28 10:13:54,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:54,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2053097358] [2022-04-28 10:13:54,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2053097358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:54,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:54,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 10:13:54,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135518605] [2022-04-28 10:13:54,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:54,938 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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 38 [2022-04-28 10:13:54,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:54,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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-28 10:13:54,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:54,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 10:13:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:54,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 10:13:54,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:13:54,961 INFO L87 Difference]: Start difference. First operand 419 states and 569 transitions. Second operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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-28 10:14:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:02,503 INFO L93 Difference]: Finished difference Result 665 states and 1027 transitions. [2022-04-28 10:14:02,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:14:02,504 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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 38 [2022-04-28 10:14:02,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:02,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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-28 10:14:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 176 transitions. [2022-04-28 10:14:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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-28 10:14:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 176 transitions. [2022-04-28 10:14:02,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 176 transitions. [2022-04-28 10:14:02,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:02,678 INFO L225 Difference]: With dead ends: 665 [2022-04-28 10:14:02,678 INFO L226 Difference]: Without dead ends: 637 [2022-04-28 10:14:02,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1385, Invalid=4777, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 10:14:02,679 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 162 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 3123 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 3222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:02,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 192 Invalid, 3222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3123 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 10:14:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-04-28 10:14:04,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 438. [2022-04-28 10:14:04,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:04,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 637 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:04,407 INFO L74 IsIncluded]: Start isIncluded. First operand 637 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:04,408 INFO L87 Difference]: Start difference. First operand 637 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:04,418 INFO L93 Difference]: Finished difference Result 637 states and 797 transitions. [2022-04-28 10:14:04,419 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 797 transitions. [2022-04-28 10:14:04,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:04,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:04,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 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 637 states. [2022-04-28 10:14:04,419 INFO L87 Difference]: Start difference. First operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 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 637 states. [2022-04-28 10:14:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:04,430 INFO L93 Difference]: Finished difference Result 637 states and 797 transitions. [2022-04-28 10:14:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 797 transitions. [2022-04-28 10:14:04,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:04,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:04,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:04,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 597 transitions. [2022-04-28 10:14:04,439 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 597 transitions. Word has length 38 [2022-04-28 10:14:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:04,439 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 597 transitions. [2022-04-28 10:14:04,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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-28 10:14:04,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 438 states and 597 transitions. [2022-04-28 10:14:07,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 597 transitions. [2022-04-28 10:14:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:14:07,294 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:07,294 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:07,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:07,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:07,495 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:07,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:07,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1036634024, now seen corresponding path program 63 times [2022-04-28 10:14:07,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:07,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [311666588] [2022-04-28 10:14:07,498 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:07,498 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:07,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1036634024, now seen corresponding path program 64 times [2022-04-28 10:14:07,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:07,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186497333] [2022-04-28 10:14:07,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:07,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:08,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:08,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {114274#(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); {114245#true} is VALID [2022-04-28 10:14:08,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {114245#true} assume true; {114245#true} is VALID [2022-04-28 10:14:08,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {114245#true} {114245#true} #72#return; {114245#true} is VALID [2022-04-28 10:14:08,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {114245#true} call ULTIMATE.init(); {114274#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:08,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {114274#(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); {114245#true} is VALID [2022-04-28 10:14:08,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {114245#true} assume true; {114245#true} is VALID [2022-04-28 10:14:08,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114245#true} {114245#true} #72#return; {114245#true} is VALID [2022-04-28 10:14:08,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {114245#true} call #t~ret13 := main(); {114245#true} is VALID [2022-04-28 10:14:08,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {114245#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {114250#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:14:08,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {114250#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114251#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)))} is VALID [2022-04-28 10:14:08,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {114251#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~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; {114252#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 2)))} is VALID [2022-04-28 10:14:08,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {114252#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) 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; {114253#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} is VALID [2022-04-28 10:14:08,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {114253#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114254#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 4)) (<= (+ (* main_~x~0 2) main_~y~0 4) (* main_~n~0 2)))} is VALID [2022-04-28 10:14:08,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {114254#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 4)) (<= (+ (* main_~x~0 2) main_~y~0 4) (* main_~n~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; {114255#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) 5 main_~y~0)) (<= (+ (* main_~x~0 2) 5 main_~y~0) (* main_~n~0 2)))} is VALID [2022-04-28 10:14:08,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {114255#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) 5 main_~y~0)) (<= (+ (* main_~x~0 2) 5 main_~y~0) (* main_~n~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; {114256#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 6)) (<= (+ (* main_~x~0 2) main_~y~0 6) (* main_~n~0 2)))} is VALID [2022-04-28 10:14:08,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {114256#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 6)) (<= (+ (* main_~x~0 2) main_~y~0 6) (* main_~n~0 2)))} assume !(~x~0 % 4294967296 > 0); {114257#(and (<= (* main_~n~0 2) (+ main_~y~0 6 (* 8589934592 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 6 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)))} is VALID [2022-04-28 10:14:08,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {114257#(and (<= (* main_~n~0 2) (+ main_~y~0 6 (* 8589934592 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 6 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)))} ~z~0 := ~y~0; {114258#(and (<= (+ main_~z~0 6 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ main_~z~0 6 (* 8589934592 (div main_~x~0 4294967296)))))} is VALID [2022-04-28 10:14:08,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {114258#(and (<= (+ main_~z~0 6 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ main_~z~0 6 (* 8589934592 (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; {114259#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:08,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {114259#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 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; {114260#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 10:14:08,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {114260#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 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; {114261#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0 9))} is VALID [2022-04-28 10:14:08,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {114261#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) 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; {114262#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} is VALID [2022-04-28 10:14:08,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {114262#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114263#(<= (* main_~n~0 2) (+ main_~z~0 11 (* (div (+ (- 11) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:08,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {114263#(<= (* main_~n~0 2) (+ main_~z~0 11 (* (div (+ (- 11) (* (- 1) main_~z~0) (* main_~n~0 2)) 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; {114264#(<= (* main_~n~0 2) (+ main_~z~0 12 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 12)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:08,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {114264#(<= (* main_~n~0 2) (+ main_~z~0 12 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 12)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {114264#(<= (* main_~n~0 2) (+ main_~z~0 12 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 12)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:08,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {114264#(<= (* main_~n~0 2) (+ main_~z~0 12 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 12)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114263#(<= (* main_~n~0 2) (+ main_~z~0 11 (* (div (+ (- 11) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:08,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {114263#(<= (* main_~n~0 2) (+ main_~z~0 11 (* (div (+ (- 11) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114262#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} is VALID [2022-04-28 10:14:08,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {114262#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114261#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0 9))} is VALID [2022-04-28 10:14:08,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {114261#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114260#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 10:14:08,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {114260#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114259#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:08,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {114259#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114265#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:08,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {114265#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {114265#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:08,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {114265#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114266#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 10:14:08,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {114266#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114267#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} is VALID [2022-04-28 10:14:08,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {114267#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114268#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:08,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {114268#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114269#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} is VALID [2022-04-28 10:14:08,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {114269#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114270#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} is VALID [2022-04-28 10:14:08,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {114270#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114271#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:14:08,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {114271#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {114271#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:14:08,168 INFO L272 TraceCheckUtils]: 35: Hoare triple {114271#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {114272#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:14:08,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {114272#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {114273#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:14:08,168 INFO L290 TraceCheckUtils]: 37: Hoare triple {114273#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {114246#false} is VALID [2022-04-28 10:14:08,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {114246#false} assume !false; {114246#false} is VALID [2022-04-28 10:14:08,169 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:08,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:08,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186497333] [2022-04-28 10:14:08,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186497333] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:08,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651500955] [2022-04-28 10:14:08,169 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:14:08,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:08,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:08,170 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:08,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-04-28 10:14:08,493 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:14:08,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:08,495 WARN L261 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-28 10:14:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:08,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:10,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {114245#true} call ULTIMATE.init(); {114245#true} is VALID [2022-04-28 10:14:10,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {114245#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); {114245#true} is VALID [2022-04-28 10:14:10,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {114245#true} assume true; {114245#true} is VALID [2022-04-28 10:14:10,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114245#true} {114245#true} #72#return; {114245#true} is VALID [2022-04-28 10:14:10,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {114245#true} call #t~ret13 := main(); {114245#true} is VALID [2022-04-28 10:14:10,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {114245#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {114250#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:14:10,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {114250#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114296#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 10:14:10,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {114296#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114300#(and (= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:14:10,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {114300#(and (= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114304#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-28 10:14:10,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {114304#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114308#(and (< 0 (mod (+ main_~x~0 3) 4294967296)) (= main_~y~0 4) (= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:14:10,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {114308#(and (< 0 (mod (+ main_~x~0 3) 4294967296)) (= main_~y~0 4) (= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114312#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 10:14:10,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {114312#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (= (+ (- 1) main_~y~0) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114316#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 5))) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 10:14:10,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {114316#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 5))) (= (+ (- 2) main_~y~0) 4))} assume !(~x~0 % 4294967296 > 0); {114320#(and (= main_~y~0 6) (= main_~n~0 (+ main_~x~0 6)) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-28 10:14:10,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {114320#(and (= main_~y~0 6) (= main_~n~0 (+ main_~x~0 6)) (<= (mod main_~x~0 4294967296) 0))} ~z~0 := ~y~0; {114324#(and (= main_~n~0 (+ main_~x~0 6)) (<= (mod main_~x~0 4294967296) 0) (= main_~z~0 6))} is VALID [2022-04-28 10:14:10,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {114324#(and (= main_~n~0 (+ main_~x~0 6)) (<= (mod main_~x~0 4294967296) 0) (= main_~z~0 6))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114328#(and (= (+ 5 main_~x~0) main_~n~0) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (= 6 (+ main_~z~0 1)))} is VALID [2022-04-28 10:14:10,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {114328#(and (= (+ 5 main_~x~0) main_~n~0) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (= 6 (+ 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; {114332#(and (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= 5 (+ main_~z~0 1)) (= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:14:10,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {114332#(and (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= 5 (+ main_~z~0 1)) (= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114336#(and (= 5 (+ main_~z~0 2)) (= (+ main_~n~0 (- 3)) main_~x~0) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:14:10,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {114336#(and (= 5 (+ main_~z~0 2)) (= (+ main_~n~0 (- 3)) main_~x~0) (<= (mod (+ 4294967290 main_~n~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; {114340#(and (= (+ (- 2) main_~n~0) main_~x~0) (= 5 (+ main_~z~0 3)) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:14:10,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {114340#(and (= (+ (- 2) main_~n~0) main_~x~0) (= 5 (+ main_~z~0 3)) (<= (mod (+ 4294967290 main_~n~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; {114344#(and (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0) (= 5 (+ main_~z~0 4)))} is VALID [2022-04-28 10:14:10,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {114344#(and (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0) (= 5 (+ 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; {114348#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= (+ main_~z~0 1) 1) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:14:10,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {114348#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= (+ main_~z~0 1) 1) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {114348#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= (+ main_~z~0 1) 1) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:14:10,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {114348#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= (+ main_~z~0 1) 1) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114355#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~z~0 1) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:14:10,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {114355#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~z~0 1) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114359#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0) (= main_~z~0 2))} is VALID [2022-04-28 10:14:10,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {114359#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0) (= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114363#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~z~0 3) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:14:10,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {114363#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~z~0 3) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114367#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~z~0 4) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:14:10,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {114367#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~z~0 4) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114371#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 5 main_~z~0) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:14:10,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {114371#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 5 main_~z~0) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114375#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0) (= 5 (+ (- 1) main_~z~0)))} is VALID [2022-04-28 10:14:10,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {114375#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0) (= 5 (+ (- 1) main_~z~0)))} assume !(~y~0 % 4294967296 > 0); {114375#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0) (= 5 (+ (- 1) main_~z~0)))} is VALID [2022-04-28 10:14:10,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {114375#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0) (= 5 (+ (- 1) main_~z~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114382#(and (= 7 main_~z~0) (= (+ main_~x~0 1) main_~n~0) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:14:10,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {114382#(and (= 7 main_~z~0) (= (+ main_~x~0 1) main_~n~0) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114386#(and (= main_~n~0 (+ main_~x~0 2)) (= 7 (+ (- 1) main_~z~0)) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:14:10,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {114386#(and (= main_~n~0 (+ main_~x~0 2)) (= 7 (+ (- 1) main_~z~0)) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114390#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~z~0 9) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:14:10,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {114390#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~z~0 9) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114394#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 2)) (= main_~z~0 10) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:14:10,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {114394#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 2)) (= main_~z~0 10) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114398#(and (= main_~z~0 11) (= (+ (- 2) main_~n~0) (+ main_~x~0 3)) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:14:10,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {114398#(and (= main_~z~0 11) (= (+ (- 2) main_~n~0) (+ main_~x~0 3)) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114402#(and (= (+ (- 1) main_~z~0) 11) (= (+ main_~x~0 1) (+ main_~n~0 (- 5))) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:14:10,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {114402#(and (= (+ (- 1) main_~z~0) 11) (= (+ main_~x~0 1) (+ main_~n~0 (- 5))) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {114406#(and (= main_~z~0 12) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} is VALID [2022-04-28 10:14:10,297 INFO L272 TraceCheckUtils]: 35: Hoare triple {114406#(and (= main_~z~0 12) (<= (mod (+ 4294967290 main_~n~0) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {114410#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:10,297 INFO L290 TraceCheckUtils]: 36: Hoare triple {114410#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {114414#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:10,297 INFO L290 TraceCheckUtils]: 37: Hoare triple {114414#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {114246#false} is VALID [2022-04-28 10:14:10,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {114246#false} assume !false; {114246#false} is VALID [2022-04-28 10:14:10,298 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:10,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:13,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {114246#false} assume !false; {114246#false} is VALID [2022-04-28 10:14:13,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {114414#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {114246#false} is VALID [2022-04-28 10:14:13,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {114410#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {114414#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:13,347 INFO L272 TraceCheckUtils]: 35: Hoare triple {114271#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {114410#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:13,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {114433#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {114271#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:14:13,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {114437#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114433#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:14:13,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {114441#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114437#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-28 10:14:13,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {114445#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114441#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:14:13,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {114449#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114445#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} is VALID [2022-04-28 10:14:13,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {114453#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114449#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:14:13,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {114457#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {114453#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:14:13,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {114457#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {114457#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:14:13,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {114464#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114457#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:14:13,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {114468#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114464#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:14:13,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {114472#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114468#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:14:13,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {114476#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114472#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:14:13,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {114480#(or (and (< (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11) (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114476#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:14:13,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {114484#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12) (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 13))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114480#(or (and (< (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11) (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:14:13,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {114484#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12) (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 13))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {114484#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12) (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 13))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:14:13,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {114491#(or (and (< (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11) (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967291 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; {114484#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12) (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 13))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:14:13,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {114495#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 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; {114491#(or (and (< (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11) (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:14:13,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {114499#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 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; {114495#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:14:13,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {114503#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~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; {114499#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)))))} is VALID [2022-04-28 10:14:13,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {114507#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114503#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:14:13,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {114511#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~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; {114507#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))))} is VALID [2022-04-28 10:14:13,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {114515#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6) (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {114511#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:14:13,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {114515#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6) (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {114515#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6) (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:13,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {114522#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0) (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114515#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6) (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:13,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {114526#(or (and (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114522#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0) (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))))))} is VALID [2022-04-28 10:14:13,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {114530#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9) (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) (* main_~n~0 2))) (< (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 10))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114526#(or (and (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:14:13,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {114534#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 10) (+ (* main_~n~0 2) (* (div (+ main_~y~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114530#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9) (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) (* main_~n~0 2))) (< (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 10))))} is VALID [2022-04-28 10:14:13,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {114538#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 11) (+ (* main_~n~0 2) (* (div (+ main_~y~0 11) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 11) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 12))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114534#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 10) (+ (* main_~n~0 2) (* (div (+ main_~y~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:14:13,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {114542#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 12) (+ (* (div (+ main_~y~0 12) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 12) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 13))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114538#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 11) (+ (* main_~n~0 2) (* (div (+ main_~y~0 11) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 11) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 12))))} is VALID [2022-04-28 10:14:13,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {114245#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {114542#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 12) (+ (* (div (+ main_~y~0 12) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 12) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 13))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:14:13,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {114245#true} call #t~ret13 := main(); {114245#true} is VALID [2022-04-28 10:14:13,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114245#true} {114245#true} #72#return; {114245#true} is VALID [2022-04-28 10:14:13,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {114245#true} assume true; {114245#true} is VALID [2022-04-28 10:14:13,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {114245#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); {114245#true} is VALID [2022-04-28 10:14:13,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {114245#true} call ULTIMATE.init(); {114245#true} is VALID [2022-04-28 10:14:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:13,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651500955] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:13,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:13,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 32, 31] total 82 [2022-04-28 10:14:13,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:13,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [311666588] [2022-04-28 10:14:13,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [311666588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:13,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:13,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:14:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199580534] [2022-04-28 10:14:13,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:13,382 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 25 states have internal predecessors, (35), 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 39 [2022-04-28 10:14:13,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:13,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 25 states have internal predecessors, (35), 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-28 10:14:13,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:13,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:14:13,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:13,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:14:13,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=5965, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 10:14:13,452 INFO L87 Difference]: Start difference. First operand 438 states and 597 transitions. Second operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 25 states have internal predecessors, (35), 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-28 10:14:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:18,606 INFO L93 Difference]: Finished difference Result 457 states and 616 transitions. [2022-04-28 10:14:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 10:14:18,606 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 25 states have internal predecessors, (35), 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 39 [2022-04-28 10:14:18,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 25 states have internal predecessors, (35), 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-28 10:14:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 54 transitions. [2022-04-28 10:14:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 25 states have internal predecessors, (35), 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-28 10:14:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 54 transitions. [2022-04-28 10:14:18,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 54 transitions. [2022-04-28 10:14:18,670 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-28 10:14:18,678 INFO L225 Difference]: With dead ends: 457 [2022-04-28 10:14:18,678 INFO L226 Difference]: Without dead ends: 452 [2022-04-28 10:14:18,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2731 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=931, Invalid=10841, Unknown=0, NotChecked=0, Total=11772 [2022-04-28 10:14:18,679 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:18,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 133 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:14:18,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-04-28 10:14:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 438. [2022-04-28 10:14:20,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:20,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 452 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:20,525 INFO L74 IsIncluded]: Start isIncluded. First operand 452 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:20,525 INFO L87 Difference]: Start difference. First operand 452 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:20,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:20,532 INFO L93 Difference]: Finished difference Result 452 states and 611 transitions. [2022-04-28 10:14:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 611 transitions. [2022-04-28 10:14:20,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:20,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:20,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 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 452 states. [2022-04-28 10:14:20,533 INFO L87 Difference]: Start difference. First operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 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 452 states. [2022-04-28 10:14:20,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:20,539 INFO L93 Difference]: Finished difference Result 452 states and 611 transitions. [2022-04-28 10:14:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 611 transitions. [2022-04-28 10:14:20,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:20,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:20,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:20,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 597 transitions. [2022-04-28 10:14:20,548 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 597 transitions. Word has length 39 [2022-04-28 10:14:20,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:20,548 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 597 transitions. [2022-04-28 10:14:20,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 25 states have internal predecessors, (35), 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-28 10:14:20,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 438 states and 597 transitions. [2022-04-28 10:14:23,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 597 transitions. [2022-04-28 10:14:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:14:23,780 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:23,780 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:23,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-04-28 10:14:23,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable71 [2022-04-28 10:14:23,981 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:23,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash -731553192, now seen corresponding path program 65 times [2022-04-28 10:14:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:23,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1462454139] [2022-04-28 10:14:23,983 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:23,983 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:23,983 INFO L85 PathProgramCache]: Analyzing trace with hash -731553192, now seen corresponding path program 66 times [2022-04-28 10:14:23,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:23,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985048141] [2022-04-28 10:14:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:23,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:24,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:24,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {117330#(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); {117311#true} is VALID [2022-04-28 10:14:24,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {117311#true} assume true; {117311#true} is VALID [2022-04-28 10:14:24,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {117311#true} {117311#true} #72#return; {117311#true} is VALID [2022-04-28 10:14:24,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {117311#true} call ULTIMATE.init(); {117330#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:24,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {117330#(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); {117311#true} is VALID [2022-04-28 10:14:24,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {117311#true} assume true; {117311#true} is VALID [2022-04-28 10:14:24,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117311#true} {117311#true} #72#return; {117311#true} is VALID [2022-04-28 10:14:24,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {117311#true} call #t~ret13 := main(); {117311#true} is VALID [2022-04-28 10:14:24,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {117311#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {117316#(= main_~y~0 0)} is VALID [2022-04-28 10:14:24,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {117316#(= 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; {117317#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:24,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {117317#(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; {117318#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:24,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {117318#(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; {117319#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:24,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {117319#(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; {117320#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:24,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {117320#(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; {117321#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:24,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {117321#(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; {117322#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:24,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {117322#(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; {117323#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:24,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {117323#(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; {117324#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:24,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {117324#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {117324#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:24,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {117324#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {117325#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:24,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {117325#(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; {117326#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:24,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {117326#(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; {117327#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:24,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {117327#(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; {117328#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:14:24,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {117328#(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; {117329#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:24,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {117329#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {117312#false} is VALID [2022-04-28 10:14:24,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {117312#false} assume !(~y~0 % 4294967296 > 0); {117312#false} is VALID [2022-04-28 10:14:24,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {117312#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {117312#false} is VALID [2022-04-28 10:14:24,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {117312#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {117312#false} is VALID [2022-04-28 10:14:24,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {117312#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {117312#false} is VALID [2022-04-28 10:14:24,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {117312#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {117312#false} is VALID [2022-04-28 10:14:24,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {117312#false} assume !(~x~0 % 4294967296 > 0); {117312#false} is VALID [2022-04-28 10:14:24,207 INFO L272 TraceCheckUtils]: 35: Hoare triple {117312#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {117312#false} is VALID [2022-04-28 10:14:24,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {117312#false} ~cond := #in~cond; {117312#false} is VALID [2022-04-28 10:14:24,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {117312#false} assume 0 == ~cond; {117312#false} is VALID [2022-04-28 10:14:24,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {117312#false} assume !false; {117312#false} is VALID [2022-04-28 10:14:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:14:24,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:24,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985048141] [2022-04-28 10:14:24,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985048141] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:24,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045005010] [2022-04-28 10:14:24,208 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:24,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:24,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:24,209 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:24,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-04-28 10:14:24,352 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:14:24,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:24,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:14:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:24,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:24,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {117311#true} call ULTIMATE.init(); {117311#true} is VALID [2022-04-28 10:14:24,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {117311#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); {117311#true} is VALID [2022-04-28 10:14:24,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {117311#true} assume true; {117311#true} is VALID [2022-04-28 10:14:24,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117311#true} {117311#true} #72#return; {117311#true} is VALID [2022-04-28 10:14:24,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {117311#true} call #t~ret13 := main(); {117311#true} is VALID [2022-04-28 10:14:24,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {117311#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {117316#(= main_~y~0 0)} is VALID [2022-04-28 10:14:24,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {117316#(= 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; {117317#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:24,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {117317#(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; {117318#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:24,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {117318#(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; {117319#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:24,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {117319#(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; {117320#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:24,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {117320#(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; {117321#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:24,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {117321#(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; {117322#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:24,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {117322#(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; {117323#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:24,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {117323#(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; {117324#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:24,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {117324#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {117324#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:24,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {117324#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {117325#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:24,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {117325#(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; {117326#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:24,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {117326#(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; {117327#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:24,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {117327#(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; {117328#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:14:24,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {117328#(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; {117391#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:14:24,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {117391#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {117312#false} is VALID [2022-04-28 10:14:24,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,622 INFO L290 TraceCheckUtils]: 28: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:24,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {117312#false} assume !(~y~0 % 4294967296 > 0); {117312#false} is VALID [2022-04-28 10:14:24,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {117312#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {117312#false} is VALID [2022-04-28 10:14:24,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {117312#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {117312#false} is VALID [2022-04-28 10:14:24,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {117312#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {117312#false} is VALID [2022-04-28 10:14:24,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {117312#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {117312#false} is VALID [2022-04-28 10:14:24,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {117312#false} assume !(~x~0 % 4294967296 > 0); {117312#false} is VALID [2022-04-28 10:14:24,623 INFO L272 TraceCheckUtils]: 35: Hoare triple {117312#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {117312#false} is VALID [2022-04-28 10:14:24,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {117312#false} ~cond := #in~cond; {117312#false} is VALID [2022-04-28 10:14:24,623 INFO L290 TraceCheckUtils]: 37: Hoare triple {117312#false} assume 0 == ~cond; {117312#false} is VALID [2022-04-28 10:14:24,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {117312#false} assume !false; {117312#false} is VALID [2022-04-28 10:14:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:14:24,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:25,009 INFO L290 TraceCheckUtils]: 38: Hoare triple {117312#false} assume !false; {117312#false} is VALID [2022-04-28 10:14:25,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {117312#false} assume 0 == ~cond; {117312#false} is VALID [2022-04-28 10:14:25,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {117312#false} ~cond := #in~cond; {117312#false} is VALID [2022-04-28 10:14:25,010 INFO L272 TraceCheckUtils]: 35: Hoare triple {117312#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {117312#false} is VALID [2022-04-28 10:14:25,010 INFO L290 TraceCheckUtils]: 34: Hoare triple {117312#false} assume !(~x~0 % 4294967296 > 0); {117312#false} is VALID [2022-04-28 10:14:25,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {117312#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {117312#false} is VALID [2022-04-28 10:14:25,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {117312#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {117312#false} is VALID [2022-04-28 10:14:25,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {117312#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {117312#false} is VALID [2022-04-28 10:14:25,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {117312#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {117312#false} is VALID [2022-04-28 10:14:25,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {117312#false} assume !(~y~0 % 4294967296 > 0); {117312#false} is VALID [2022-04-28 10:14:25,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:25,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:25,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:25,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:25,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:25,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:25,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:25,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {117312#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {117312#false} is VALID [2022-04-28 10:14:25,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {117503#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {117312#false} is VALID [2022-04-28 10:14:25,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {117507#(< 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; {117503#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:25,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {117511#(< 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; {117507#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:25,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {117515#(< 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; {117511#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:25,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {117519#(< 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; {117515#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:25,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {117523#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {117519#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:25,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {117523#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {117523#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:25,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {117530#(< 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; {117523#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:25,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {117534#(< 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; {117530#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:25,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {117538#(< 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; {117534#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:25,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {117542#(< 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; {117538#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:25,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {117546#(< 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; {117542#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:25,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {117550#(< 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; {117546#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:25,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {117554#(< 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; {117550#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:25,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {117558#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {117554#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:25,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {117311#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {117558#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:25,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {117311#true} call #t~ret13 := main(); {117311#true} is VALID [2022-04-28 10:14:25,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117311#true} {117311#true} #72#return; {117311#true} is VALID [2022-04-28 10:14:25,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {117311#true} assume true; {117311#true} is VALID [2022-04-28 10:14:25,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {117311#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); {117311#true} is VALID [2022-04-28 10:14:25,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {117311#true} call ULTIMATE.init(); {117311#true} is VALID [2022-04-28 10:14:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:14:25,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045005010] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:25,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:25,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:14:25,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:25,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1462454139] [2022-04-28 10:14:25,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1462454139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:25,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:25,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:14:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314655052] [2022-04-28 10:14:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:25,023 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-28 10:14:25,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:25,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:14:25,043 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-28 10:14:25,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:14:25,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:25,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:14:25,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:14:25,043 INFO L87 Difference]: Start difference. First operand 438 states and 597 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:14:28,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:28,390 INFO L93 Difference]: Finished difference Result 508 states and 667 transitions. [2022-04-28 10:14:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:14:28,390 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-28 10:14:28,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:14:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 73 transitions. [2022-04-28 10:14:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:14:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 73 transitions. [2022-04-28 10:14:28,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 73 transitions. [2022-04-28 10:14:28,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:28,460 INFO L225 Difference]: With dead ends: 508 [2022-04-28 10:14:28,460 INFO L226 Difference]: Without dead ends: 489 [2022-04-28 10:14:28,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=537, Invalid=2219, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 10:14:28,461 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:28,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 70 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:14:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-04-28 10:14:30,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 438. [2022-04-28 10:14:30,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:30,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 489 states. Second operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:30,325 INFO L74 IsIncluded]: Start isIncluded. First operand 489 states. Second operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:30,326 INFO L87 Difference]: Start difference. First operand 489 states. Second operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:30,333 INFO L93 Difference]: Finished difference Result 489 states and 648 transitions. [2022-04-28 10:14:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 648 transitions. [2022-04-28 10:14:30,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:30,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:30,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 3 states have call successors, (3), 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 489 states. [2022-04-28 10:14:30,334 INFO L87 Difference]: Start difference. First operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 3 states have call successors, (3), 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 489 states. [2022-04-28 10:14:30,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:30,341 INFO L93 Difference]: Finished difference Result 489 states and 648 transitions. [2022-04-28 10:14:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 648 transitions. [2022-04-28 10:14:30,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:30,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:30,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:30,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 596 transitions. [2022-04-28 10:14:30,350 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 596 transitions. Word has length 39 [2022-04-28 10:14:30,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:30,350 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 596 transitions. [2022-04-28 10:14:30,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:14:30,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 438 states and 596 transitions. [2022-04-28 10:14:32,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 596 edges. 596 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 596 transitions. [2022-04-28 10:14:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:14:32,950 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:32,950 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:32,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-04-28 10:14:33,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:33,163 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:33,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:33,164 INFO L85 PathProgramCache]: Analyzing trace with hash -73295272, now seen corresponding path program 27 times [2022-04-28 10:14:33,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:33,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1304915687] [2022-04-28 10:14:33,166 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:33,166 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:33,166 INFO L85 PathProgramCache]: Analyzing trace with hash -73295272, now seen corresponding path program 28 times [2022-04-28 10:14:33,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:33,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365452391] [2022-04-28 10:14:33,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:33,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:33,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:33,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {120512#(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); {120491#true} is VALID [2022-04-28 10:14:33,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {120491#true} assume true; {120491#true} is VALID [2022-04-28 10:14:33,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120491#true} {120491#true} #72#return; {120491#true} is VALID [2022-04-28 10:14:33,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {120491#true} call ULTIMATE.init(); {120512#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:33,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {120512#(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); {120491#true} is VALID [2022-04-28 10:14:33,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {120491#true} assume true; {120491#true} is VALID [2022-04-28 10:14:33,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120491#true} {120491#true} #72#return; {120491#true} is VALID [2022-04-28 10:14:33,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {120491#true} call #t~ret13 := main(); {120491#true} is VALID [2022-04-28 10:14:33,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {120491#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {120491#true} is VALID [2022-04-28 10:14:33,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {120491#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120496#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:14:33,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {120496#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120497#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:14:33,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {120497#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120498#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:14:33,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {120498#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120499#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:14:33,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {120499#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120500#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:14:33,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {120500#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120501#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:14:33,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {120501#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120502#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:14:33,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {120502#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120503#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:14:33,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {120503#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {120503#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:14:33,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {120503#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {120503#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:14:33,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {120503#(<= (* (div (+ main_~x~0 8) 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; {120504#(<= (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:14:33,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {120504#(<= (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120505#(<= (+ 2 (* 4294967296 (div (+ main_~x~0 6) 4294967296))) main_~x~0)} is VALID [2022-04-28 10:14:33,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {120505#(<= (+ 2 (* 4294967296 (div (+ main_~x~0 6) 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; {120506#(<= (+ 3 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:14:33,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {120506#(<= (+ 3 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120507#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:14:33,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {120507#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120508#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 5) main_~x~0)} is VALID [2022-04-28 10:14:33,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {120508#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 5) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120509#(<= (+ 6 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:14:33,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {120509#(<= (+ 6 (* (div (+ main_~x~0 2) 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; {120510#(<= (+ 7 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:14:33,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {120510#(<= (+ 7 (* (div (+ main_~x~0 1) 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; {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:14:33,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:14:33,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:14:33,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:14:33,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:14:33,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:14:33,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:14:33,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:14:33,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:14:33,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:14:33,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:14:33,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {120511#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {120492#false} is VALID [2022-04-28 10:14:33,485 INFO L272 TraceCheckUtils]: 35: Hoare triple {120492#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {120492#false} is VALID [2022-04-28 10:14:33,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {120492#false} ~cond := #in~cond; {120492#false} is VALID [2022-04-28 10:14:33,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {120492#false} assume 0 == ~cond; {120492#false} is VALID [2022-04-28 10:14:33,485 INFO L290 TraceCheckUtils]: 38: Hoare triple {120492#false} assume !false; {120492#false} is VALID [2022-04-28 10:14:33,485 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:14:33,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:33,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365452391] [2022-04-28 10:14:33,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365452391] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:33,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142442834] [2022-04-28 10:14:33,486 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:14:33,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:33,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:33,487 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:33,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-04-28 10:14:33,531 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:14:33,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:33,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 10:14:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:33,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:33,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {120491#true} call ULTIMATE.init(); {120491#true} is VALID [2022-04-28 10:14:33,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {120491#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); {120491#true} is VALID [2022-04-28 10:14:33,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {120491#true} assume true; {120491#true} is VALID [2022-04-28 10:14:33,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120491#true} {120491#true} #72#return; {120491#true} is VALID [2022-04-28 10:14:33,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {120491#true} call #t~ret13 := main(); {120491#true} is VALID [2022-04-28 10:14:33,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {120491#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {120491#true} is VALID [2022-04-28 10:14:33,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {120491#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120496#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:14:33,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {120496#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120537#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:14:33,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {120537#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120541#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:33,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {120541#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120545#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:14:33,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {120545#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120549#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:33,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {120549#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120553#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:14:33,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {120553#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120557#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:14:33,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {120557#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120561#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:14:33,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {120561#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !(~x~0 % 4294967296 > 0); {120561#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:14:33,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {120561#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} ~z~0 := ~y~0; {120561#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:14:33,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {120561#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120557#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:14:33,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {120557#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120553#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:14:33,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {120553#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120549#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:33,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {120549#(<= main_~x~0 (+ 4294967290 (* (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; {120545#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:14:33,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {120545#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120541#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:33,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {120541#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {120537#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:14:33,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {120537#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120496#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:14:33,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {120496#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:33,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:33,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:33,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:33,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:33,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:33,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:33,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:33,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:33,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:33,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:33,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {120492#false} is VALID [2022-04-28 10:14:33,956 INFO L272 TraceCheckUtils]: 35: Hoare triple {120492#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {120492#false} is VALID [2022-04-28 10:14:33,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {120492#false} ~cond := #in~cond; {120492#false} is VALID [2022-04-28 10:14:33,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {120492#false} assume 0 == ~cond; {120492#false} is VALID [2022-04-28 10:14:33,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {120492#false} assume !false; {120492#false} is VALID [2022-04-28 10:14:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:14:33,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:34,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {120492#false} assume !false; {120492#false} is VALID [2022-04-28 10:14:34,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {120492#false} assume 0 == ~cond; {120492#false} is VALID [2022-04-28 10:14:34,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {120492#false} ~cond := #in~cond; {120492#false} is VALID [2022-04-28 10:14:34,243 INFO L272 TraceCheckUtils]: 35: Hoare triple {120492#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {120492#false} is VALID [2022-04-28 10:14:34,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {120492#false} is VALID [2022-04-28 10:14:34,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:34,244 INFO L290 TraceCheckUtils]: 32: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:34,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:34,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:34,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:34,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:34,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:34,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:34,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:34,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:34,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {120496#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120592#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:34,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {120537#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120496#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:14:34,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {120541#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {120537#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:14:34,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {120545#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120541#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:34,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {120549#(<= main_~x~0 (+ 4294967290 (* (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; {120545#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:14:34,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {120553#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120549#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:34,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {120557#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120553#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:14:34,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {120561#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {120557#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:14:34,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {120561#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} ~z~0 := ~y~0; {120561#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:14:34,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {120561#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !(~x~0 % 4294967296 > 0); {120561#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:14:34,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {120557#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120561#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:14:34,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {120553#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120557#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:14:34,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {120549#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120553#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:14:34,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {120545#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120549#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:34,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {120541#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120545#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:14:34,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {120537#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120541#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:34,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {120496#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120537#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:14:34,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {120491#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {120496#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:14:34,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {120491#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {120491#true} is VALID [2022-04-28 10:14:34,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {120491#true} call #t~ret13 := main(); {120491#true} is VALID [2022-04-28 10:14:34,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120491#true} {120491#true} #72#return; {120491#true} is VALID [2022-04-28 10:14:34,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {120491#true} assume true; {120491#true} is VALID [2022-04-28 10:14:34,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {120491#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); {120491#true} is VALID [2022-04-28 10:14:34,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {120491#true} call ULTIMATE.init(); {120491#true} is VALID [2022-04-28 10:14:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:14:34,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142442834] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:34,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:34,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 27 [2022-04-28 10:14:34,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:34,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1304915687] [2022-04-28 10:14:34,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1304915687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:34,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:34,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:14:34,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611954208] [2022-04-28 10:14:34,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:34,260 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 39 [2022-04-28 10:14:34,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:34,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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-28 10:14:34,287 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-28 10:14:34,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:14:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:34,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:14:34,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2022-04-28 10:14:34,288 INFO L87 Difference]: Start difference. First operand 438 states and 596 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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-28 10:14:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:38,090 INFO L93 Difference]: Finished difference Result 515 states and 706 transitions. [2022-04-28 10:14:38,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:14:38,090 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 39 [2022-04-28 10:14:38,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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-28 10:14:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 101 transitions. [2022-04-28 10:14:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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-28 10:14:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 101 transitions. [2022-04-28 10:14:38,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 101 transitions. [2022-04-28 10:14:38,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:38,205 INFO L225 Difference]: With dead ends: 515 [2022-04-28 10:14:38,205 INFO L226 Difference]: Without dead ends: 510 [2022-04-28 10:14:38,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1409, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:14:38,206 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 90 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:38,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 71 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:14:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-04-28 10:14:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 481. [2022-04-28 10:14:40,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:40,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 510 states. Second operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:40,325 INFO L74 IsIncluded]: Start isIncluded. First operand 510 states. Second operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:40,325 INFO L87 Difference]: Start difference. First operand 510 states. Second operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:40,333 INFO L93 Difference]: Finished difference Result 510 states and 694 transitions. [2022-04-28 10:14:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 694 transitions. [2022-04-28 10:14:40,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:40,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:40,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 3 states have call successors, (3), 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 510 states. [2022-04-28 10:14:40,334 INFO L87 Difference]: Start difference. First operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 3 states have call successors, (3), 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 510 states. [2022-04-28 10:14:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:40,342 INFO L93 Difference]: Finished difference Result 510 states and 694 transitions. [2022-04-28 10:14:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 694 transitions. [2022-04-28 10:14:40,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:40,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:40,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:40,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:40,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 657 transitions. [2022-04-28 10:14:40,352 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 657 transitions. Word has length 39 [2022-04-28 10:14:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:40,352 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 657 transitions. [2022-04-28 10:14:40,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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-28 10:14:40,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 481 states and 657 transitions. [2022-04-28 10:14:43,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 657 edges. 657 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:43,646 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 657 transitions. [2022-04-28 10:14:43,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:14:43,647 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:43,647 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:43,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:43,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:43,847 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:43,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:43,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1172865272, now seen corresponding path program 67 times [2022-04-28 10:14:43,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:43,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [371448925] [2022-04-28 10:14:43,850 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:43,850 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:43,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1172865272, now seen corresponding path program 68 times [2022-04-28 10:14:43,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:43,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7925164] [2022-04-28 10:14:43,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:43,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:44,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:44,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {123817#(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); {123798#true} is VALID [2022-04-28 10:14:44,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {123798#true} assume true; {123798#true} is VALID [2022-04-28 10:14:44,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123798#true} {123798#true} #72#return; {123798#true} is VALID [2022-04-28 10:14:44,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {123798#true} call ULTIMATE.init(); {123817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:44,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {123817#(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); {123798#true} is VALID [2022-04-28 10:14:44,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {123798#true} assume true; {123798#true} is VALID [2022-04-28 10:14:44,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123798#true} {123798#true} #72#return; {123798#true} is VALID [2022-04-28 10:14:44,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {123798#true} call #t~ret13 := main(); {123798#true} is VALID [2022-04-28 10:14:44,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {123798#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123803#(= main_~y~0 0)} is VALID [2022-04-28 10:14:44,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {123803#(= 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; {123804#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:44,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {123804#(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; {123805#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:44,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {123805#(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; {123806#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:44,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {123806#(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; {123807#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:44,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {123807#(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; {123808#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:44,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {123808#(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; {123809#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:44,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {123809#(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; {123810#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:44,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {123810#(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; {123811#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:44,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {123811#(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; {123812#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:44,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {123812#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {123812#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:44,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {123812#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {123813#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:44,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {123813#(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; {123814#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:44,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {123814#(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; {123815#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:44,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {123815#(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; {123816#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:44,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {123816#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {123799#false} is VALID [2022-04-28 10:14:44,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {123799#false} assume !(~y~0 % 4294967296 > 0); {123799#false} is VALID [2022-04-28 10:14:44,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {123799#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {123799#false} is VALID [2022-04-28 10:14:44,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {123799#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {123799#false} is VALID [2022-04-28 10:14:44,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {123799#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {123799#false} is VALID [2022-04-28 10:14:44,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {123799#false} assume !(~x~0 % 4294967296 > 0); {123799#false} is VALID [2022-04-28 10:14:44,100 INFO L272 TraceCheckUtils]: 35: Hoare triple {123799#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {123799#false} is VALID [2022-04-28 10:14:44,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {123799#false} ~cond := #in~cond; {123799#false} is VALID [2022-04-28 10:14:44,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {123799#false} assume 0 == ~cond; {123799#false} is VALID [2022-04-28 10:14:44,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {123799#false} assume !false; {123799#false} is VALID [2022-04-28 10:14:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-28 10:14:44,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:44,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7925164] [2022-04-28 10:14:44,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7925164] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:44,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605435393] [2022-04-28 10:14:44,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:44,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:44,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:44,102 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:44,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-04-28 10:14:44,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:44,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:44,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:14:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:44,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:44,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {123798#true} call ULTIMATE.init(); {123798#true} is VALID [2022-04-28 10:14:44,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {123798#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); {123798#true} is VALID [2022-04-28 10:14:44,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {123798#true} assume true; {123798#true} is VALID [2022-04-28 10:14:44,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123798#true} {123798#true} #72#return; {123798#true} is VALID [2022-04-28 10:14:44,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {123798#true} call #t~ret13 := main(); {123798#true} is VALID [2022-04-28 10:14:44,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {123798#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123803#(= main_~y~0 0)} is VALID [2022-04-28 10:14:44,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {123803#(= 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; {123804#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:44,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {123804#(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; {123805#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:44,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {123805#(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; {123806#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:44,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {123806#(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; {123807#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:44,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {123807#(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; {123808#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:44,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {123808#(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; {123809#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:44,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {123809#(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; {123810#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:44,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {123810#(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; {123811#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:44,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {123811#(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; {123812#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:44,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {123812#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {123812#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:44,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {123812#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {123813#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:44,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {123813#(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; {123814#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:44,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {123814#(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; {123815#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:44,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {123815#(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; {123878#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:44,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {123878#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {123799#false} is VALID [2022-04-28 10:14:44,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {123799#false} assume !(~y~0 % 4294967296 > 0); {123799#false} is VALID [2022-04-28 10:14:44,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {123799#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {123799#false} is VALID [2022-04-28 10:14:44,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {123799#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {123799#false} is VALID [2022-04-28 10:14:44,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {123799#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {123799#false} is VALID [2022-04-28 10:14:44,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {123799#false} assume !(~x~0 % 4294967296 > 0); {123799#false} is VALID [2022-04-28 10:14:44,421 INFO L272 TraceCheckUtils]: 35: Hoare triple {123799#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {123799#false} is VALID [2022-04-28 10:14:44,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {123799#false} ~cond := #in~cond; {123799#false} is VALID [2022-04-28 10:14:44,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {123799#false} assume 0 == ~cond; {123799#false} is VALID [2022-04-28 10:14:44,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {123799#false} assume !false; {123799#false} is VALID [2022-04-28 10:14:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-28 10:14:44,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:44,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {123799#false} assume !false; {123799#false} is VALID [2022-04-28 10:14:44,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {123799#false} assume 0 == ~cond; {123799#false} is VALID [2022-04-28 10:14:44,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {123799#false} ~cond := #in~cond; {123799#false} is VALID [2022-04-28 10:14:44,825 INFO L272 TraceCheckUtils]: 35: Hoare triple {123799#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {123799#false} is VALID [2022-04-28 10:14:44,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {123799#false} assume !(~x~0 % 4294967296 > 0); {123799#false} is VALID [2022-04-28 10:14:44,825 INFO L290 TraceCheckUtils]: 33: Hoare triple {123799#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {123799#false} is VALID [2022-04-28 10:14:44,825 INFO L290 TraceCheckUtils]: 32: Hoare triple {123799#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {123799#false} is VALID [2022-04-28 10:14:44,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {123799#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {123799#false} is VALID [2022-04-28 10:14:44,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {123799#false} assume !(~y~0 % 4294967296 > 0); {123799#false} is VALID [2022-04-28 10:14:44,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {123799#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123799#false} is VALID [2022-04-28 10:14:44,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {123990#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {123799#false} is VALID [2022-04-28 10:14:44,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {123994#(< 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; {123990#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:44,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {123998#(< 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; {123994#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:44,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {124002#(< 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; {123998#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:44,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {124006#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {124002#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:44,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {124006#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {124006#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:44,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {124013#(< 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; {124006#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:44,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {124017#(< 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; {124013#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:44,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {124021#(< 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; {124017#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:44,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {124025#(< 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; {124021#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:44,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {124029#(< 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; {124025#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:44,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {124033#(< 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; {124029#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:44,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {124037#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {124033#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:44,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {124041#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {124037#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:44,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {124045#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {124041#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:44,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {123798#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {124045#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:44,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {123798#true} call #t~ret13 := main(); {123798#true} is VALID [2022-04-28 10:14:44,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123798#true} {123798#true} #72#return; {123798#true} is VALID [2022-04-28 10:14:44,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {123798#true} assume true; {123798#true} is VALID [2022-04-28 10:14:44,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {123798#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); {123798#true} is VALID [2022-04-28 10:14:44,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {123798#true} call ULTIMATE.init(); {123798#true} is VALID [2022-04-28 10:14:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-28 10:14:44,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605435393] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:44,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:44,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:14:44,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:44,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [371448925] [2022-04-28 10:14:44,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [371448925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:44,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:44,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:14:44,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160320623] [2022-04-28 10:14:44,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:44,839 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-28 10:14:44,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:44,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:14:44,859 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-28 10:14:44,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:14:44,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:44,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:14:44,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:14:44,860 INFO L87 Difference]: Start difference. First operand 481 states and 657 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:14:48,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:48,776 INFO L93 Difference]: Finished difference Result 576 states and 752 transitions. [2022-04-28 10:14:48,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:14:48,777 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-28 10:14:48,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:14:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 77 transitions. [2022-04-28 10:14:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:14:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 77 transitions. [2022-04-28 10:14:48,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 77 transitions. [2022-04-28 10:14:48,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:48,853 INFO L225 Difference]: With dead ends: 576 [2022-04-28 10:14:48,853 INFO L226 Difference]: Without dead ends: 557 [2022-04-28 10:14:48,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=529, Invalid=2123, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:14:48,853 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:48,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 79 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:14:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-04-28 10:14:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 481. [2022-04-28 10:14:50,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:50,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 557 states. Second operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:50,983 INFO L74 IsIncluded]: Start isIncluded. First operand 557 states. Second operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:50,983 INFO L87 Difference]: Start difference. First operand 557 states. Second operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:50,993 INFO L93 Difference]: Finished difference Result 557 states and 733 transitions. [2022-04-28 10:14:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 733 transitions. [2022-04-28 10:14:50,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:50,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:50,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 3 states have call successors, (3), 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 557 states. [2022-04-28 10:14:50,994 INFO L87 Difference]: Start difference. First operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 3 states have call successors, (3), 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 557 states. [2022-04-28 10:14:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:51,003 INFO L93 Difference]: Finished difference Result 557 states and 733 transitions. [2022-04-28 10:14:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 733 transitions. [2022-04-28 10:14:51,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:51,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:51,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:51,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 656 transitions. [2022-04-28 10:14:51,012 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 656 transitions. Word has length 39 [2022-04-28 10:14:51,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:51,013 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 656 transitions. [2022-04-28 10:14:51,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:14:51,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 481 states and 656 transitions. [2022-04-28 10:14:54,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 656 edges. 656 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 656 transitions. [2022-04-28 10:14:54,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:14:54,297 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:54,297 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:54,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:54,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:54,497 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:54,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:54,497 INFO L85 PathProgramCache]: Analyzing trace with hash 475466840, now seen corresponding path program 69 times [2022-04-28 10:14:54,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:54,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1392945206] [2022-04-28 10:14:54,500 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:54,500 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:54,500 INFO L85 PathProgramCache]: Analyzing trace with hash 475466840, now seen corresponding path program 70 times [2022-04-28 10:14:54,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:54,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702128692] [2022-04-28 10:14:54,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:54,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:54,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:54,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {127353#(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); {127334#true} is VALID [2022-04-28 10:14:54,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {127334#true} assume true; {127334#true} is VALID [2022-04-28 10:14:54,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {127334#true} {127334#true} #72#return; {127334#true} is VALID [2022-04-28 10:14:54,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {127334#true} call ULTIMATE.init(); {127353#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:54,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {127353#(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); {127334#true} is VALID [2022-04-28 10:14:54,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {127334#true} assume true; {127334#true} is VALID [2022-04-28 10:14:54,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127334#true} {127334#true} #72#return; {127334#true} is VALID [2022-04-28 10:14:54,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {127334#true} call #t~ret13 := main(); {127334#true} is VALID [2022-04-28 10:14:54,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {127334#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {127339#(= main_~y~0 0)} is VALID [2022-04-28 10:14:54,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {127339#(= 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; {127340#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:54,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {127340#(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; {127341#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:54,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {127341#(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; {127342#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:54,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {127342#(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; {127343#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:54,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {127343#(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; {127344#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:54,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {127344#(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; {127345#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:54,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {127345#(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; {127346#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:54,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {127346#(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; {127347#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:54,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {127347#(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; {127348#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:54,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {127348#(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; {127349#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:54,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {127349#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {127349#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:54,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {127349#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {127350#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:54,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {127350#(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; {127351#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:54,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {127351#(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; {127352#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:54,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {127352#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {127335#false} is VALID [2022-04-28 10:14:54,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:54,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:54,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:54,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:54,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:54,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:54,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:54,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:54,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:54,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:54,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {127335#false} assume !(~y~0 % 4294967296 > 0); {127335#false} is VALID [2022-04-28 10:14:54,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {127335#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {127335#false} is VALID [2022-04-28 10:14:54,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {127335#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {127335#false} is VALID [2022-04-28 10:14:54,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {127335#false} assume !(~x~0 % 4294967296 > 0); {127335#false} is VALID [2022-04-28 10:14:54,722 INFO L272 TraceCheckUtils]: 35: Hoare triple {127335#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {127335#false} is VALID [2022-04-28 10:14:54,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {127335#false} ~cond := #in~cond; {127335#false} is VALID [2022-04-28 10:14:54,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {127335#false} assume 0 == ~cond; {127335#false} is VALID [2022-04-28 10:14:54,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {127335#false} assume !false; {127335#false} is VALID [2022-04-28 10:14:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-28 10:14:54,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:54,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702128692] [2022-04-28 10:14:54,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702128692] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:54,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349490342] [2022-04-28 10:14:54,723 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:14:54,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:54,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:54,724 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:54,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-04-28 10:14:54,768 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:14:54,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:54,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:14:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:54,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:55,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {127334#true} call ULTIMATE.init(); {127334#true} is VALID [2022-04-28 10:14:55,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {127334#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); {127334#true} is VALID [2022-04-28 10:14:55,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {127334#true} assume true; {127334#true} is VALID [2022-04-28 10:14:55,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127334#true} {127334#true} #72#return; {127334#true} is VALID [2022-04-28 10:14:55,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {127334#true} call #t~ret13 := main(); {127334#true} is VALID [2022-04-28 10:14:55,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {127334#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {127339#(= main_~y~0 0)} is VALID [2022-04-28 10:14:55,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {127339#(= 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; {127340#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:55,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {127340#(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; {127341#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:55,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {127341#(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; {127342#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:55,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {127342#(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; {127343#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:55,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {127343#(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; {127344#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:55,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {127344#(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; {127345#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:55,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {127345#(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; {127346#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:55,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {127346#(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; {127347#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:55,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {127347#(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; {127348#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:55,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {127348#(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; {127349#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:55,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {127349#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {127349#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:55,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {127349#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {127350#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:55,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {127350#(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; {127351#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:55,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {127351#(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; {127414#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:55,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {127414#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {127335#false} is VALID [2022-04-28 10:14:55,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {127335#false} assume !(~y~0 % 4294967296 > 0); {127335#false} is VALID [2022-04-28 10:14:55,042 INFO L290 TraceCheckUtils]: 32: Hoare triple {127335#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {127335#false} is VALID [2022-04-28 10:14:55,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {127335#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {127335#false} is VALID [2022-04-28 10:14:55,043 INFO L290 TraceCheckUtils]: 34: Hoare triple {127335#false} assume !(~x~0 % 4294967296 > 0); {127335#false} is VALID [2022-04-28 10:14:55,043 INFO L272 TraceCheckUtils]: 35: Hoare triple {127335#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {127335#false} is VALID [2022-04-28 10:14:55,043 INFO L290 TraceCheckUtils]: 36: Hoare triple {127335#false} ~cond := #in~cond; {127335#false} is VALID [2022-04-28 10:14:55,043 INFO L290 TraceCheckUtils]: 37: Hoare triple {127335#false} assume 0 == ~cond; {127335#false} is VALID [2022-04-28 10:14:55,043 INFO L290 TraceCheckUtils]: 38: Hoare triple {127335#false} assume !false; {127335#false} is VALID [2022-04-28 10:14:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-28 10:14:55,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:55,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {127335#false} assume !false; {127335#false} is VALID [2022-04-28 10:14:55,479 INFO L290 TraceCheckUtils]: 37: Hoare triple {127335#false} assume 0 == ~cond; {127335#false} is VALID [2022-04-28 10:14:55,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {127335#false} ~cond := #in~cond; {127335#false} is VALID [2022-04-28 10:14:55,479 INFO L272 TraceCheckUtils]: 35: Hoare triple {127335#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {127335#false} is VALID [2022-04-28 10:14:55,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {127335#false} assume !(~x~0 % 4294967296 > 0); {127335#false} is VALID [2022-04-28 10:14:55,479 INFO L290 TraceCheckUtils]: 33: Hoare triple {127335#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {127335#false} is VALID [2022-04-28 10:14:55,479 INFO L290 TraceCheckUtils]: 32: Hoare triple {127335#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {127335#false} is VALID [2022-04-28 10:14:55,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {127335#false} assume !(~y~0 % 4294967296 > 0); {127335#false} is VALID [2022-04-28 10:14:55,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {127335#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127335#false} is VALID [2022-04-28 10:14:55,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {127526#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {127335#false} is VALID [2022-04-28 10:14:55,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {127530#(< 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; {127526#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:55,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {127534#(< 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; {127530#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:55,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {127538#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {127534#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:55,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {127538#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {127538#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:55,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {127545#(< 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; {127538#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:55,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {127549#(< 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; {127545#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:55,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {127553#(< 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; {127549#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:55,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {127557#(< 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; {127553#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:55,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {127561#(< 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; {127557#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:55,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {127565#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127561#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:55,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {127569#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127565#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:55,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {127573#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127569#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:55,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {127577#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127573#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:55,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {127581#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127577#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:55,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {127334#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {127581#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:14:55,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {127334#true} call #t~ret13 := main(); {127334#true} is VALID [2022-04-28 10:14:55,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127334#true} {127334#true} #72#return; {127334#true} is VALID [2022-04-28 10:14:55,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {127334#true} assume true; {127334#true} is VALID [2022-04-28 10:14:55,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {127334#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); {127334#true} is VALID [2022-04-28 10:14:55,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {127334#true} call ULTIMATE.init(); {127334#true} is VALID [2022-04-28 10:14:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-28 10:14:55,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349490342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:55,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:55,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:14:55,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:55,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1392945206] [2022-04-28 10:14:55,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1392945206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:55,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:55,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:14:55,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107257547] [2022-04-28 10:14:55,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:55,491 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-28 10:14:55,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:55,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:14:55,510 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-28 10:14:55,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:14:55,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:55,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:14:55,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:14:55,511 INFO L87 Difference]: Start difference. First operand 481 states and 656 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:14:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:59,644 INFO L93 Difference]: Finished difference Result 593 states and 768 transitions. [2022-04-28 10:14:59,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:14:59,644 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-28 10:14:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:14:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 79 transitions. [2022-04-28 10:14:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:14:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 79 transitions. [2022-04-28 10:14:59,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 79 transitions. [2022-04-28 10:14:59,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:59,722 INFO L225 Difference]: With dead ends: 593 [2022-04-28 10:14:59,722 INFO L226 Difference]: Without dead ends: 574 [2022-04-28 10:14:59,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=482, Invalid=1870, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:14:59,722 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 52 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:59,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 98 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:14:59,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-04-28 10:15:01,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 481. [2022-04-28 10:15:01,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:01,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 574 states. Second operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:01,843 INFO L74 IsIncluded]: Start isIncluded. First operand 574 states. Second operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:01,843 INFO L87 Difference]: Start difference. First operand 574 states. Second operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:01,853 INFO L93 Difference]: Finished difference Result 574 states and 749 transitions. [2022-04-28 10:15:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 749 transitions. [2022-04-28 10:15:01,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:01,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:01,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 3 states have call successors, (3), 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 574 states. [2022-04-28 10:15:01,854 INFO L87 Difference]: Start difference. First operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 3 states have call successors, (3), 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 574 states. [2022-04-28 10:15:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:01,863 INFO L93 Difference]: Finished difference Result 574 states and 749 transitions. [2022-04-28 10:15:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 749 transitions. [2022-04-28 10:15:01,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:01,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:01,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:01,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 655 transitions. [2022-04-28 10:15:01,873 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 655 transitions. Word has length 39 [2022-04-28 10:15:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:01,873 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 655 transitions. [2022-04-28 10:15:01,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:15:01,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 481 states and 655 transitions. [2022-04-28 10:15:04,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 655 edges. 655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 655 transitions. [2022-04-28 10:15:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:15:04,845 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:04,845 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:04,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-04-28 10:15:05,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2022-04-28 10:15:05,046 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:05,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:05,046 INFO L85 PathProgramCache]: Analyzing trace with hash 944280840, now seen corresponding path program 71 times [2022-04-28 10:15:05,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:05,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022662575] [2022-04-28 10:15:05,048 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:05,048 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 944280840, now seen corresponding path program 72 times [2022-04-28 10:15:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:05,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549324274] [2022-04-28 10:15:05,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:05,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:05,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:05,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {130951#(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); {130932#true} is VALID [2022-04-28 10:15:05,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {130932#true} assume true; {130932#true} is VALID [2022-04-28 10:15:05,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {130932#true} {130932#true} #72#return; {130932#true} is VALID [2022-04-28 10:15:05,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {130932#true} call ULTIMATE.init(); {130951#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:05,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {130951#(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); {130932#true} is VALID [2022-04-28 10:15:05,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {130932#true} assume true; {130932#true} is VALID [2022-04-28 10:15:05,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130932#true} {130932#true} #72#return; {130932#true} is VALID [2022-04-28 10:15:05,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {130932#true} call #t~ret13 := main(); {130932#true} is VALID [2022-04-28 10:15:05,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {130932#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {130937#(= main_~y~0 0)} is VALID [2022-04-28 10:15:05,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {130937#(= 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; {130938#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:05,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {130938#(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; {130939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:05,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {130939#(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; {130940#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:05,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {130940#(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; {130941#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:05,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {130941#(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; {130942#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:05,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {130942#(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; {130943#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:05,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {130943#(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; {130944#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:05,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {130944#(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; {130945#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:05,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {130945#(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; {130946#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:05,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {130946#(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; {130947#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:05,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {130947#(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; {130948#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:05,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {130948#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {130948#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:05,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {130948#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {130949#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:15:05,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {130949#(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; {130950#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:15:05,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {130950#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {130933#false} is VALID [2022-04-28 10:15:05,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {130933#false} assume !(~y~0 % 4294967296 > 0); {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {130933#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {130933#false} assume !(~x~0 % 4294967296 > 0); {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L272 TraceCheckUtils]: 35: Hoare triple {130933#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {130933#false} ~cond := #in~cond; {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {130933#false} assume 0 == ~cond; {130933#false} is VALID [2022-04-28 10:15:05,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {130933#false} assume !false; {130933#false} is VALID [2022-04-28 10:15:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-04-28 10:15:05,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:05,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549324274] [2022-04-28 10:15:05,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549324274] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:05,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708970705] [2022-04-28 10:15:05,289 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:15:05,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:05,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:05,290 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:05,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-04-28 10:15:05,348 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:15:05,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:05,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:15:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:05,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:05,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {130932#true} call ULTIMATE.init(); {130932#true} is VALID [2022-04-28 10:15:05,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {130932#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); {130932#true} is VALID [2022-04-28 10:15:05,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {130932#true} assume true; {130932#true} is VALID [2022-04-28 10:15:05,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130932#true} {130932#true} #72#return; {130932#true} is VALID [2022-04-28 10:15:05,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {130932#true} call #t~ret13 := main(); {130932#true} is VALID [2022-04-28 10:15:05,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {130932#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {130932#true} is VALID [2022-04-28 10:15:05,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {130932#true} assume !(~x~0 % 4294967296 > 0); {130932#true} is VALID [2022-04-28 10:15:05,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {130932#true} ~z~0 := ~y~0; {131009#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:15:05,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {131009#(= 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; {131013#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:15:05,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {131013#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {131017#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:15:05,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {131017#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131021#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:15:05,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {131021#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {130933#false} assume !(~y~0 % 4294967296 > 0); {130933#false} is VALID [2022-04-28 10:15:05,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {130933#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {130933#false} is VALID [2022-04-28 10:15:05,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {130933#false} assume !(~x~0 % 4294967296 > 0); {130933#false} is VALID [2022-04-28 10:15:05,493 INFO L272 TraceCheckUtils]: 35: Hoare triple {130933#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {130933#false} is VALID [2022-04-28 10:15:05,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {130933#false} ~cond := #in~cond; {130933#false} is VALID [2022-04-28 10:15:05,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {130933#false} assume 0 == ~cond; {130933#false} is VALID [2022-04-28 10:15:05,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {130933#false} assume !false; {130933#false} is VALID [2022-04-28 10:15:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 10:15:05,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:05,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {130933#false} assume !false; {130933#false} is VALID [2022-04-28 10:15:05,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {130933#false} assume 0 == ~cond; {130933#false} is VALID [2022-04-28 10:15:05,627 INFO L290 TraceCheckUtils]: 36: Hoare triple {130933#false} ~cond := #in~cond; {130933#false} is VALID [2022-04-28 10:15:05,628 INFO L272 TraceCheckUtils]: 35: Hoare triple {130933#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {130933#false} is VALID [2022-04-28 10:15:05,628 INFO L290 TraceCheckUtils]: 34: Hoare triple {130933#false} assume !(~x~0 % 4294967296 > 0); {130933#false} is VALID [2022-04-28 10:15:05,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {130933#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {130933#false} is VALID [2022-04-28 10:15:05,628 INFO L290 TraceCheckUtils]: 32: Hoare triple {130933#false} assume !(~y~0 % 4294967296 > 0); {130933#false} is VALID [2022-04-28 10:15:05,628 INFO L290 TraceCheckUtils]: 31: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {130933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {131021#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {130933#false} is VALID [2022-04-28 10:15:05,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {131017#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {131021#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:15:05,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {131127#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {131017#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:15:05,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {131131#(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; {131127#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:15:05,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {130932#true} ~z~0 := ~y~0; {131131#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:15:05,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {130932#true} assume !(~x~0 % 4294967296 > 0); {130932#true} is VALID [2022-04-28 10:15:05,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {130932#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {130932#true} is VALID [2022-04-28 10:15:05,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {130932#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {130932#true} is VALID [2022-04-28 10:15:05,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {130932#true} call #t~ret13 := main(); {130932#true} is VALID [2022-04-28 10:15:05,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130932#true} {130932#true} #72#return; {130932#true} is VALID [2022-04-28 10:15:05,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {130932#true} assume true; {130932#true} is VALID [2022-04-28 10:15:05,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {130932#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); {130932#true} is VALID [2022-04-28 10:15:05,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {130932#true} call ULTIMATE.init(); {130932#true} is VALID [2022-04-28 10:15:05,632 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 10:15:05,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708970705] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:05,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:05,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 23 [2022-04-28 10:15:05,633 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:05,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022662575] [2022-04-28 10:15:05,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022662575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:05,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:05,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:15:05,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149749387] [2022-04-28 10:15:05,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:05,633 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-28 10:15:05,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:05,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:15:05,652 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-28 10:15:05,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:15:05,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:05,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:15:05,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:15:05,653 INFO L87 Difference]: Start difference. First operand 481 states and 655 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:15:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:10,026 INFO L93 Difference]: Finished difference Result 612 states and 786 transitions. [2022-04-28 10:15:10,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:15:10,026 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-28 10:15:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:15:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-28 10:15:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:15:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-28 10:15:10,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 82 transitions. [2022-04-28 10:15:10,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:10,120 INFO L225 Difference]: With dead ends: 612 [2022-04-28 10:15:10,121 INFO L226 Difference]: Without dead ends: 593 [2022-04-28 10:15:10,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=1271, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:15:10,121 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 63 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:10,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 102 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:15:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-04-28 10:15:12,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 481. [2022-04-28 10:15:12,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:12,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 593 states. Second operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:12,260 INFO L74 IsIncluded]: Start isIncluded. First operand 593 states. Second operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:12,260 INFO L87 Difference]: Start difference. First operand 593 states. Second operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:12,270 INFO L93 Difference]: Finished difference Result 593 states and 767 transitions. [2022-04-28 10:15:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 767 transitions. [2022-04-28 10:15:12,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:12,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:12,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 3 states have call successors, (3), 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 593 states. [2022-04-28 10:15:12,271 INFO L87 Difference]: Start difference. First operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 3 states have call successors, (3), 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 593 states. [2022-04-28 10:15:12,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:12,281 INFO L93 Difference]: Finished difference Result 593 states and 767 transitions. [2022-04-28 10:15:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 767 transitions. [2022-04-28 10:15:12,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:12,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:12,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:12,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 654 transitions. [2022-04-28 10:15:12,291 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 654 transitions. Word has length 39 [2022-04-28 10:15:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:12,291 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 654 transitions. [2022-04-28 10:15:12,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-28 10:15:12,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 481 states and 654 transitions. [2022-04-28 10:15:16,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 654 edges. 654 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:16,585 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 654 transitions. [2022-04-28 10:15:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:15:16,586 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:16,586 INFO L195 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:16,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-04-28 10:15:16,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:16,787 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:16,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:16,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1122018264, now seen corresponding path program 47 times [2022-04-28 10:15:16,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:16,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2098442330] [2022-04-28 10:15:16,790 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:16,790 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:16,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1122018264, now seen corresponding path program 48 times [2022-04-28 10:15:16,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:16,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816918378] [2022-04-28 10:15:16,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:16,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:17,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:17,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {134624#(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); {134593#true} is VALID [2022-04-28 10:15:17,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {134593#true} assume true; {134593#true} is VALID [2022-04-28 10:15:17,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {134593#true} {134593#true} #72#return; {134593#true} is VALID [2022-04-28 10:15:17,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {134593#true} call ULTIMATE.init(); {134624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:17,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {134624#(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); {134593#true} is VALID [2022-04-28 10:15:17,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {134593#true} assume true; {134593#true} is VALID [2022-04-28 10:15:17,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134593#true} {134593#true} #72#return; {134593#true} is VALID [2022-04-28 10:15:17,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {134593#true} call #t~ret13 := main(); {134593#true} is VALID [2022-04-28 10:15:17,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {134593#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {134598#(= main_~y~0 0)} is VALID [2022-04-28 10:15:17,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {134598#(= 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; {134599#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:17,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {134599#(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; {134600#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:17,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {134600#(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; {134601#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:17,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {134601#(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; {134602#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:17,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {134602#(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; {134603#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:17,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {134603#(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; {134604#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:17,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {134604#(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; {134605#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:17,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {134605#(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; {134606#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:17,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {134606#(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; {134607#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:17,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {134607#(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; {134608#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:17,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {134608#(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; {134609#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:17,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {134609#(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; {134610#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:17,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {134610#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134611#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:17,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {134611#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134612#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:17,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {134612#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134613#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:17,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {134613#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134614#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:15:17,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {134614#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134615#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:15:17,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {134615#(and (<= main_~y~0 17) (<= 17 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; {134616#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:15:17,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {134616#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134617#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:15:17,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {134617#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134618#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:15:17,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {134618#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134619#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:15:17,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {134619#(and (<= main_~y~0 21) (<= 21 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; {134620#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:17,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {134620#(and (<= main_~y~0 22) (<= 22 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; {134621#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:15:17,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {134621#(and (<= main_~y~0 23) (<= 23 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; {134622#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:15:17,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {134622#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {134622#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:15:17,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {134622#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {134623#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} is VALID [2022-04-28 10:15:17,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {134623#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {134594#false} is VALID [2022-04-28 10:15:17,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {134594#false} assume !(~y~0 % 4294967296 > 0); {134594#false} is VALID [2022-04-28 10:15:17,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {134594#false} assume !(~x~0 % 4294967296 > 0); {134594#false} is VALID [2022-04-28 10:15:17,306 INFO L272 TraceCheckUtils]: 35: Hoare triple {134594#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {134594#false} is VALID [2022-04-28 10:15:17,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {134594#false} ~cond := #in~cond; {134594#false} is VALID [2022-04-28 10:15:17,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {134594#false} assume 0 == ~cond; {134594#false} is VALID [2022-04-28 10:15:17,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {134594#false} assume !false; {134594#false} is VALID [2022-04-28 10:15:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:17,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:17,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816918378] [2022-04-28 10:15:17,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816918378] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:17,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671060252] [2022-04-28 10:15:17,306 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:15:17,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:17,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:17,307 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:17,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-04-28 10:15:18,361 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 10:15:18,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:18,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-28 10:15:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:18,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:18,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {134593#true} call ULTIMATE.init(); {134593#true} is VALID [2022-04-28 10:15:18,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {134593#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); {134593#true} is VALID [2022-04-28 10:15:18,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {134593#true} assume true; {134593#true} is VALID [2022-04-28 10:15:18,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134593#true} {134593#true} #72#return; {134593#true} is VALID [2022-04-28 10:15:18,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {134593#true} call #t~ret13 := main(); {134593#true} is VALID [2022-04-28 10:15:18,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {134593#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {134598#(= main_~y~0 0)} is VALID [2022-04-28 10:15:18,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {134598#(= 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; {134599#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:18,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {134599#(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; {134600#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:18,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {134600#(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; {134601#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:18,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {134601#(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; {134602#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:18,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {134602#(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; {134603#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:18,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {134603#(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; {134604#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:18,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {134604#(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; {134605#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:18,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {134605#(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; {134606#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:18,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {134606#(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; {134607#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:18,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {134607#(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; {134608#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:18,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {134608#(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; {134609#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:18,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {134609#(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; {134610#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:18,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {134610#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134611#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:18,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {134611#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134612#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:18,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {134612#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134613#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:18,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {134613#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134614#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:15:18,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {134614#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134615#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:15:18,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {134615#(and (<= main_~y~0 17) (<= 17 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; {134616#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:15:18,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {134616#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134617#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:15:18,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {134617#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134618#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:15:18,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {134618#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134619#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:15:18,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {134619#(and (<= main_~y~0 21) (<= 21 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; {134620#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:18,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {134620#(and (<= main_~y~0 22) (<= 22 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; {134621#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:15:18,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {134621#(and (<= main_~y~0 23) (<= 23 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; {134622#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:15:18,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {134622#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {134622#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:15:18,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {134622#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {134721#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-28 10:15:18,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {134721#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {134594#false} is VALID [2022-04-28 10:15:18,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {134594#false} assume !(~y~0 % 4294967296 > 0); {134594#false} is VALID [2022-04-28 10:15:18,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {134594#false} assume !(~x~0 % 4294967296 > 0); {134594#false} is VALID [2022-04-28 10:15:18,751 INFO L272 TraceCheckUtils]: 35: Hoare triple {134594#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {134594#false} is VALID [2022-04-28 10:15:18,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {134594#false} ~cond := #in~cond; {134594#false} is VALID [2022-04-28 10:15:18,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {134594#false} assume 0 == ~cond; {134594#false} is VALID [2022-04-28 10:15:18,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {134594#false} assume !false; {134594#false} is VALID [2022-04-28 10:15:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:18,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:19,889 INFO L290 TraceCheckUtils]: 38: Hoare triple {134594#false} assume !false; {134594#false} is VALID [2022-04-28 10:15:19,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {134594#false} assume 0 == ~cond; {134594#false} is VALID [2022-04-28 10:15:19,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {134594#false} ~cond := #in~cond; {134594#false} is VALID [2022-04-28 10:15:19,890 INFO L272 TraceCheckUtils]: 35: Hoare triple {134594#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {134594#false} is VALID [2022-04-28 10:15:19,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {134594#false} assume !(~x~0 % 4294967296 > 0); {134594#false} is VALID [2022-04-28 10:15:19,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {134594#false} assume !(~y~0 % 4294967296 > 0); {134594#false} is VALID [2022-04-28 10:15:19,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {134761#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {134594#false} is VALID [2022-04-28 10:15:19,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {134765#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {134761#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:19,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {134765#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {134765#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:19,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {134772#(< 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; {134765#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:19,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {134776#(< 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; {134772#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:15:19,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {134780#(< 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; {134776#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:15:19,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {134784#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134780#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:15:19,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {134788#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134784#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:15:19,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {134792#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134788#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:19,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {134796#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134792#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:15:19,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {134800#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134796#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:19,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {134804#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134800#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:15:19,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {134808#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134804#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:15:19,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {134812#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134808#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:15:19,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {134816#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134812#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:15:19,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {134820#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134816#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:15:19,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {134824#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134820#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:15:19,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {134828#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134824#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:15:19,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {134832#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134828#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:15:19,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {134836#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134832#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:15:19,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {134840#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134836#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:15:19,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {134844#(< 0 (mod (+ 19 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; {134840#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:15:19,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {134848#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134844#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:19,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {134852#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134848#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:15:19,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {134856#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134852#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:15:19,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {134860#(< 0 (mod (+ 23 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; {134856#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:15:19,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {134864#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134860#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:19,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {134593#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {134864#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:15:19,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {134593#true} call #t~ret13 := main(); {134593#true} is VALID [2022-04-28 10:15:19,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134593#true} {134593#true} #72#return; {134593#true} is VALID [2022-04-28 10:15:19,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {134593#true} assume true; {134593#true} is VALID [2022-04-28 10:15:19,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {134593#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); {134593#true} is VALID [2022-04-28 10:15:19,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {134593#true} call ULTIMATE.init(); {134593#true} is VALID [2022-04-28 10:15:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:19,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671060252] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:19,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:19,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-28 10:15:19,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:19,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2098442330] [2022-04-28 10:15:19,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2098442330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:19,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:19,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 10:15:19,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623043291] [2022-04-28 10:15:19,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:19,909 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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 39 [2022-04-28 10:15:19,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:19,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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-28 10:15:19,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:19,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 10:15:19,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:19,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 10:15:19,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=2344, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:15:19,934 INFO L87 Difference]: Start difference. First operand 481 states and 654 transitions. Second operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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-28 10:15:28,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:28,587 INFO L93 Difference]: Finished difference Result 764 states and 1184 transitions. [2022-04-28 10:15:28,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:15:28,587 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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 39 [2022-04-28 10:15:28,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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-28 10:15:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 183 transitions. [2022-04-28 10:15:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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-28 10:15:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 183 transitions. [2022-04-28 10:15:28,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 183 transitions. [2022-04-28 10:15:28,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:28,756 INFO L225 Difference]: With dead ends: 764 [2022-04-28 10:15:28,756 INFO L226 Difference]: Without dead ends: 734 [2022-04-28 10:15:28,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1492, Invalid=5150, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 10:15:28,756 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 170 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 3403 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 3506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:28,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 200 Invalid, 3506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3403 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 10:15:28,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-04-28 10:15:30,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 502. [2022-04-28 10:15:30,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:30,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 734 states. Second operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:30,940 INFO L74 IsIncluded]: Start isIncluded. First operand 734 states. Second operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:30,940 INFO L87 Difference]: Start difference. First operand 734 states. Second operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:30,954 INFO L93 Difference]: Finished difference Result 734 states and 918 transitions. [2022-04-28 10:15:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 918 transitions. [2022-04-28 10:15:30,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:30,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:30,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 3 states have call successors, (3), 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 734 states. [2022-04-28 10:15:30,955 INFO L87 Difference]: Start difference. First operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 3 states have call successors, (3), 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 734 states. [2022-04-28 10:15:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:30,969 INFO L93 Difference]: Finished difference Result 734 states and 918 transitions. [2022-04-28 10:15:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 918 transitions. [2022-04-28 10:15:30,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:30,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:30,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:30,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 685 transitions. [2022-04-28 10:15:30,979 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 685 transitions. Word has length 39 [2022-04-28 10:15:30,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:30,980 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 685 transitions. [2022-04-28 10:15:30,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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-28 10:15:30,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 502 states and 685 transitions. [2022-04-28 10:15:35,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 685 edges. 685 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 685 transitions. [2022-04-28 10:15:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:15:35,604 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:35,604 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:35,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-04-28 10:15:35,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:35,809 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:35,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:35,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2036388576, now seen corresponding path program 73 times [2022-04-28 10:15:35,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:35,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1679639154] [2022-04-28 10:15:35,821 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:35,821 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:35,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2036388576, now seen corresponding path program 74 times [2022-04-28 10:15:35,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:35,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338964128] [2022-04-28 10:15:35,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:35,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:35,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:35,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {138949#(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); {138937#true} is VALID [2022-04-28 10:15:35,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {138937#true} assume true; {138937#true} is VALID [2022-04-28 10:15:35,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {138937#true} {138937#true} #72#return; {138937#true} is VALID [2022-04-28 10:15:35,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {138937#true} call ULTIMATE.init(); {138949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:35,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {138949#(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); {138937#true} is VALID [2022-04-28 10:15:35,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {138937#true} assume true; {138937#true} is VALID [2022-04-28 10:15:35,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138937#true} {138937#true} #72#return; {138937#true} is VALID [2022-04-28 10:15:35,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {138937#true} call #t~ret13 := main(); {138937#true} is VALID [2022-04-28 10:15:35,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {138937#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {138937#true} is VALID [2022-04-28 10:15:35,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:35,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:35,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:35,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:35,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:35,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:35,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {138937#true} assume !(~x~0 % 4294967296 > 0); {138942#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:35,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {138942#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {138942#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:35,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {138942#(<= 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; {138943#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:35,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {138943#(<= 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; {138944#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:35,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {138944#(<= 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; {138945#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:35,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {138945#(<= 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; {138946#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:35,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {138946#(<= 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; {138947#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:35,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {138947#(<= 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; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:35,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:35,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:35,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:35,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:35,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:35,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:35,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:35,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:35,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138947#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:35,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {138947#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138946#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:35,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {138946#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138945#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:35,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {138945#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138944#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:35,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {138944#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138943#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:35,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {138943#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138942#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:35,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {138942#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138938#false} is VALID [2022-04-28 10:15:35,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {138938#false} assume !(~x~0 % 4294967296 > 0); {138938#false} is VALID [2022-04-28 10:15:35,970 INFO L272 TraceCheckUtils]: 36: Hoare triple {138938#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {138938#false} is VALID [2022-04-28 10:15:35,970 INFO L290 TraceCheckUtils]: 37: Hoare triple {138938#false} ~cond := #in~cond; {138938#false} is VALID [2022-04-28 10:15:35,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {138938#false} assume 0 == ~cond; {138938#false} is VALID [2022-04-28 10:15:35,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {138938#false} assume !false; {138938#false} is VALID [2022-04-28 10:15:35,970 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:15:35,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:35,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338964128] [2022-04-28 10:15:35,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338964128] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:35,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359472662] [2022-04-28 10:15:35,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:15:35,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:35,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:35,972 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:35,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-04-28 10:15:36,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:15:36,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:36,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:15:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:36,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:36,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {138937#true} call ULTIMATE.init(); {138937#true} is VALID [2022-04-28 10:15:36,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {138937#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); {138937#true} is VALID [2022-04-28 10:15:36,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {138937#true} assume true; {138937#true} is VALID [2022-04-28 10:15:36,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138937#true} {138937#true} #72#return; {138937#true} is VALID [2022-04-28 10:15:36,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {138937#true} call #t~ret13 := main(); {138937#true} is VALID [2022-04-28 10:15:36,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {138937#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {138937#true} is VALID [2022-04-28 10:15:36,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:36,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:36,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:36,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:36,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:36,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:36,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {138937#true} assume !(~x~0 % 4294967296 > 0); {138942#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:36,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {138942#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {138942#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:36,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {138942#(<= 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; {138943#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:36,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {138943#(<= 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; {138944#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {138944#(<= 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; {138945#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {138945#(<= 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; {138946#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {138946#(<= 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; {138947#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:36,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {138947#(<= 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; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,317 INFO L290 TraceCheckUtils]: 28: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138947#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:36,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {138947#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138946#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {138946#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138945#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {138945#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138944#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {138944#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138943#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:36,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {138943#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138942#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:36,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {138942#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138938#false} is VALID [2022-04-28 10:15:36,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {138938#false} assume !(~x~0 % 4294967296 > 0); {138938#false} is VALID [2022-04-28 10:15:36,321 INFO L272 TraceCheckUtils]: 36: Hoare triple {138938#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {138938#false} is VALID [2022-04-28 10:15:36,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {138938#false} ~cond := #in~cond; {138938#false} is VALID [2022-04-28 10:15:36,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {138938#false} assume 0 == ~cond; {138938#false} is VALID [2022-04-28 10:15:36,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {138938#false} assume !false; {138938#false} is VALID [2022-04-28 10:15:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:15:36,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:36,567 INFO L290 TraceCheckUtils]: 39: Hoare triple {138938#false} assume !false; {138938#false} is VALID [2022-04-28 10:15:36,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {138938#false} assume 0 == ~cond; {138938#false} is VALID [2022-04-28 10:15:36,567 INFO L290 TraceCheckUtils]: 37: Hoare triple {138938#false} ~cond := #in~cond; {138938#false} is VALID [2022-04-28 10:15:36,567 INFO L272 TraceCheckUtils]: 36: Hoare triple {138938#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {138938#false} is VALID [2022-04-28 10:15:36,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {138938#false} assume !(~x~0 % 4294967296 > 0); {138938#false} is VALID [2022-04-28 10:15:36,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {138942#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138938#false} is VALID [2022-04-28 10:15:36,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {138943#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138942#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:36,570 INFO L290 TraceCheckUtils]: 32: Hoare triple {138944#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138943#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:36,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {138945#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138944#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {138946#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138945#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {138947#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138946#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {138947#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:36,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {138947#(<= 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; {138948#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {138946#(<= 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; {138947#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:36,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {138945#(<= 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; {138946#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {138944#(<= 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; {138945#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {138943#(<= 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; {138944#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:36,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {138942#(<= 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; {138943#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:36,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {138942#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {138942#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:36,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {138937#true} assume !(~x~0 % 4294967296 > 0); {138942#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:36,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:36,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:36,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:36,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:36,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:36,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {138937#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138937#true} is VALID [2022-04-28 10:15:36,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {138937#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {138937#true} is VALID [2022-04-28 10:15:36,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {138937#true} call #t~ret13 := main(); {138937#true} is VALID [2022-04-28 10:15:36,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138937#true} {138937#true} #72#return; {138937#true} is VALID [2022-04-28 10:15:36,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {138937#true} assume true; {138937#true} is VALID [2022-04-28 10:15:36,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {138937#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); {138937#true} is VALID [2022-04-28 10:15:36,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {138937#true} call ULTIMATE.init(); {138937#true} is VALID [2022-04-28 10:15:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:15:36,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359472662] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:36,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:36,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2022-04-28 10:15:36,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:36,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1679639154] [2022-04-28 10:15:36,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1679639154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:36,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:36,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:15:36,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943515051] [2022-04-28 10:15:36,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:36,584 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 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 40 [2022-04-28 10:15:36,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:36,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:36,610 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-28 10:15:36,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:15:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:36,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:15:36,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:15:36,610 INFO L87 Difference]: Start difference. First operand 502 states and 685 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:39,891 INFO L93 Difference]: Finished difference Result 529 states and 713 transitions. [2022-04-28 10:15:39,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:15:39,892 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 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 40 [2022-04-28 10:15:39,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-28 10:15:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-28 10:15:39,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2022-04-28 10:15:39,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:39,957 INFO L225 Difference]: With dead ends: 529 [2022-04-28 10:15:39,958 INFO L226 Difference]: Without dead ends: 501 [2022-04-28 10:15:39,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:15:39,958 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:39,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 72 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:15:39,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-04-28 10:15:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 495. [2022-04-28 10:15:42,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:42,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 501 states. Second operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:42,208 INFO L74 IsIncluded]: Start isIncluded. First operand 501 states. Second operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:42,208 INFO L87 Difference]: Start difference. First operand 501 states. Second operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:42,216 INFO L93 Difference]: Finished difference Result 501 states and 683 transitions. [2022-04-28 10:15:42,216 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 683 transitions. [2022-04-28 10:15:42,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:42,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:42,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 3 states have call successors, (3), 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 501 states. [2022-04-28 10:15:42,217 INFO L87 Difference]: Start difference. First operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 3 states have call successors, (3), 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 501 states. [2022-04-28 10:15:42,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:42,224 INFO L93 Difference]: Finished difference Result 501 states and 683 transitions. [2022-04-28 10:15:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 683 transitions. [2022-04-28 10:15:42,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:42,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:42,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:42,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 677 transitions. [2022-04-28 10:15:42,234 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 677 transitions. Word has length 40 [2022-04-28 10:15:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:42,234 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 677 transitions. [2022-04-28 10:15:42,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:42,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 495 states and 677 transitions. [2022-04-28 10:15:45,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 677 edges. 677 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 677 transitions. [2022-04-28 10:15:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:15:45,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:45,324 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:45,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-04-28 10:15:45,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-04-28 10:15:45,527 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:45,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash 20764672, now seen corresponding path program 29 times [2022-04-28 10:15:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:45,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1057706083] [2022-04-28 10:15:45,530 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:45,530 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:45,530 INFO L85 PathProgramCache]: Analyzing trace with hash 20764672, now seen corresponding path program 30 times [2022-04-28 10:15:45,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:45,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404941912] [2022-04-28 10:15:45,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:45,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:45,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {142276#(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); {142253#true} is VALID [2022-04-28 10:15:45,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {142253#true} assume true; {142253#true} is VALID [2022-04-28 10:15:45,832 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142253#true} {142253#true} #72#return; {142253#true} is VALID [2022-04-28 10:15:45,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {142253#true} call ULTIMATE.init(); {142276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:45,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {142276#(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); {142253#true} is VALID [2022-04-28 10:15:45,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {142253#true} assume true; {142253#true} is VALID [2022-04-28 10:15:45,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142253#true} {142253#true} #72#return; {142253#true} is VALID [2022-04-28 10:15:45,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {142253#true} call #t~ret13 := main(); {142253#true} is VALID [2022-04-28 10:15:45,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {142253#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {142258#(= main_~y~0 0)} is VALID [2022-04-28 10:15:45,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {142258#(= 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; {142259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:45,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {142259#(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; {142260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:45,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {142260#(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; {142261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:45,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {142261#(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; {142262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:45,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {142262#(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; {142263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:45,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {142263#(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; {142264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:45,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {142264#(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; {142265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:45,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {142265#(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; {142266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:45,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {142266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {142266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:45,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {142266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {142267#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:45,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {142267#(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; {142268#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:45,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {142268#(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; {142269#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:15:45,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {142269#(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; {142270#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:15:45,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {142270#(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; {142271#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:15:45,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {142271#(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; {142272#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:15:45,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {142272#(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; {142273#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:15:45,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {142273#(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; {142274#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:15:45,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {142274#(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; {142275#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:15:45,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {142275#(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; {142254#false} is VALID [2022-04-28 10:15:45,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {142254#false} assume !(~z~0 % 4294967296 > 0); {142254#false} is VALID [2022-04-28 10:15:45,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:45,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:45,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:45,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:45,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:45,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:45,843 INFO L290 TraceCheckUtils]: 32: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:45,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:45,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {142254#false} assume !(~y~0 % 4294967296 > 0); {142254#false} is VALID [2022-04-28 10:15:45,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {142254#false} assume !(~x~0 % 4294967296 > 0); {142254#false} is VALID [2022-04-28 10:15:45,844 INFO L272 TraceCheckUtils]: 36: Hoare triple {142254#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {142254#false} is VALID [2022-04-28 10:15:45,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {142254#false} ~cond := #in~cond; {142254#false} is VALID [2022-04-28 10:15:45,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {142254#false} assume 0 == ~cond; {142254#false} is VALID [2022-04-28 10:15:45,844 INFO L290 TraceCheckUtils]: 39: Hoare triple {142254#false} assume !false; {142254#false} is VALID [2022-04-28 10:15:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:15:45,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:45,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404941912] [2022-04-28 10:15:45,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404941912] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:45,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793492001] [2022-04-28 10:15:45,844 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:15:45,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:45,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:45,845 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:45,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-04-28 10:15:45,955 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:15:45,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:45,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 10:15:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:45,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:46,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {142253#true} call ULTIMATE.init(); {142253#true} is VALID [2022-04-28 10:15:46,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {142253#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); {142253#true} is VALID [2022-04-28 10:15:46,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {142253#true} assume true; {142253#true} is VALID [2022-04-28 10:15:46,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142253#true} {142253#true} #72#return; {142253#true} is VALID [2022-04-28 10:15:46,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {142253#true} call #t~ret13 := main(); {142253#true} is VALID [2022-04-28 10:15:46,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {142253#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {142258#(= main_~y~0 0)} is VALID [2022-04-28 10:15:46,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {142258#(= 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; {142259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:46,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {142259#(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; {142260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:46,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {142260#(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; {142261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:46,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {142261#(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; {142262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:46,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {142262#(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; {142263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:46,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {142263#(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; {142264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:46,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {142264#(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; {142265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:46,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {142265#(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; {142266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:46,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {142266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {142266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:46,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {142266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {142325#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:46,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {142325#(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; {142329#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:15:46,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {142329#(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; {142333#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:46,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {142333#(and (= main_~y~0 (+ main_~z~0 2)) (<= 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; {142337#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:15:46,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {142337#(and (<= main_~y~0 8) (<= 8 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; {142341#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:46,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {142341#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 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; {142345#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:46,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {142345#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 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; {142349#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:46,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {142349#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 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; {142353#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:46,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {142353#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 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; {142357#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:46,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {142357#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 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; {142254#false} is VALID [2022-04-28 10:15:46,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {142254#false} assume !(~z~0 % 4294967296 > 0); {142254#false} is VALID [2022-04-28 10:15:46,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:46,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:46,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:46,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:46,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:46,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:46,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:46,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {142254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142254#false} is VALID [2022-04-28 10:15:46,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {142254#false} assume !(~y~0 % 4294967296 > 0); {142254#false} is VALID [2022-04-28 10:15:46,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {142254#false} assume !(~x~0 % 4294967296 > 0); {142254#false} is VALID [2022-04-28 10:15:46,400 INFO L272 TraceCheckUtils]: 36: Hoare triple {142254#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {142254#false} is VALID [2022-04-28 10:15:46,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {142254#false} ~cond := #in~cond; {142254#false} is VALID [2022-04-28 10:15:46,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {142254#false} assume 0 == ~cond; {142254#false} is VALID [2022-04-28 10:15:46,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {142254#false} assume !false; {142254#false} is VALID [2022-04-28 10:15:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:15:46,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:47,092 INFO L290 TraceCheckUtils]: 39: Hoare triple {142254#false} assume !false; {142254#false} is VALID [2022-04-28 10:15:47,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {142254#false} assume 0 == ~cond; {142254#false} is VALID [2022-04-28 10:15:47,092 INFO L290 TraceCheckUtils]: 37: Hoare triple {142254#false} ~cond := #in~cond; {142254#false} is VALID [2022-04-28 10:15:47,093 INFO L272 TraceCheckUtils]: 36: Hoare triple {142254#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {142254#false} is VALID [2022-04-28 10:15:47,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {142254#false} assume !(~x~0 % 4294967296 > 0); {142254#false} is VALID [2022-04-28 10:15:47,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {142421#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {142254#false} is VALID [2022-04-28 10:15:47,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {142425#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142421#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:47,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {142429#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142425#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:47,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {142433#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142429#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:47,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {142437#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142433#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:15:47,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {142441#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142437#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:47,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {142445#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142441#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:47,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {142449#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142445#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:47,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {142453#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {142449#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:15:47,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {142453#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {142453#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:47,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {142460#(or (not (< 0 (mod main_~z~0 4294967296))) (< 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; {142453#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:47,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {142464#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 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; {142460#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:47,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {142468#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 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; {142464#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:47,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {142472#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 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; {142468#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:47,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {142476#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 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; {142472#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:47,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {142480#(or (< 0 (mod (+ 4294967288 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; {142476#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:47,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {142484#(or (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))) (< 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; {142480#(or (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:15:47,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {142488#(or (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))) (< 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; {142484#(or (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:47,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {142492#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 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; {142488#(or (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:47,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {142253#true} ~z~0 := ~y~0; {142492#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:47,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {142253#true} assume !(~x~0 % 4294967296 > 0); {142253#true} is VALID [2022-04-28 10:15:47,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {142253#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142253#true} is VALID [2022-04-28 10:15:47,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {142253#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142253#true} is VALID [2022-04-28 10:15:47,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {142253#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142253#true} is VALID [2022-04-28 10:15:47,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {142253#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142253#true} is VALID [2022-04-28 10:15:47,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {142253#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142253#true} is VALID [2022-04-28 10:15:47,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {142253#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142253#true} is VALID [2022-04-28 10:15:47,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {142253#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142253#true} is VALID [2022-04-28 10:15:47,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {142253#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142253#true} is VALID [2022-04-28 10:15:47,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {142253#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {142253#true} is VALID [2022-04-28 10:15:47,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {142253#true} call #t~ret13 := main(); {142253#true} is VALID [2022-04-28 10:15:47,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142253#true} {142253#true} #72#return; {142253#true} is VALID [2022-04-28 10:15:47,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {142253#true} assume true; {142253#true} is VALID [2022-04-28 10:15:47,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {142253#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); {142253#true} is VALID [2022-04-28 10:15:47,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {142253#true} call ULTIMATE.init(); {142253#true} is VALID [2022-04-28 10:15:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:15:47,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793492001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:47,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:47,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 48 [2022-04-28 10:15:47,110 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:47,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1057706083] [2022-04-28 10:15:47,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1057706083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:47,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:47,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:15:47,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332626934] [2022-04-28 10:15:47,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:47,111 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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 40 [2022-04-28 10:15:47,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:47,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-28 10:15:47,134 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-28 10:15:47,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:15:47,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:47,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:15:47,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1902, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:15:47,134 INFO L87 Difference]: Start difference. First operand 495 states and 677 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-28 10:15:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:52,051 INFO L93 Difference]: Finished difference Result 580 states and 763 transitions. [2022-04-28 10:15:52,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 10:15:52,052 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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 40 [2022-04-28 10:15:52,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-28 10:15:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 85 transitions. [2022-04-28 10:15:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-28 10:15:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 85 transitions. [2022-04-28 10:15:52,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 85 transitions. [2022-04-28 10:15:52,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:52,134 INFO L225 Difference]: With dead ends: 580 [2022-04-28 10:15:52,134 INFO L226 Difference]: Without dead ends: 523 [2022-04-28 10:15:52,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1184, Invalid=6472, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 10:15:52,134 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:52,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 109 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:15:52,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-28 10:15:54,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 494. [2022-04-28 10:15:54,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:54,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:54,347 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:54,347 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:54,355 INFO L93 Difference]: Finished difference Result 523 states and 701 transitions. [2022-04-28 10:15:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 701 transitions. [2022-04-28 10:15:54,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:54,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:54,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 3 states have call successors, (3), 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 523 states. [2022-04-28 10:15:54,356 INFO L87 Difference]: Start difference. First operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 3 states have call successors, (3), 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 523 states. [2022-04-28 10:15:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:54,364 INFO L93 Difference]: Finished difference Result 523 states and 701 transitions. [2022-04-28 10:15:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 701 transitions. [2022-04-28 10:15:54,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:54,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:54,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:54,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 671 transitions. [2022-04-28 10:15:54,374 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 671 transitions. Word has length 40 [2022-04-28 10:15:54,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:54,374 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 671 transitions. [2022-04-28 10:15:54,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-28 10:15:54,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 494 states and 671 transitions. [2022-04-28 10:15:57,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 671 edges. 671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 671 transitions. [2022-04-28 10:15:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:15:57,375 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:57,375 INFO L195 NwaCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:57,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-04-28 10:15:57,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-04-28 10:15:57,575 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:57,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:57,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1459532769, now seen corresponding path program 49 times [2022-04-28 10:15:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:57,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1942867834] [2022-04-28 10:15:57,578 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:57,578 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:57,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1459532769, now seen corresponding path program 50 times [2022-04-28 10:15:57,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:57,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290546012] [2022-04-28 10:15:57,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:57,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:58,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:58,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {145849#(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); {145817#true} is VALID [2022-04-28 10:15:58,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {145817#true} assume true; {145817#true} is VALID [2022-04-28 10:15:58,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {145817#true} {145817#true} #72#return; {145817#true} is VALID [2022-04-28 10:15:58,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {145817#true} call ULTIMATE.init(); {145849#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:58,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {145849#(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); {145817#true} is VALID [2022-04-28 10:15:58,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {145817#true} assume true; {145817#true} is VALID [2022-04-28 10:15:58,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145817#true} {145817#true} #72#return; {145817#true} is VALID [2022-04-28 10:15:58,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {145817#true} call #t~ret13 := main(); {145817#true} is VALID [2022-04-28 10:15:58,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {145817#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {145822#(= main_~y~0 0)} is VALID [2022-04-28 10:15:58,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {145822#(= 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; {145823#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:58,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {145823#(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; {145824#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:58,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {145824#(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; {145825#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:58,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {145825#(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; {145826#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:58,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {145826#(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; {145827#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:58,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {145827#(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; {145828#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:58,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {145828#(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; {145829#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:58,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {145829#(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; {145830#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:58,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {145830#(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; {145831#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:58,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {145831#(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; {145832#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:58,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {145832#(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; {145833#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:58,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {145833#(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; {145834#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:58,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {145834#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145835#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:58,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {145835#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145836#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:58,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {145836#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145837#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:58,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {145837#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145838#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:15:58,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {145838#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145839#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:15:58,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {145839#(and (<= main_~y~0 17) (<= 17 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; {145840#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:15:58,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {145840#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145841#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:15:58,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {145841#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145842#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:15:58,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {145842#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145843#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:15:58,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {145843#(and (<= main_~y~0 21) (<= 21 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; {145844#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:58,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {145844#(and (<= main_~y~0 22) (<= 22 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; {145845#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:15:58,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {145845#(and (<= main_~y~0 23) (<= 23 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; {145846#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:15:58,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {145846#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145847#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:15:58,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {145847#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {145847#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:15:58,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {145847#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {145848#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:15:58,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {145848#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {145818#false} is VALID [2022-04-28 10:15:58,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {145818#false} assume !(~y~0 % 4294967296 > 0); {145818#false} is VALID [2022-04-28 10:15:58,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {145818#false} assume !(~x~0 % 4294967296 > 0); {145818#false} is VALID [2022-04-28 10:15:58,126 INFO L272 TraceCheckUtils]: 36: Hoare triple {145818#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {145818#false} is VALID [2022-04-28 10:15:58,126 INFO L290 TraceCheckUtils]: 37: Hoare triple {145818#false} ~cond := #in~cond; {145818#false} is VALID [2022-04-28 10:15:58,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {145818#false} assume 0 == ~cond; {145818#false} is VALID [2022-04-28 10:15:58,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {145818#false} assume !false; {145818#false} is VALID [2022-04-28 10:15:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:58,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:58,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290546012] [2022-04-28 10:15:58,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290546012] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:58,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097166591] [2022-04-28 10:15:58,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:15:58,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:58,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:58,128 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:58,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-04-28 10:15:58,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:15:58,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:58,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-28 10:15:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:58,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:58,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {145817#true} call ULTIMATE.init(); {145817#true} is VALID [2022-04-28 10:15:58,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {145817#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); {145817#true} is VALID [2022-04-28 10:15:58,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {145817#true} assume true; {145817#true} is VALID [2022-04-28 10:15:58,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145817#true} {145817#true} #72#return; {145817#true} is VALID [2022-04-28 10:15:58,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {145817#true} call #t~ret13 := main(); {145817#true} is VALID [2022-04-28 10:15:58,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {145817#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {145822#(= main_~y~0 0)} is VALID [2022-04-28 10:15:58,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {145822#(= 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; {145823#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:58,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {145823#(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; {145824#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:58,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {145824#(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; {145825#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:58,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {145825#(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; {145826#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:58,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {145826#(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; {145827#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:58,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {145827#(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; {145828#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:58,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {145828#(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; {145829#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:58,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {145829#(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; {145830#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:58,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {145830#(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; {145831#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:58,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {145831#(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; {145832#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:58,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {145832#(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; {145833#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:58,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {145833#(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; {145834#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:58,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {145834#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145835#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:58,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {145835#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145836#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:58,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {145836#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145837#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:58,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {145837#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145838#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:15:58,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {145838#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145839#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:15:58,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {145839#(and (<= main_~y~0 17) (<= 17 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; {145840#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:15:58,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {145840#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145841#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:15:58,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {145841#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145842#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:15:58,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {145842#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145843#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:15:58,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {145843#(and (<= main_~y~0 21) (<= 21 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; {145844#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:58,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {145844#(and (<= main_~y~0 22) (<= 22 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; {145845#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:15:58,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {145845#(and (<= main_~y~0 23) (<= 23 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; {145846#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:15:58,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {145846#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145847#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:15:58,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {145847#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {145847#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:15:58,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {145847#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {145949#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-28 10:15:58,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {145949#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !(~z~0 % 4294967296 > 0); {145818#false} is VALID [2022-04-28 10:15:58,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {145818#false} assume !(~y~0 % 4294967296 > 0); {145818#false} is VALID [2022-04-28 10:15:58,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {145818#false} assume !(~x~0 % 4294967296 > 0); {145818#false} is VALID [2022-04-28 10:15:58,581 INFO L272 TraceCheckUtils]: 36: Hoare triple {145818#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {145818#false} is VALID [2022-04-28 10:15:58,581 INFO L290 TraceCheckUtils]: 37: Hoare triple {145818#false} ~cond := #in~cond; {145818#false} is VALID [2022-04-28 10:15:58,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {145818#false} assume 0 == ~cond; {145818#false} is VALID [2022-04-28 10:15:58,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {145818#false} assume !false; {145818#false} is VALID [2022-04-28 10:15:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:58,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:59,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {145818#false} assume !false; {145818#false} is VALID [2022-04-28 10:15:59,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {145818#false} assume 0 == ~cond; {145818#false} is VALID [2022-04-28 10:15:59,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {145818#false} ~cond := #in~cond; {145818#false} is VALID [2022-04-28 10:15:59,812 INFO L272 TraceCheckUtils]: 36: Hoare triple {145818#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {145818#false} is VALID [2022-04-28 10:15:59,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {145818#false} assume !(~x~0 % 4294967296 > 0); {145818#false} is VALID [2022-04-28 10:15:59,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {145818#false} assume !(~y~0 % 4294967296 > 0); {145818#false} is VALID [2022-04-28 10:15:59,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {145989#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {145818#false} is VALID [2022-04-28 10:15:59,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {145993#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {145989#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:59,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {145993#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {145993#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:59,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {146000#(< 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; {145993#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:59,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {146004#(< 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; {146000#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:15:59,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {146008#(< 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; {146004#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:15:59,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {146012#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146008#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:15:59,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {146016#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146012#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:15:59,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {146020#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146016#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:59,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {146024#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146020#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:15:59,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {146028#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146024#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:59,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {146032#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146028#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:15:59,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {146036#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146032#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:15:59,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {146040#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146036#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:15:59,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {146044#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146040#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:15:59,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {146048#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146044#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:15:59,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {146052#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146048#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:15:59,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {146056#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146052#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:15:59,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {146060#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146056#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:15:59,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {146064#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146060#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:15:59,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {146068#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146064#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:15:59,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {146072#(< 0 (mod (+ 19 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; {146068#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:15:59,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {146076#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146072#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:59,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {146080#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146076#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:15:59,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {146084#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146080#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:15:59,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {146088#(< 0 (mod (+ 23 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; {146084#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:15:59,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {146092#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146088#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:59,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {146096#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {146092#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:15:59,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {145817#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {146096#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:15:59,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {145817#true} call #t~ret13 := main(); {145817#true} is VALID [2022-04-28 10:15:59,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145817#true} {145817#true} #72#return; {145817#true} is VALID [2022-04-28 10:15:59,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {145817#true} assume true; {145817#true} is VALID [2022-04-28 10:15:59,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {145817#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); {145817#true} is VALID [2022-04-28 10:15:59,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {145817#true} call ULTIMATE.init(); {145817#true} is VALID [2022-04-28 10:15:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:59,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097166591] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:59,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:59,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-28 10:15:59,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:59,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1942867834] [2022-04-28 10:15:59,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1942867834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:59,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:59,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 10:15:59,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359926733] [2022-04-28 10:15:59,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:59,832 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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 40 [2022-04-28 10:15:59,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:59,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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-28 10:15:59,857 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-28 10:15:59,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 10:15:59,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:59,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 10:15:59,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=791, Invalid=2515, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:15:59,858 INFO L87 Difference]: Start difference. First operand 494 states and 671 transitions. Second operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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-28 10:16:08,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:08,987 INFO L93 Difference]: Finished difference Result 788 states and 1221 transitions. [2022-04-28 10:16:08,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 10:16:08,987 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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 40 [2022-04-28 10:16:08,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:08,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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-28 10:16:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 186 transitions. [2022-04-28 10:16:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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-28 10:16:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 186 transitions. [2022-04-28 10:16:08,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 186 transitions. [2022-04-28 10:16:09,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:09,166 INFO L225 Difference]: With dead ends: 788 [2022-04-28 10:16:09,166 INFO L226 Difference]: Without dead ends: 757 [2022-04-28 10:16:09,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1603, Invalid=5537, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 10:16:09,167 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 170 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3590 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 3697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:09,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 205 Invalid, 3697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 3590 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 10:16:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-04-28 10:16:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 515. [2022-04-28 10:16:11,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:11,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 757 states. Second operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:11,487 INFO L74 IsIncluded]: Start isIncluded. First operand 757 states. Second operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:11,487 INFO L87 Difference]: Start difference. First operand 757 states. Second operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:11,502 INFO L93 Difference]: Finished difference Result 757 states and 945 transitions. [2022-04-28 10:16:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 945 transitions. [2022-04-28 10:16:11,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:11,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:11,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 3 states have call successors, (3), 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 757 states. [2022-04-28 10:16:11,504 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 3 states have call successors, (3), 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 757 states. [2022-04-28 10:16:11,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:11,518 INFO L93 Difference]: Finished difference Result 757 states and 945 transitions. [2022-04-28 10:16:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 945 transitions. [2022-04-28 10:16:11,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:11,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:11,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:11,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 702 transitions. [2022-04-28 10:16:11,529 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 702 transitions. Word has length 40 [2022-04-28 10:16:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:11,529 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 702 transitions. [2022-04-28 10:16:11,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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-28 10:16:11,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 702 transitions. [2022-04-28 10:16:15,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 702 edges. 702 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:15,501 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 702 transitions. [2022-04-28 10:16:15,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:16:15,501 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:15,501 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:15,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-04-28 10:16:15,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:15,702 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:15,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:15,702 INFO L85 PathProgramCache]: Analyzing trace with hash -335029466, now seen corresponding path program 75 times [2022-04-28 10:16:15,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:15,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1643260175] [2022-04-28 10:16:15,704 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:15,705 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:15,705 INFO L85 PathProgramCache]: Analyzing trace with hash -335029466, now seen corresponding path program 76 times [2022-04-28 10:16:15,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:15,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802185282] [2022-04-28 10:16:15,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:15,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:15,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:15,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {150311#(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); {150291#true} is VALID [2022-04-28 10:16:15,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {150291#true} assume true; {150291#true} is VALID [2022-04-28 10:16:15,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {150291#true} {150291#true} #72#return; {150291#true} is VALID [2022-04-28 10:16:15,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {150291#true} call ULTIMATE.init(); {150311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:15,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {150311#(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); {150291#true} is VALID [2022-04-28 10:16:15,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {150291#true} assume true; {150291#true} is VALID [2022-04-28 10:16:15,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150291#true} {150291#true} #72#return; {150291#true} is VALID [2022-04-28 10:16:15,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {150291#true} call #t~ret13 := main(); {150291#true} is VALID [2022-04-28 10:16:15,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {150291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150296#(= main_~y~0 0)} is VALID [2022-04-28 10:16:15,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {150296#(= 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; {150297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:15,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {150297#(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; {150298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:15,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {150298#(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; {150299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:15,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {150299#(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; {150300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:15,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {150300#(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; {150301#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:15,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {150301#(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; {150302#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:15,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {150302#(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; {150303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:15,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {150303#(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; {150304#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:15,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {150304#(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; {150305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:15,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {150305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {150305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:15,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {150305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {150306#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:15,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {150306#(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; {150307#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:15,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {150307#(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; {150308#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:15,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {150308#(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; {150309#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:16:15,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {150309#(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; {150310#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:16:15,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {150310#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {150292#false} assume !(~y~0 % 4294967296 > 0); {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {150292#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {150292#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L290 TraceCheckUtils]: 34: Hoare triple {150292#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {150292#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {150292#false} assume !(~x~0 % 4294967296 > 0); {150292#false} is VALID [2022-04-28 10:16:15,975 INFO L272 TraceCheckUtils]: 37: Hoare triple {150292#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {150292#false} is VALID [2022-04-28 10:16:15,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {150292#false} ~cond := #in~cond; {150292#false} is VALID [2022-04-28 10:16:15,976 INFO L290 TraceCheckUtils]: 39: Hoare triple {150292#false} assume 0 == ~cond; {150292#false} is VALID [2022-04-28 10:16:15,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {150292#false} assume !false; {150292#false} is VALID [2022-04-28 10:16:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:16:15,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:15,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802185282] [2022-04-28 10:16:15,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802185282] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:15,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27264284] [2022-04-28 10:16:15,976 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:16:15,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:15,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:15,977 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:16:15,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-04-28 10:16:16,026 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:16:16,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:16,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:16:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:16,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:16,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {150291#true} call ULTIMATE.init(); {150291#true} is VALID [2022-04-28 10:16:16,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {150291#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); {150291#true} is VALID [2022-04-28 10:16:16,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {150291#true} assume true; {150291#true} is VALID [2022-04-28 10:16:16,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150291#true} {150291#true} #72#return; {150291#true} is VALID [2022-04-28 10:16:16,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {150291#true} call #t~ret13 := main(); {150291#true} is VALID [2022-04-28 10:16:16,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {150291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150296#(= main_~y~0 0)} is VALID [2022-04-28 10:16:16,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {150296#(= 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; {150297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:16,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {150297#(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; {150298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:16,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {150298#(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; {150299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:16,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {150299#(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; {150300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:16,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {150300#(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; {150301#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:16,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {150301#(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; {150302#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:16,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {150302#(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; {150303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:16,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {150303#(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; {150304#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:16,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {150304#(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; {150305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:16,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {150305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {150305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:16,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {150305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {150306#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:16,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {150306#(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; {150307#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:16,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {150307#(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; {150308#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:16,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {150308#(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; {150309#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:16:16,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {150309#(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; {150375#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:16:16,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {150375#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {150292#false} is VALID [2022-04-28 10:16:16,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {150292#false} assume !(~y~0 % 4294967296 > 0); {150292#false} is VALID [2022-04-28 10:16:16,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {150292#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {150292#false} is VALID [2022-04-28 10:16:16,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {150292#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {150292#false} is VALID [2022-04-28 10:16:16,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {150292#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {150292#false} is VALID [2022-04-28 10:16:16,323 INFO L290 TraceCheckUtils]: 35: Hoare triple {150292#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {150292#false} is VALID [2022-04-28 10:16:16,323 INFO L290 TraceCheckUtils]: 36: Hoare triple {150292#false} assume !(~x~0 % 4294967296 > 0); {150292#false} is VALID [2022-04-28 10:16:16,323 INFO L272 TraceCheckUtils]: 37: Hoare triple {150292#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {150292#false} is VALID [2022-04-28 10:16:16,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {150292#false} ~cond := #in~cond; {150292#false} is VALID [2022-04-28 10:16:16,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {150292#false} assume 0 == ~cond; {150292#false} is VALID [2022-04-28 10:16:16,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {150292#false} assume !false; {150292#false} is VALID [2022-04-28 10:16:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:16:16,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:16,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {150292#false} assume !false; {150292#false} is VALID [2022-04-28 10:16:16,763 INFO L290 TraceCheckUtils]: 39: Hoare triple {150292#false} assume 0 == ~cond; {150292#false} is VALID [2022-04-28 10:16:16,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {150292#false} ~cond := #in~cond; {150292#false} is VALID [2022-04-28 10:16:16,763 INFO L272 TraceCheckUtils]: 37: Hoare triple {150292#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {150292#false} is VALID [2022-04-28 10:16:16,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {150292#false} assume !(~x~0 % 4294967296 > 0); {150292#false} is VALID [2022-04-28 10:16:16,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {150292#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {150292#false} is VALID [2022-04-28 10:16:16,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {150292#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {150292#false} is VALID [2022-04-28 10:16:16,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {150292#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {150292#false} is VALID [2022-04-28 10:16:16,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {150292#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {150292#false} is VALID [2022-04-28 10:16:16,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {150292#false} assume !(~y~0 % 4294967296 > 0); {150292#false} is VALID [2022-04-28 10:16:16,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {150292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {150292#false} is VALID [2022-04-28 10:16:16,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {150493#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {150292#false} is VALID [2022-04-28 10:16:16,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {150497#(< 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; {150493#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:16,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {150501#(< 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; {150497#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:16,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {150505#(< 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; {150501#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:16,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {150509#(< 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; {150505#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:16:16,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {150513#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {150509#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:16:16,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {150513#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {150513#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:16,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {150520#(< 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; {150513#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:16,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {150524#(< 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; {150520#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:16:16,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {150528#(< 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; {150524#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:16,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {150532#(< 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; {150528#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:16,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {150536#(< 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; {150532#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:16,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {150540#(< 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; {150536#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:16,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {150544#(< 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; {150540#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:16,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {150548#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150544#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:16,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {150552#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150548#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:16,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {150291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150552#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:16,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {150291#true} call #t~ret13 := main(); {150291#true} is VALID [2022-04-28 10:16:16,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150291#true} {150291#true} #72#return; {150291#true} is VALID [2022-04-28 10:16:16,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {150291#true} assume true; {150291#true} is VALID [2022-04-28 10:16:16,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {150291#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); {150291#true} is VALID [2022-04-28 10:16:16,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {150291#true} call ULTIMATE.init(); {150291#true} is VALID [2022-04-28 10:16:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:16:16,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27264284] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:16,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:16,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:16:16,776 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:16,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1643260175] [2022-04-28 10:16:16,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1643260175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:16,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:16,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:16:16,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231904494] [2022-04-28 10:16:16,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:16,776 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-28 10:16:16,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:16,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:16,797 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-28 10:16:16,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:16:16,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:16,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:16:16,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:16:16,797 INFO L87 Difference]: Start difference. First operand 515 states and 702 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:21,076 INFO L93 Difference]: Finished difference Result 602 states and 789 transitions. [2022-04-28 10:16:21,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:16:21,076 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-28 10:16:21,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 75 transitions. [2022-04-28 10:16:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 75 transitions. [2022-04-28 10:16:21,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 75 transitions. [2022-04-28 10:16:21,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:21,187 INFO L225 Difference]: With dead ends: 602 [2022-04-28 10:16:21,188 INFO L226 Difference]: Without dead ends: 582 [2022-04-28 10:16:21,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=600, Invalid=2480, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:16:21,188 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:21,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 89 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:16:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-04-28 10:16:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 515. [2022-04-28 10:16:23,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:23,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 582 states. Second operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:23,534 INFO L74 IsIncluded]: Start isIncluded. First operand 582 states. Second operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:23,535 INFO L87 Difference]: Start difference. First operand 582 states. Second operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:23,545 INFO L93 Difference]: Finished difference Result 582 states and 769 transitions. [2022-04-28 10:16:23,545 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 769 transitions. [2022-04-28 10:16:23,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:23,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:23,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 3 states have call successors, (3), 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 582 states. [2022-04-28 10:16:23,546 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 3 states have call successors, (3), 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 582 states. [2022-04-28 10:16:23,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:23,556 INFO L93 Difference]: Finished difference Result 582 states and 769 transitions. [2022-04-28 10:16:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 769 transitions. [2022-04-28 10:16:23,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:23,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:23,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:23,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 701 transitions. [2022-04-28 10:16:23,567 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 701 transitions. Word has length 41 [2022-04-28 10:16:23,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:23,567 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 701 transitions. [2022-04-28 10:16:23,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:23,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 701 transitions. [2022-04-28 10:16:27,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 701 edges. 701 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 701 transitions. [2022-04-28 10:16:27,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:16:27,842 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:27,842 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:27,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-04-28 10:16:28,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:28,043 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:28,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1537469624, now seen corresponding path program 77 times [2022-04-28 10:16:28,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:28,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [361517854] [2022-04-28 10:16:28,046 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:28,046 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:28,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1537469624, now seen corresponding path program 78 times [2022-04-28 10:16:28,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:28,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71929128] [2022-04-28 10:16:28,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:28,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:28,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:28,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {154035#(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); {154015#true} is VALID [2022-04-28 10:16:28,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {154015#true} assume true; {154015#true} is VALID [2022-04-28 10:16:28,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154015#true} {154015#true} #72#return; {154015#true} is VALID [2022-04-28 10:16:28,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {154015#true} call ULTIMATE.init(); {154035#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:28,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {154035#(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); {154015#true} is VALID [2022-04-28 10:16:28,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {154015#true} assume true; {154015#true} is VALID [2022-04-28 10:16:28,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154015#true} {154015#true} #72#return; {154015#true} is VALID [2022-04-28 10:16:28,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {154015#true} call #t~ret13 := main(); {154015#true} is VALID [2022-04-28 10:16:28,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {154015#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {154020#(= main_~y~0 0)} is VALID [2022-04-28 10:16:28,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {154020#(= 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; {154021#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:28,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {154021#(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; {154022#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:28,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {154022#(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; {154023#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:28,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {154023#(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; {154024#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:28,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {154024#(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; {154025#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:28,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {154025#(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; {154026#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:28,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {154026#(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; {154027#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:28,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {154027#(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; {154028#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:28,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {154028#(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; {154029#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:28,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {154029#(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; {154030#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:28,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {154030#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {154030#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:28,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {154030#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {154031#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:28,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {154031#(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; {154032#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:28,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {154032#(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; {154033#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:28,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {154033#(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; {154034#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:16:28,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {154034#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {154016#false} is VALID [2022-04-28 10:16:28,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {154016#false} assume !(~y~0 % 4294967296 > 0); {154016#false} is VALID [2022-04-28 10:16:28,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {154016#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {154016#false} is VALID [2022-04-28 10:16:28,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {154016#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {154016#false} is VALID [2022-04-28 10:16:28,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {154016#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {154016#false} is VALID [2022-04-28 10:16:28,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {154016#false} assume !(~x~0 % 4294967296 > 0); {154016#false} is VALID [2022-04-28 10:16:28,288 INFO L272 TraceCheckUtils]: 37: Hoare triple {154016#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {154016#false} is VALID [2022-04-28 10:16:28,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {154016#false} ~cond := #in~cond; {154016#false} is VALID [2022-04-28 10:16:28,288 INFO L290 TraceCheckUtils]: 39: Hoare triple {154016#false} assume 0 == ~cond; {154016#false} is VALID [2022-04-28 10:16:28,288 INFO L290 TraceCheckUtils]: 40: Hoare triple {154016#false} assume !false; {154016#false} is VALID [2022-04-28 10:16:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-28 10:16:28,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:28,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71929128] [2022-04-28 10:16:28,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71929128] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:28,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943573476] [2022-04-28 10:16:28,289 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:16:28,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:28,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:28,290 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:16:28,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-04-28 10:16:28,502 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:16:28,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:28,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:16:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:28,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:28,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {154015#true} call ULTIMATE.init(); {154015#true} is VALID [2022-04-28 10:16:28,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {154015#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); {154015#true} is VALID [2022-04-28 10:16:28,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {154015#true} assume true; {154015#true} is VALID [2022-04-28 10:16:28,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154015#true} {154015#true} #72#return; {154015#true} is VALID [2022-04-28 10:16:28,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {154015#true} call #t~ret13 := main(); {154015#true} is VALID [2022-04-28 10:16:28,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {154015#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {154020#(= main_~y~0 0)} is VALID [2022-04-28 10:16:28,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {154020#(= 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; {154021#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:28,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {154021#(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; {154022#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:28,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {154022#(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; {154023#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:28,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {154023#(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; {154024#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:28,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {154024#(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; {154025#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:28,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {154025#(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; {154026#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:28,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {154026#(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; {154027#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:28,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {154027#(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; {154028#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:28,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {154028#(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; {154029#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:28,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {154029#(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; {154030#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:28,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {154030#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {154030#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:28,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {154030#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {154031#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:28,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {154031#(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; {154032#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:28,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {154032#(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; {154033#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:28,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {154033#(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; {154099#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:28,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {154099#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {154016#false} is VALID [2022-04-28 10:16:28,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:28,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {154016#false} assume !(~y~0 % 4294967296 > 0); {154016#false} is VALID [2022-04-28 10:16:28,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {154016#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {154016#false} is VALID [2022-04-28 10:16:28,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {154016#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {154016#false} is VALID [2022-04-28 10:16:28,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {154016#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {154016#false} is VALID [2022-04-28 10:16:28,790 INFO L290 TraceCheckUtils]: 36: Hoare triple {154016#false} assume !(~x~0 % 4294967296 > 0); {154016#false} is VALID [2022-04-28 10:16:28,790 INFO L272 TraceCheckUtils]: 37: Hoare triple {154016#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {154016#false} is VALID [2022-04-28 10:16:28,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {154016#false} ~cond := #in~cond; {154016#false} is VALID [2022-04-28 10:16:28,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {154016#false} assume 0 == ~cond; {154016#false} is VALID [2022-04-28 10:16:28,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {154016#false} assume !false; {154016#false} is VALID [2022-04-28 10:16:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-28 10:16:28,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:29,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {154016#false} assume !false; {154016#false} is VALID [2022-04-28 10:16:29,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {154016#false} assume 0 == ~cond; {154016#false} is VALID [2022-04-28 10:16:29,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {154016#false} ~cond := #in~cond; {154016#false} is VALID [2022-04-28 10:16:29,233 INFO L272 TraceCheckUtils]: 37: Hoare triple {154016#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {154016#false} is VALID [2022-04-28 10:16:29,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {154016#false} assume !(~x~0 % 4294967296 > 0); {154016#false} is VALID [2022-04-28 10:16:29,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {154016#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {154016#false} is VALID [2022-04-28 10:16:29,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {154016#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {154016#false} is VALID [2022-04-28 10:16:29,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {154016#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {154016#false} is VALID [2022-04-28 10:16:29,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {154016#false} assume !(~y~0 % 4294967296 > 0); {154016#false} is VALID [2022-04-28 10:16:29,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:29,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:29,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:29,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:29,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:29,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:29,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:29,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:29,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:29,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {154016#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {154016#false} is VALID [2022-04-28 10:16:29,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {154217#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {154016#false} is VALID [2022-04-28 10:16:29,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {154221#(< 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; {154217#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:29,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {154225#(< 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; {154221#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:29,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {154229#(< 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; {154225#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:29,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {154233#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {154229#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:16:29,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {154233#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {154233#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:16:29,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {154240#(< 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; {154233#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:16:29,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {154244#(< 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; {154240#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:29,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {154248#(< 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; {154244#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:29,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {154252#(< 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; {154248#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:29,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {154256#(< 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; {154252#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:29,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {154260#(< 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; {154256#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:29,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {154264#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154260#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:29,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {154268#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154264#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:29,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {154272#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154268#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:29,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {154276#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {154272#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:16:29,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {154015#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {154276#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:29,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {154015#true} call #t~ret13 := main(); {154015#true} is VALID [2022-04-28 10:16:29,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154015#true} {154015#true} #72#return; {154015#true} is VALID [2022-04-28 10:16:29,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {154015#true} assume true; {154015#true} is VALID [2022-04-28 10:16:29,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {154015#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); {154015#true} is VALID [2022-04-28 10:16:29,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {154015#true} call ULTIMATE.init(); {154015#true} is VALID [2022-04-28 10:16:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-28 10:16:29,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943573476] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:29,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:29,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:16:29,245 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:29,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [361517854] [2022-04-28 10:16:29,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [361517854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:29,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:29,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:16:29,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624024943] [2022-04-28 10:16:29,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:29,246 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-28 10:16:29,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:29,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:29,266 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-28 10:16:29,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:16:29,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:29,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:16:29,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:16:29,267 INFO L87 Difference]: Start difference. First operand 515 states and 701 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:33,739 INFO L93 Difference]: Finished difference Result 618 states and 804 transitions. [2022-04-28 10:16:33,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:16:33,739 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-28 10:16:33,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2022-04-28 10:16:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2022-04-28 10:16:33,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 79 transitions. [2022-04-28 10:16:33,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:33,818 INFO L225 Difference]: With dead ends: 618 [2022-04-28 10:16:33,818 INFO L226 Difference]: Without dead ends: 598 [2022-04-28 10:16:33,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=589, Invalid=2381, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:16:33,819 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 43 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:33,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 96 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:16:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-04-28 10:16:36,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 515. [2022-04-28 10:16:36,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:36,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 598 states. Second operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:36,138 INFO L74 IsIncluded]: Start isIncluded. First operand 598 states. Second operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:36,139 INFO L87 Difference]: Start difference. First operand 598 states. Second operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:36,149 INFO L93 Difference]: Finished difference Result 598 states and 784 transitions. [2022-04-28 10:16:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 784 transitions. [2022-04-28 10:16:36,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:36,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:36,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 3 states have call successors, (3), 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 598 states. [2022-04-28 10:16:36,150 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 3 states have call successors, (3), 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 598 states. [2022-04-28 10:16:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:36,160 INFO L93 Difference]: Finished difference Result 598 states and 784 transitions. [2022-04-28 10:16:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 784 transitions. [2022-04-28 10:16:36,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:36,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:36,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:36,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 700 transitions. [2022-04-28 10:16:36,171 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 700 transitions. Word has length 41 [2022-04-28 10:16:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:36,171 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 700 transitions. [2022-04-28 10:16:36,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:36,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 700 transitions. [2022-04-28 10:16:39,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 700 edges. 700 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 700 transitions. [2022-04-28 10:16:39,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:16:39,675 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:39,675 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:39,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-04-28 10:16:39,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable82 [2022-04-28 10:16:39,876 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:39,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1034526490, now seen corresponding path program 79 times [2022-04-28 10:16:39,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:39,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1774655818] [2022-04-28 10:16:39,878 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:39,878 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:39,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1034526490, now seen corresponding path program 80 times [2022-04-28 10:16:39,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:39,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939202602] [2022-04-28 10:16:39,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:39,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:40,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:40,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {157821#(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); {157801#true} is VALID [2022-04-28 10:16:40,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {157801#true} assume true; {157801#true} is VALID [2022-04-28 10:16:40,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {157801#true} {157801#true} #72#return; {157801#true} is VALID [2022-04-28 10:16:40,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {157801#true} call ULTIMATE.init(); {157821#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:40,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {157821#(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); {157801#true} is VALID [2022-04-28 10:16:40,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {157801#true} assume true; {157801#true} is VALID [2022-04-28 10:16:40,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157801#true} {157801#true} #72#return; {157801#true} is VALID [2022-04-28 10:16:40,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {157801#true} call #t~ret13 := main(); {157801#true} is VALID [2022-04-28 10:16:40,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {157801#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157806#(= main_~y~0 0)} is VALID [2022-04-28 10:16:40,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {157806#(= 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; {157807#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:40,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {157807#(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; {157808#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:40,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {157808#(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; {157809#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:40,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {157809#(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; {157810#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:40,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {157810#(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; {157811#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:40,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {157811#(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; {157812#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:40,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {157812#(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; {157813#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:40,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {157813#(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; {157814#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:40,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {157814#(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; {157815#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:40,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {157815#(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; {157816#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:40,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {157816#(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; {157817#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:40,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {157817#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {157817#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:40,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {157817#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {157818#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:16:40,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {157818#(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; {157819#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:40,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {157819#(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; {157820#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:16:40,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {157820#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {157802#false} is VALID [2022-04-28 10:16:40,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {157802#false} assume !(~y~0 % 4294967296 > 0); {157802#false} is VALID [2022-04-28 10:16:40,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {157802#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {157802#false} is VALID [2022-04-28 10:16:40,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {157802#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {157802#false} is VALID [2022-04-28 10:16:40,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {157802#false} assume !(~x~0 % 4294967296 > 0); {157802#false} is VALID [2022-04-28 10:16:40,154 INFO L272 TraceCheckUtils]: 37: Hoare triple {157802#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {157802#false} is VALID [2022-04-28 10:16:40,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {157802#false} ~cond := #in~cond; {157802#false} is VALID [2022-04-28 10:16:40,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {157802#false} assume 0 == ~cond; {157802#false} is VALID [2022-04-28 10:16:40,155 INFO L290 TraceCheckUtils]: 40: Hoare triple {157802#false} assume !false; {157802#false} is VALID [2022-04-28 10:16:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 10:16:40,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:40,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939202602] [2022-04-28 10:16:40,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939202602] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:40,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595950560] [2022-04-28 10:16:40,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:16:40,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:40,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:40,156 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:16:40,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-04-28 10:16:40,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:16:40,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:40,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:16:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:40,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:40,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {157801#true} call ULTIMATE.init(); {157801#true} is VALID [2022-04-28 10:16:40,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {157801#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); {157801#true} is VALID [2022-04-28 10:16:40,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {157801#true} assume true; {157801#true} is VALID [2022-04-28 10:16:40,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157801#true} {157801#true} #72#return; {157801#true} is VALID [2022-04-28 10:16:40,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {157801#true} call #t~ret13 := main(); {157801#true} is VALID [2022-04-28 10:16:40,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {157801#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157806#(= main_~y~0 0)} is VALID [2022-04-28 10:16:40,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {157806#(= 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; {157807#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:40,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {157807#(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; {157808#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:40,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {157808#(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; {157809#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:40,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {157809#(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; {157810#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:40,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {157810#(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; {157811#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:40,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {157811#(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; {157812#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:40,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {157812#(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; {157813#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:40,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {157813#(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; {157814#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:40,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {157814#(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; {157815#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:40,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {157815#(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; {157816#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:40,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {157816#(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; {157817#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:40,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {157817#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {157817#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:40,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {157817#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {157818#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:16:40,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {157818#(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; {157819#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:40,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {157819#(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; {157885#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:40,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {157885#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {157802#false} is VALID [2022-04-28 10:16:40,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {157802#false} assume !(~y~0 % 4294967296 > 0); {157802#false} is VALID [2022-04-28 10:16:40,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {157802#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {157802#false} is VALID [2022-04-28 10:16:40,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {157802#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {157802#false} is VALID [2022-04-28 10:16:40,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {157802#false} assume !(~x~0 % 4294967296 > 0); {157802#false} is VALID [2022-04-28 10:16:40,507 INFO L272 TraceCheckUtils]: 37: Hoare triple {157802#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {157802#false} is VALID [2022-04-28 10:16:40,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {157802#false} ~cond := #in~cond; {157802#false} is VALID [2022-04-28 10:16:40,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {157802#false} assume 0 == ~cond; {157802#false} is VALID [2022-04-28 10:16:40,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {157802#false} assume !false; {157802#false} is VALID [2022-04-28 10:16:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 10:16:40,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:40,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {157802#false} assume !false; {157802#false} is VALID [2022-04-28 10:16:40,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {157802#false} assume 0 == ~cond; {157802#false} is VALID [2022-04-28 10:16:40,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {157802#false} ~cond := #in~cond; {157802#false} is VALID [2022-04-28 10:16:40,952 INFO L272 TraceCheckUtils]: 37: Hoare triple {157802#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {157802#false} is VALID [2022-04-28 10:16:40,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {157802#false} assume !(~x~0 % 4294967296 > 0); {157802#false} is VALID [2022-04-28 10:16:40,952 INFO L290 TraceCheckUtils]: 35: Hoare triple {157802#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {157802#false} is VALID [2022-04-28 10:16:40,952 INFO L290 TraceCheckUtils]: 34: Hoare triple {157802#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {157802#false} is VALID [2022-04-28 10:16:40,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {157802#false} assume !(~y~0 % 4294967296 > 0); {157802#false} is VALID [2022-04-28 10:16:40,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,952 INFO L290 TraceCheckUtils]: 31: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {157802#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157802#false} is VALID [2022-04-28 10:16:40,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {158003#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {157802#false} is VALID [2022-04-28 10:16:40,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {158007#(< 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; {158003#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:40,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {158011#(< 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; {158007#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:40,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {158015#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {158011#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:40,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {158015#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {158015#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:40,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {158022#(< 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; {158015#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:40,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {158026#(< 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; {158022#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:40,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {158030#(< 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; {158026#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:40,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {158034#(< 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; {158030#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:40,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {158038#(< 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; {158034#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:40,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {158042#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158038#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:40,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {158046#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158042#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:40,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {158050#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158046#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:40,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {158054#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158050#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:16:40,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {158058#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158054#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:40,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {158062#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {158058#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:16:40,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {157801#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {158062#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:16:40,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {157801#true} call #t~ret13 := main(); {157801#true} is VALID [2022-04-28 10:16:40,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157801#true} {157801#true} #72#return; {157801#true} is VALID [2022-04-28 10:16:40,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {157801#true} assume true; {157801#true} is VALID [2022-04-28 10:16:40,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {157801#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); {157801#true} is VALID [2022-04-28 10:16:40,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {157801#true} call ULTIMATE.init(); {157801#true} is VALID [2022-04-28 10:16:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 10:16:40,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595950560] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:40,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:40,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:16:40,964 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:40,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1774655818] [2022-04-28 10:16:40,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1774655818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:40,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:40,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:16:40,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431025284] [2022-04-28 10:16:40,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:40,964 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-28 10:16:40,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:40,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:40,985 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-28 10:16:40,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:16:40,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:40,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:16:40,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:16:40,985 INFO L87 Difference]: Start difference. First operand 515 states and 700 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:45,517 INFO L93 Difference]: Finished difference Result 636 states and 821 transitions. [2022-04-28 10:16:45,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:16:45,517 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-28 10:16:45,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 81 transitions. [2022-04-28 10:16:45,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 81 transitions. [2022-04-28 10:16:45,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 81 transitions. [2022-04-28 10:16:45,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:45,598 INFO L225 Difference]: With dead ends: 636 [2022-04-28 10:16:45,598 INFO L226 Difference]: Without dead ends: 616 [2022-04-28 10:16:45,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=542, Invalid=2110, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:16:45,599 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 51 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:45,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 100 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:16:45,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-04-28 10:16:47,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 515. [2022-04-28 10:16:47,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:47,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 616 states. Second operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:47,940 INFO L74 IsIncluded]: Start isIncluded. First operand 616 states. Second operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:47,940 INFO L87 Difference]: Start difference. First operand 616 states. Second operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:47,951 INFO L93 Difference]: Finished difference Result 616 states and 801 transitions. [2022-04-28 10:16:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 801 transitions. [2022-04-28 10:16:47,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:47,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:47,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 3 states have call successors, (3), 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 616 states. [2022-04-28 10:16:47,952 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 3 states have call successors, (3), 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 616 states. [2022-04-28 10:16:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:47,962 INFO L93 Difference]: Finished difference Result 616 states and 801 transitions. [2022-04-28 10:16:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 801 transitions. [2022-04-28 10:16:47,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:47,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:47,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:47,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 699 transitions. [2022-04-28 10:16:47,973 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 699 transitions. Word has length 41 [2022-04-28 10:16:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:47,974 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 699 transitions. [2022-04-28 10:16:47,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:47,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 699 transitions. [2022-04-28 10:16:51,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 699 edges. 699 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 699 transitions. [2022-04-28 10:16:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:16:51,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:51,978 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:51,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-04-28 10:16:52,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:52,178 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:52,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:52,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1653452536, now seen corresponding path program 81 times [2022-04-28 10:16:52,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:52,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1285263220] [2022-04-28 10:16:52,181 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:52,181 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:52,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1653452536, now seen corresponding path program 82 times [2022-04-28 10:16:52,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:52,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886043569] [2022-04-28 10:16:52,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:52,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:52,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:52,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {161673#(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); {161653#true} is VALID [2022-04-28 10:16:52,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {161653#true} assume true; {161653#true} is VALID [2022-04-28 10:16:52,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161653#true} {161653#true} #72#return; {161653#true} is VALID [2022-04-28 10:16:52,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {161653#true} call ULTIMATE.init(); {161673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:52,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {161673#(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); {161653#true} is VALID [2022-04-28 10:16:52,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {161653#true} assume true; {161653#true} is VALID [2022-04-28 10:16:52,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161653#true} {161653#true} #72#return; {161653#true} is VALID [2022-04-28 10:16:52,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {161653#true} call #t~ret13 := main(); {161653#true} is VALID [2022-04-28 10:16:52,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {161653#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {161658#(= main_~y~0 0)} is VALID [2022-04-28 10:16:52,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {161658#(= 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; {161659#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:52,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {161659#(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; {161660#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:52,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {161660#(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; {161661#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:52,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {161661#(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; {161662#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:52,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {161662#(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; {161663#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:52,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {161663#(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; {161664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:52,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {161664#(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; {161665#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:52,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {161665#(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; {161666#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:52,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {161666#(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; {161667#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:52,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {161667#(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; {161668#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:52,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {161668#(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; {161669#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:52,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {161669#(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; {161670#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:52,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {161670#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {161670#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:52,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {161670#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {161671#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:16:52,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {161671#(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; {161672#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-28 10:16:52,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {161672#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {161654#false} is VALID [2022-04-28 10:16:52,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {161654#false} assume !(~y~0 % 4294967296 > 0); {161654#false} is VALID [2022-04-28 10:16:52,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {161654#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {161654#false} is VALID [2022-04-28 10:16:52,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {161654#false} assume !(~x~0 % 4294967296 > 0); {161654#false} is VALID [2022-04-28 10:16:52,487 INFO L272 TraceCheckUtils]: 37: Hoare triple {161654#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {161654#false} is VALID [2022-04-28 10:16:52,487 INFO L290 TraceCheckUtils]: 38: Hoare triple {161654#false} ~cond := #in~cond; {161654#false} is VALID [2022-04-28 10:16:52,487 INFO L290 TraceCheckUtils]: 39: Hoare triple {161654#false} assume 0 == ~cond; {161654#false} is VALID [2022-04-28 10:16:52,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {161654#false} assume !false; {161654#false} is VALID [2022-04-28 10:16:52,487 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-28 10:16:52,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:52,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886043569] [2022-04-28 10:16:52,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886043569] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:52,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60477580] [2022-04-28 10:16:52,488 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:16:52,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:52,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:52,492 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:16:52,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-04-28 10:16:52,551 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:16:52,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:52,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:16:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:52,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:52,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {161653#true} call ULTIMATE.init(); {161653#true} is VALID [2022-04-28 10:16:52,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {161653#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); {161653#true} is VALID [2022-04-28 10:16:52,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {161653#true} assume true; {161653#true} is VALID [2022-04-28 10:16:52,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161653#true} {161653#true} #72#return; {161653#true} is VALID [2022-04-28 10:16:52,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {161653#true} call #t~ret13 := main(); {161653#true} is VALID [2022-04-28 10:16:52,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {161653#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {161658#(= main_~y~0 0)} is VALID [2022-04-28 10:16:52,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {161658#(= 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; {161659#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:52,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {161659#(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; {161660#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:52,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {161660#(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; {161661#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:52,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {161661#(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; {161662#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:52,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {161662#(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; {161663#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:52,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {161663#(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; {161664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:52,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {161664#(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; {161665#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:52,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {161665#(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; {161666#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:52,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {161666#(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; {161667#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:52,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {161667#(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; {161668#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:52,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {161668#(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; {161669#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:52,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {161669#(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; {161670#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:52,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {161670#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {161670#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:52,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {161670#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {161671#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:16:52,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {161671#(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; {161737#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:16:52,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {161737#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {161654#false} is VALID [2022-04-28 10:16:52,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:52,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {161654#false} assume !(~y~0 % 4294967296 > 0); {161654#false} is VALID [2022-04-28 10:16:52,904 INFO L290 TraceCheckUtils]: 35: Hoare triple {161654#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {161654#false} is VALID [2022-04-28 10:16:52,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {161654#false} assume !(~x~0 % 4294967296 > 0); {161654#false} is VALID [2022-04-28 10:16:52,904 INFO L272 TraceCheckUtils]: 37: Hoare triple {161654#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {161654#false} is VALID [2022-04-28 10:16:52,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {161654#false} ~cond := #in~cond; {161654#false} is VALID [2022-04-28 10:16:52,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {161654#false} assume 0 == ~cond; {161654#false} is VALID [2022-04-28 10:16:52,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {161654#false} assume !false; {161654#false} is VALID [2022-04-28 10:16:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-28 10:16:52,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:53,354 INFO L290 TraceCheckUtils]: 40: Hoare triple {161654#false} assume !false; {161654#false} is VALID [2022-04-28 10:16:53,354 INFO L290 TraceCheckUtils]: 39: Hoare triple {161654#false} assume 0 == ~cond; {161654#false} is VALID [2022-04-28 10:16:53,354 INFO L290 TraceCheckUtils]: 38: Hoare triple {161654#false} ~cond := #in~cond; {161654#false} is VALID [2022-04-28 10:16:53,354 INFO L272 TraceCheckUtils]: 37: Hoare triple {161654#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {161654#false} is VALID [2022-04-28 10:16:53,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {161654#false} assume !(~x~0 % 4294967296 > 0); {161654#false} is VALID [2022-04-28 10:16:53,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {161654#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {161654#false} is VALID [2022-04-28 10:16:53,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {161654#false} assume !(~y~0 % 4294967296 > 0); {161654#false} is VALID [2022-04-28 10:16:53,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:53,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:53,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:53,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:53,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:53,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:53,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:53,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:53,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:53,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:53,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:53,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {161654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {161654#false} is VALID [2022-04-28 10:16:53,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {161855#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {161654#false} is VALID [2022-04-28 10:16:53,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {161859#(< 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; {161855#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:53,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {161863#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {161859#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:53,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {161863#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {161863#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:53,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {161870#(< 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; {161863#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:53,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {161874#(< 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; {161870#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:53,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {161878#(< 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; {161874#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:53,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {161882#(< 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; {161878#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:53,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {161886#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161882#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:53,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {161890#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161886#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:53,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {161894#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161890#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:53,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {161898#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161894#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:16:53,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {161902#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161898#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:53,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {161906#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161902#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:16:53,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {161910#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161906#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:16:53,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {161914#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {161910#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:16:53,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {161653#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {161914#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:16:53,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {161653#true} call #t~ret13 := main(); {161653#true} is VALID [2022-04-28 10:16:53,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161653#true} {161653#true} #72#return; {161653#true} is VALID [2022-04-28 10:16:53,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {161653#true} assume true; {161653#true} is VALID [2022-04-28 10:16:53,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {161653#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); {161653#true} is VALID [2022-04-28 10:16:53,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {161653#true} call ULTIMATE.init(); {161653#true} is VALID [2022-04-28 10:16:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-28 10:16:53,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60477580] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:53,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:53,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:16:53,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:53,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1285263220] [2022-04-28 10:16:53,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1285263220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:53,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:53,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:16:53,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748078119] [2022-04-28 10:16:53,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:53,367 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-28 10:16:53,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:53,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:53,387 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-28 10:16:53,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:16:53,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:53,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:16:53,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:16:53,388 INFO L87 Difference]: Start difference. First operand 515 states and 699 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:58,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:58,110 INFO L93 Difference]: Finished difference Result 656 states and 840 transitions. [2022-04-28 10:16:58,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:16:58,110 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-28 10:16:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 84 transitions. [2022-04-28 10:16:58,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:16:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 84 transitions. [2022-04-28 10:16:58,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 84 transitions. [2022-04-28 10:16:58,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:58,196 INFO L225 Difference]: With dead ends: 656 [2022-04-28 10:16:58,196 INFO L226 Difference]: Without dead ends: 636 [2022-04-28 10:16:58,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=524, Invalid=1926, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:16:58,197 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:58,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 107 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:16:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-04-28 10:17:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 515. [2022-04-28 10:17:00,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:00,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 636 states. Second operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:00,543 INFO L74 IsIncluded]: Start isIncluded. First operand 636 states. Second operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:00,543 INFO L87 Difference]: Start difference. First operand 636 states. Second operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:00,554 INFO L93 Difference]: Finished difference Result 636 states and 820 transitions. [2022-04-28 10:17:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 820 transitions. [2022-04-28 10:17:00,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:00,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:00,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 3 states have call successors, (3), 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 636 states. [2022-04-28 10:17:00,555 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 3 states have call successors, (3), 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 636 states. [2022-04-28 10:17:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:00,567 INFO L93 Difference]: Finished difference Result 636 states and 820 transitions. [2022-04-28 10:17:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 820 transitions. [2022-04-28 10:17:00,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:00,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:00,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:00,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 698 transitions. [2022-04-28 10:17:00,578 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 698 transitions. Word has length 41 [2022-04-28 10:17:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:00,578 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 698 transitions. [2022-04-28 10:17:00,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-28 10:17:00,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 698 transitions. [2022-04-28 10:17:04,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 698 edges. 698 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:04,205 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 698 transitions. [2022-04-28 10:17:04,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:17:04,206 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:04,206 INFO L195 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:04,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-04-28 10:17:04,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:04,411 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:04,412 INFO L85 PathProgramCache]: Analyzing trace with hash -962419464, now seen corresponding path program 51 times [2022-04-28 10:17:04,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:04,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1305297291] [2022-04-28 10:17:04,414 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:04,414 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:04,414 INFO L85 PathProgramCache]: Analyzing trace with hash -962419464, now seen corresponding path program 52 times [2022-04-28 10:17:04,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:04,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874867778] [2022-04-28 10:17:04,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:04,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:04,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:04,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {165614#(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); {165581#true} is VALID [2022-04-28 10:17:04,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {165581#true} assume true; {165581#true} is VALID [2022-04-28 10:17:04,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165581#true} {165581#true} #72#return; {165581#true} is VALID [2022-04-28 10:17:04,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {165581#true} call ULTIMATE.init(); {165614#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:04,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {165614#(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); {165581#true} is VALID [2022-04-28 10:17:04,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {165581#true} assume true; {165581#true} is VALID [2022-04-28 10:17:04,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165581#true} {165581#true} #72#return; {165581#true} is VALID [2022-04-28 10:17:04,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {165581#true} call #t~ret13 := main(); {165581#true} is VALID [2022-04-28 10:17:04,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {165581#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {165586#(= main_~y~0 0)} is VALID [2022-04-28 10:17:04,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {165586#(= 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; {165587#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:04,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {165587#(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; {165588#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:04,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {165588#(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; {165589#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:04,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {165589#(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; {165590#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:04,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {165590#(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; {165591#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:04,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {165591#(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; {165592#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:04,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {165592#(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; {165593#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:04,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {165593#(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; {165594#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:04,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {165594#(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; {165595#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:04,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {165595#(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; {165596#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:04,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {165596#(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; {165597#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:17:04,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {165597#(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; {165598#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:17:04,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {165598#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165599#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:04,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {165599#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165600#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:17:04,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {165600#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165601#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:17:04,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {165601#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165602#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:17:04,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {165602#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165603#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:17:04,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {165603#(and (<= main_~y~0 17) (<= 17 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; {165604#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:17:04,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {165604#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165605#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:17:04,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {165605#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165606#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:17:04,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {165606#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165607#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:17:04,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {165607#(and (<= main_~y~0 21) (<= 21 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; {165608#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:17:04,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {165608#(and (<= main_~y~0 22) (<= 22 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; {165609#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:17:04,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {165609#(and (<= main_~y~0 23) (<= 23 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; {165610#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:17:04,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {165610#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165611#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:17:04,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {165611#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165612#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:17:04,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {165612#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {165612#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:17:04,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {165612#(and (<= main_~y~0 26) (<= 26 main_~y~0))} ~z~0 := ~y~0; {165613#(and (<= (div main_~z~0 4294967296) 0) (<= 26 main_~z~0))} is VALID [2022-04-28 10:17:04,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {165613#(and (<= (div main_~z~0 4294967296) 0) (<= 26 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {165582#false} is VALID [2022-04-28 10:17:04,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {165582#false} assume !(~y~0 % 4294967296 > 0); {165582#false} is VALID [2022-04-28 10:17:04,988 INFO L290 TraceCheckUtils]: 36: Hoare triple {165582#false} assume !(~x~0 % 4294967296 > 0); {165582#false} is VALID [2022-04-28 10:17:04,988 INFO L272 TraceCheckUtils]: 37: Hoare triple {165582#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {165582#false} is VALID [2022-04-28 10:17:04,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {165582#false} ~cond := #in~cond; {165582#false} is VALID [2022-04-28 10:17:04,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {165582#false} assume 0 == ~cond; {165582#false} is VALID [2022-04-28 10:17:04,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {165582#false} assume !false; {165582#false} is VALID [2022-04-28 10:17:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:17:04,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:04,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874867778] [2022-04-28 10:17:04,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874867778] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:04,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815105754] [2022-04-28 10:17:04,989 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:17:04,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:04,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:04,990 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:17:04,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-04-28 10:17:05,036 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:17:05,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:05,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 10:17:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:05,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:05,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {165581#true} call ULTIMATE.init(); {165581#true} is VALID [2022-04-28 10:17:05,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {165581#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); {165581#true} is VALID [2022-04-28 10:17:05,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {165581#true} assume true; {165581#true} is VALID [2022-04-28 10:17:05,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165581#true} {165581#true} #72#return; {165581#true} is VALID [2022-04-28 10:17:05,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {165581#true} call #t~ret13 := main(); {165581#true} is VALID [2022-04-28 10:17:05,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {165581#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {165586#(= main_~y~0 0)} is VALID [2022-04-28 10:17:05,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {165586#(= 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; {165587#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:05,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {165587#(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; {165588#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:05,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {165588#(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; {165589#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:05,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {165589#(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; {165590#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:05,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {165590#(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; {165591#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:05,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {165591#(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; {165592#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:05,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {165592#(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; {165593#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:05,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {165593#(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; {165594#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:05,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {165594#(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; {165595#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:05,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {165595#(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; {165596#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:05,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {165596#(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; {165597#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:17:05,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {165597#(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; {165598#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:17:05,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {165598#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165599#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:05,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {165599#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165600#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:17:05,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {165600#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165601#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:17:05,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {165601#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165602#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:17:05,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {165602#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165603#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:17:05,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {165603#(and (<= main_~y~0 17) (<= 17 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; {165604#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:17:05,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {165604#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165605#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:17:05,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {165605#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165606#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:17:05,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {165606#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165607#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:17:05,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {165607#(and (<= main_~y~0 21) (<= 21 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; {165608#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:17:05,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {165608#(and (<= main_~y~0 22) (<= 22 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; {165609#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:17:05,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {165609#(and (<= main_~y~0 23) (<= 23 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; {165610#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:17:05,448 INFO L290 TraceCheckUtils]: 30: Hoare triple {165610#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165611#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:17:05,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {165611#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165612#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:17:05,449 INFO L290 TraceCheckUtils]: 32: Hoare triple {165612#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {165612#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:17:05,449 INFO L290 TraceCheckUtils]: 33: Hoare triple {165612#(and (<= main_~y~0 26) (<= 26 main_~y~0))} ~z~0 := ~y~0; {165717#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-28 10:17:05,449 INFO L290 TraceCheckUtils]: 34: Hoare triple {165717#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {165582#false} is VALID [2022-04-28 10:17:05,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {165582#false} assume !(~y~0 % 4294967296 > 0); {165582#false} is VALID [2022-04-28 10:17:05,450 INFO L290 TraceCheckUtils]: 36: Hoare triple {165582#false} assume !(~x~0 % 4294967296 > 0); {165582#false} is VALID [2022-04-28 10:17:05,450 INFO L272 TraceCheckUtils]: 37: Hoare triple {165582#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {165582#false} is VALID [2022-04-28 10:17:05,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {165582#false} ~cond := #in~cond; {165582#false} is VALID [2022-04-28 10:17:05,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {165582#false} assume 0 == ~cond; {165582#false} is VALID [2022-04-28 10:17:05,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {165582#false} assume !false; {165582#false} is VALID [2022-04-28 10:17:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:17:05,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:06,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {165582#false} assume !false; {165582#false} is VALID [2022-04-28 10:17:06,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {165582#false} assume 0 == ~cond; {165582#false} is VALID [2022-04-28 10:17:06,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {165582#false} ~cond := #in~cond; {165582#false} is VALID [2022-04-28 10:17:06,763 INFO L272 TraceCheckUtils]: 37: Hoare triple {165582#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {165582#false} is VALID [2022-04-28 10:17:06,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {165582#false} assume !(~x~0 % 4294967296 > 0); {165582#false} is VALID [2022-04-28 10:17:06,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {165582#false} assume !(~y~0 % 4294967296 > 0); {165582#false} is VALID [2022-04-28 10:17:06,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {165757#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {165582#false} is VALID [2022-04-28 10:17:06,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {165761#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {165757#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:06,764 INFO L290 TraceCheckUtils]: 32: Hoare triple {165761#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {165761#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:17:06,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {165768#(< 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; {165761#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:17:06,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {165772#(< 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; {165768#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:17:06,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {165776#(< 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; {165772#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:17:06,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {165780#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165776#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:17:06,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {165784#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165780#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:17:06,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {165788#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165784#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:06,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {165792#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165788#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:17:06,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {165796#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165792#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:06,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {165800#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165796#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:17:06,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {165804#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165800#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:17:06,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {165808#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165804#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:17:06,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {165812#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165808#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:17:06,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {165816#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165812#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:17:06,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {165820#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165816#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:17:06,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {165824#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165820#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:17:06,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {165828#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165824#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:17:06,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {165832#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165828#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:17:06,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {165836#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165832#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:17:06,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {165840#(< 0 (mod (+ 19 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; {165836#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:17:06,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {165844#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165840#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:06,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {165848#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165844#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:17:06,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {165852#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165848#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:17:06,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {165856#(< 0 (mod (+ 23 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; {165852#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:17:06,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {165860#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165856#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:06,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {165864#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165860#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:17:06,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {165868#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {165864#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:17:06,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {165581#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {165868#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-28 10:17:06,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {165581#true} call #t~ret13 := main(); {165581#true} is VALID [2022-04-28 10:17:06,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165581#true} {165581#true} #72#return; {165581#true} is VALID [2022-04-28 10:17:06,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {165581#true} assume true; {165581#true} is VALID [2022-04-28 10:17:06,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {165581#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); {165581#true} is VALID [2022-04-28 10:17:06,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {165581#true} call ULTIMATE.init(); {165581#true} is VALID [2022-04-28 10:17:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:17:06,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815105754] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:06,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:06,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-28 10:17:06,783 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:06,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1305297291] [2022-04-28 10:17:06,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1305297291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:06,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:06,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 10:17:06,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375035123] [2022-04-28 10:17:06,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:06,784 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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 41 [2022-04-28 10:17:06,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:06,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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-28 10:17:06,810 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-28 10:17:06,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 10:17:06,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:06,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 10:17:06,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=848, Invalid=2692, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:17:06,812 INFO L87 Difference]: Start difference. First operand 515 states and 698 transitions. Second operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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-28 10:17:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:16,630 INFO L93 Difference]: Finished difference Result 818 states and 1266 transitions. [2022-04-28 10:17:16,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 10:17:16,630 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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 41 [2022-04-28 10:17:16,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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-28 10:17:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 193 transitions. [2022-04-28 10:17:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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-28 10:17:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 193 transitions. [2022-04-28 10:17:16,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 193 transitions. [2022-04-28 10:17:16,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:16,820 INFO L225 Difference]: With dead ends: 818 [2022-04-28 10:17:16,820 INFO L226 Difference]: Without dead ends: 787 [2022-04-28 10:17:16,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1718, Invalid=5938, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 10:17:16,821 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 178 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3890 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 4001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:16,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 213 Invalid, 4001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3890 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 10:17:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-04-28 10:17:19,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 536. [2022-04-28 10:17:19,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:19,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 787 states. Second operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:19,239 INFO L74 IsIncluded]: Start isIncluded. First operand 787 states. Second operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:19,240 INFO L87 Difference]: Start difference. First operand 787 states. Second operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:19,258 INFO L93 Difference]: Finished difference Result 787 states and 981 transitions. [2022-04-28 10:17:19,258 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 981 transitions. [2022-04-28 10:17:19,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:19,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:19,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 3 states have call successors, (3), 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 787 states. [2022-04-28 10:17:19,259 INFO L87 Difference]: Start difference. First operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 3 states have call successors, (3), 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 787 states. [2022-04-28 10:17:19,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:19,276 INFO L93 Difference]: Finished difference Result 787 states and 981 transitions. [2022-04-28 10:17:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 981 transitions. [2022-04-28 10:17:19,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:19,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:19,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:19,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:19,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 729 transitions. [2022-04-28 10:17:19,288 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 729 transitions. Word has length 41 [2022-04-28 10:17:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:19,289 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 729 transitions. [2022-04-28 10:17:19,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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-28 10:17:19,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 536 states and 729 transitions. [2022-04-28 10:17:22,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 729 edges. 729 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 729 transitions. [2022-04-28 10:17:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:17:22,521 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:22,521 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:22,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-04-28 10:17:22,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2022-04-28 10:17:22,721 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:22,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:22,722 INFO L85 PathProgramCache]: Analyzing trace with hash 14953136, now seen corresponding path program 31 times [2022-04-28 10:17:22,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:22,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [945008033] [2022-04-28 10:17:22,726 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:22,726 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:22,726 INFO L85 PathProgramCache]: Analyzing trace with hash 14953136, now seen corresponding path program 32 times [2022-04-28 10:17:22,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:22,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005813094] [2022-04-28 10:17:22,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:22,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:23,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:23,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {170250#(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); {170227#true} is VALID [2022-04-28 10:17:23,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {170227#true} assume true; {170227#true} is VALID [2022-04-28 10:17:23,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170227#true} {170227#true} #72#return; {170227#true} is VALID [2022-04-28 10:17:23,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {170227#true} call ULTIMATE.init(); {170250#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:23,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {170250#(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); {170227#true} is VALID [2022-04-28 10:17:23,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {170227#true} assume true; {170227#true} is VALID [2022-04-28 10:17:23,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170227#true} {170227#true} #72#return; {170227#true} is VALID [2022-04-28 10:17:23,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {170227#true} call #t~ret13 := main(); {170227#true} is VALID [2022-04-28 10:17:23,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {170227#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {170227#true} is VALID [2022-04-28 10:17:23,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {170227#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170232#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:23,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {170232#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170233#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:17:23,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {170233#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170234#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:23,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {170234#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170235#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:23,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {170235#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170236#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:23,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {170236#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170237#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:23,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {170237#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170238#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:23,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {170238#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170239#(<= main_~x~0 (+ 4294967287 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:23,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {170239#(<= main_~x~0 (+ 4294967287 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170240#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:17:23,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {170240#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {170240#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:17:23,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {170240#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {170240#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:17:23,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {170240#(<= (* 4294967296 (div (+ main_~x~0 9) 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; {170241#(<= (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:17:23,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {170241#(<= (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170242#(<= (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-28 10:17:23,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {170242#(<= (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170243#(<= (+ 3 (* 4294967296 (div (+ main_~x~0 6) 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:23,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {170243#(<= (+ 3 (* 4294967296 (div (+ main_~x~0 6) 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; {170244#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:17:23,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {170244#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170245#(<= (+ 5 (* (div (+ main_~x~0 4) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:17:23,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {170245#(<= (+ 5 (* (div (+ main_~x~0 4) 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; {170246#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 6) main_~x~0)} is VALID [2022-04-28 10:17:23,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {170246#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 6) 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; {170247#(<= (+ 7 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:17:23,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {170247#(<= (+ 7 (* (div (+ main_~x~0 2) 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; {170248#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 8) main_~x~0)} is VALID [2022-04-28 10:17:23,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {170248#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 8) 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; {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:23,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:23,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:23,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:23,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:23,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:23,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:23,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:23,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:23,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:23,109 INFO L290 TraceCheckUtils]: 35: Hoare triple {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:23,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:23,110 INFO L290 TraceCheckUtils]: 37: Hoare triple {170249#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {170228#false} is VALID [2022-04-28 10:17:23,110 INFO L272 TraceCheckUtils]: 38: Hoare triple {170228#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {170228#false} is VALID [2022-04-28 10:17:23,110 INFO L290 TraceCheckUtils]: 39: Hoare triple {170228#false} ~cond := #in~cond; {170228#false} is VALID [2022-04-28 10:17:23,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {170228#false} assume 0 == ~cond; {170228#false} is VALID [2022-04-28 10:17:23,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {170228#false} assume !false; {170228#false} is VALID [2022-04-28 10:17:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:17:23,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:23,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005813094] [2022-04-28 10:17:23,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005813094] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:23,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865053544] [2022-04-28 10:17:23,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:17:23,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:23,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:23,113 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:17:23,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-04-28 10:17:23,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:17:23,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:23,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 10:17:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:23,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:23,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {170227#true} call ULTIMATE.init(); {170227#true} is VALID [2022-04-28 10:17:23,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {170227#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); {170227#true} is VALID [2022-04-28 10:17:23,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {170227#true} assume true; {170227#true} is VALID [2022-04-28 10:17:23,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170227#true} {170227#true} #72#return; {170227#true} is VALID [2022-04-28 10:17:23,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {170227#true} call #t~ret13 := main(); {170227#true} is VALID [2022-04-28 10:17:23,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {170227#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {170227#true} is VALID [2022-04-28 10:17:23,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {170227#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170232#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:23,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {170232#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170275#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:17:23,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {170275#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170279#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {170279#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170283#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:17:23,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {170283#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170287#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {170287#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170291#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:17:23,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {170291#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170295#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:17:23,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {170295#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170299#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:17:23,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {170299#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170303#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-28 10:17:23,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {170303#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} assume !(~x~0 % 4294967296 > 0); {170303#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-28 10:17:23,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {170303#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} ~z~0 := ~y~0; {170303#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-28 10:17:23,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {170303#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170299#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:17:23,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {170299#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170295#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:17:23,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {170295#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170291#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:17:23,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {170291#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170287#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {170287#(<= main_~x~0 (+ 4294967290 (* (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; {170283#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:17:23,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {170283#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170279#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {170279#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {170275#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:17:23,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {170275#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170232#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:23,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {170232#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,625 INFO L290 TraceCheckUtils]: 36: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,626 INFO L290 TraceCheckUtils]: 37: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {170228#false} is VALID [2022-04-28 10:17:23,626 INFO L272 TraceCheckUtils]: 38: Hoare triple {170228#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {170228#false} is VALID [2022-04-28 10:17:23,626 INFO L290 TraceCheckUtils]: 39: Hoare triple {170228#false} ~cond := #in~cond; {170228#false} is VALID [2022-04-28 10:17:23,626 INFO L290 TraceCheckUtils]: 40: Hoare triple {170228#false} assume 0 == ~cond; {170228#false} is VALID [2022-04-28 10:17:23,626 INFO L290 TraceCheckUtils]: 41: Hoare triple {170228#false} assume !false; {170228#false} is VALID [2022-04-28 10:17:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:17:23,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:23,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {170228#false} assume !false; {170228#false} is VALID [2022-04-28 10:17:23,937 INFO L290 TraceCheckUtils]: 40: Hoare triple {170228#false} assume 0 == ~cond; {170228#false} is VALID [2022-04-28 10:17:23,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {170228#false} ~cond := #in~cond; {170228#false} is VALID [2022-04-28 10:17:23,937 INFO L272 TraceCheckUtils]: 38: Hoare triple {170228#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {170228#false} is VALID [2022-04-28 10:17:23,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {170228#false} is VALID [2022-04-28 10:17:23,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,938 INFO L290 TraceCheckUtils]: 35: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {170232#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170337#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {170275#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170232#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:23,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {170279#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {170275#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:17:23,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {170283#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170279#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {170287#(<= main_~x~0 (+ 4294967290 (* (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; {170283#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:17:23,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {170291#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170287#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {170295#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170291#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:17:23,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {170299#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170295#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:17:23,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {170303#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170299#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:17:23,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {170303#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} ~z~0 := ~y~0; {170303#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-28 10:17:23,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {170303#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} assume !(~x~0 % 4294967296 > 0); {170303#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-28 10:17:23,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {170299#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170303#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-28 10:17:23,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {170295#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170299#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:17:23,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {170291#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170295#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:17:23,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {170287#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170291#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:17:23,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {170283#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170287#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {170279#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170283#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:17:23,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {170275#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170279#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {170232#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170275#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:17:23,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {170227#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170232#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:23,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {170227#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {170227#true} is VALID [2022-04-28 10:17:23,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {170227#true} call #t~ret13 := main(); {170227#true} is VALID [2022-04-28 10:17:23,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170227#true} {170227#true} #72#return; {170227#true} is VALID [2022-04-28 10:17:23,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {170227#true} assume true; {170227#true} is VALID [2022-04-28 10:17:23,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {170227#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); {170227#true} is VALID [2022-04-28 10:17:23,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {170227#true} call ULTIMATE.init(); {170227#true} is VALID [2022-04-28 10:17:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:17:23,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865053544] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:23,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:23,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 30 [2022-04-28 10:17:23,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:23,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [945008033] [2022-04-28 10:17:23,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [945008033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:23,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:23,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:17:23,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324149158] [2022-04-28 10:17:23,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:23,957 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 42 [2022-04-28 10:17:23,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:23,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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-28 10:17:23,991 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-28 10:17:23,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:17:23,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:23,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:17:23,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:17:23,992 INFO L87 Difference]: Start difference. First operand 536 states and 729 transitions. Second operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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-28 10:17:28,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:28,549 INFO L93 Difference]: Finished difference Result 606 states and 836 transitions. [2022-04-28 10:17:28,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:17:28,550 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 42 [2022-04-28 10:17:28,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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-28 10:17:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2022-04-28 10:17:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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-28 10:17:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2022-04-28 10:17:28,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 110 transitions. [2022-04-28 10:17:28,671 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-28 10:17:28,692 INFO L225 Difference]: With dead ends: 606 [2022-04-28 10:17:28,693 INFO L226 Difference]: Without dead ends: 601 [2022-04-28 10:17:28,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=491, Invalid=1765, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:17:28,693 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 105 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:28,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 79 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:17:28,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-04-28 10:17:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 584. [2022-04-28 10:17:31,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:31,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 601 states. Second operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:31,465 INFO L74 IsIncluded]: Start isIncluded. First operand 601 states. Second operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:31,465 INFO L87 Difference]: Start difference. First operand 601 states. Second operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:31,475 INFO L93 Difference]: Finished difference Result 601 states and 823 transitions. [2022-04-28 10:17:31,476 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 823 transitions. [2022-04-28 10:17:31,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:31,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:31,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 3 states have call successors, (3), 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 601 states. [2022-04-28 10:17:31,477 INFO L87 Difference]: Start difference. First operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 3 states have call successors, (3), 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 601 states. [2022-04-28 10:17:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:31,486 INFO L93 Difference]: Finished difference Result 601 states and 823 transitions. [2022-04-28 10:17:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 823 transitions. [2022-04-28 10:17:31,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:31,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:31,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:31,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 797 transitions. [2022-04-28 10:17:31,500 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 797 transitions. Word has length 42 [2022-04-28 10:17:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:31,500 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 797 transitions. [2022-04-28 10:17:31,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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-28 10:17:31,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 584 states and 797 transitions. [2022-04-28 10:17:36,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 797 edges. 797 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 797 transitions. [2022-04-28 10:17:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:17:36,900 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:36,900 INFO L195 NwaCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:36,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-04-28 10:17:37,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:37,101 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:37,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:37,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1266472641, now seen corresponding path program 53 times [2022-04-28 10:17:37,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:37,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888139967] [2022-04-28 10:17:37,103 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:37,103 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1266472641, now seen corresponding path program 54 times [2022-04-28 10:17:37,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:37,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614586229] [2022-04-28 10:17:37,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:37,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:37,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:37,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {174163#(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); {174129#true} is VALID [2022-04-28 10:17:37,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {174129#true} assume true; {174129#true} is VALID [2022-04-28 10:17:37,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {174129#true} {174129#true} #72#return; {174129#true} is VALID [2022-04-28 10:17:37,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {174129#true} call ULTIMATE.init(); {174163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:37,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {174163#(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); {174129#true} is VALID [2022-04-28 10:17:37,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {174129#true} assume true; {174129#true} is VALID [2022-04-28 10:17:37,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {174129#true} {174129#true} #72#return; {174129#true} is VALID [2022-04-28 10:17:37,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {174129#true} call #t~ret13 := main(); {174129#true} is VALID [2022-04-28 10:17:37,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {174129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {174134#(= main_~y~0 0)} is VALID [2022-04-28 10:17:37,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {174134#(= 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; {174135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:37,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {174135#(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; {174136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:37,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {174136#(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; {174137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:37,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {174137#(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; {174138#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:37,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {174138#(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; {174139#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:37,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {174139#(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; {174140#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:37,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {174140#(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; {174141#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:37,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {174141#(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; {174142#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:37,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {174142#(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; {174143#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:37,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {174143#(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; {174144#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:37,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {174144#(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; {174145#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:17:37,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {174145#(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; {174146#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:17:37,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {174146#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174147#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:37,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {174147#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174148#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:17:37,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {174148#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174149#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:17:37,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {174149#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174150#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:17:37,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {174150#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174151#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:17:37,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {174151#(and (<= main_~y~0 17) (<= 17 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; {174152#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:17:37,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {174152#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174153#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:17:37,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {174153#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174154#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:17:37,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {174154#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174155#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:17:37,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {174155#(and (<= main_~y~0 21) (<= 21 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; {174156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:17:37,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {174156#(and (<= main_~y~0 22) (<= 22 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; {174157#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:17:37,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {174157#(and (<= main_~y~0 23) (<= 23 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; {174158#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:17:37,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {174158#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174159#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:17:37,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {174159#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174160#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:17:37,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {174160#(and (<= main_~y~0 26) (<= 26 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; {174161#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:17:37,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {174161#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {174161#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:17:37,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {174161#(and (<= main_~y~0 27) (<= 27 main_~y~0))} ~z~0 := ~y~0; {174162#(and (<= (div main_~z~0 4294967296) 0) (<= 27 main_~z~0))} is VALID [2022-04-28 10:17:37,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {174162#(and (<= (div main_~z~0 4294967296) 0) (<= 27 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {174130#false} is VALID [2022-04-28 10:17:37,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {174130#false} assume !(~y~0 % 4294967296 > 0); {174130#false} is VALID [2022-04-28 10:17:37,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {174130#false} assume !(~x~0 % 4294967296 > 0); {174130#false} is VALID [2022-04-28 10:17:37,704 INFO L272 TraceCheckUtils]: 38: Hoare triple {174130#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {174130#false} is VALID [2022-04-28 10:17:37,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {174130#false} ~cond := #in~cond; {174130#false} is VALID [2022-04-28 10:17:37,704 INFO L290 TraceCheckUtils]: 40: Hoare triple {174130#false} assume 0 == ~cond; {174130#false} is VALID [2022-04-28 10:17:37,704 INFO L290 TraceCheckUtils]: 41: Hoare triple {174130#false} assume !false; {174130#false} is VALID [2022-04-28 10:17:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:17:37,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:37,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614586229] [2022-04-28 10:17:37,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614586229] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:37,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351256325] [2022-04-28 10:17:37,704 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:17:37,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:37,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:37,706 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:17:37,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-04-28 10:17:38,654 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-28 10:17:38,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:38,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-28 10:17:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:38,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:39,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {174129#true} call ULTIMATE.init(); {174129#true} is VALID [2022-04-28 10:17:39,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {174129#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); {174129#true} is VALID [2022-04-28 10:17:39,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {174129#true} assume true; {174129#true} is VALID [2022-04-28 10:17:39,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {174129#true} {174129#true} #72#return; {174129#true} is VALID [2022-04-28 10:17:39,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {174129#true} call #t~ret13 := main(); {174129#true} is VALID [2022-04-28 10:17:39,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {174129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {174134#(= main_~y~0 0)} is VALID [2022-04-28 10:17:39,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {174134#(= 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; {174135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:39,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {174135#(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; {174136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:39,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {174136#(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; {174137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:39,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {174137#(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; {174138#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:39,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {174138#(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; {174139#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:39,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {174139#(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; {174140#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:39,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {174140#(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; {174141#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:39,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {174141#(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; {174142#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:39,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {174142#(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; {174143#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:39,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {174143#(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; {174144#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:39,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {174144#(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; {174145#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:17:39,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {174145#(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; {174146#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:17:39,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {174146#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174147#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:39,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {174147#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174148#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:17:39,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {174148#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174149#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:17:39,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {174149#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174150#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:17:39,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {174150#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174151#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:17:39,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {174151#(and (<= main_~y~0 17) (<= 17 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; {174152#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:17:39,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {174152#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174153#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:17:39,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {174153#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174154#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:17:39,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {174154#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174155#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:17:39,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {174155#(and (<= main_~y~0 21) (<= 21 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; {174156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:17:39,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {174156#(and (<= main_~y~0 22) (<= 22 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; {174157#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:17:39,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {174157#(and (<= main_~y~0 23) (<= 23 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; {174158#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:17:39,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {174158#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174159#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:17:39,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {174159#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174160#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:17:39,091 INFO L290 TraceCheckUtils]: 32: Hoare triple {174160#(and (<= main_~y~0 26) (<= 26 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; {174161#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:17:39,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {174161#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {174161#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:17:39,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {174161#(and (<= main_~y~0 27) (<= 27 main_~y~0))} ~z~0 := ~y~0; {174269#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-28 10:17:39,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {174269#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {174130#false} is VALID [2022-04-28 10:17:39,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {174130#false} assume !(~y~0 % 4294967296 > 0); {174130#false} is VALID [2022-04-28 10:17:39,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {174130#false} assume !(~x~0 % 4294967296 > 0); {174130#false} is VALID [2022-04-28 10:17:39,093 INFO L272 TraceCheckUtils]: 38: Hoare triple {174130#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {174130#false} is VALID [2022-04-28 10:17:39,093 INFO L290 TraceCheckUtils]: 39: Hoare triple {174130#false} ~cond := #in~cond; {174130#false} is VALID [2022-04-28 10:17:39,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {174130#false} assume 0 == ~cond; {174130#false} is VALID [2022-04-28 10:17:39,093 INFO L290 TraceCheckUtils]: 41: Hoare triple {174130#false} assume !false; {174130#false} is VALID [2022-04-28 10:17:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:17:39,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:40,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {174130#false} assume !false; {174130#false} is VALID [2022-04-28 10:17:40,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {174130#false} assume 0 == ~cond; {174130#false} is VALID [2022-04-28 10:17:40,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {174130#false} ~cond := #in~cond; {174130#false} is VALID [2022-04-28 10:17:40,493 INFO L272 TraceCheckUtils]: 38: Hoare triple {174130#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {174130#false} is VALID [2022-04-28 10:17:40,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {174130#false} assume !(~x~0 % 4294967296 > 0); {174130#false} is VALID [2022-04-28 10:17:40,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {174130#false} assume !(~y~0 % 4294967296 > 0); {174130#false} is VALID [2022-04-28 10:17:40,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {174309#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {174130#false} is VALID [2022-04-28 10:17:40,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {174313#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {174309#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:40,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {174313#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {174313#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:17:40,495 INFO L290 TraceCheckUtils]: 32: Hoare triple {174320#(< 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; {174313#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:17:40,495 INFO L290 TraceCheckUtils]: 31: Hoare triple {174324#(< 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; {174320#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:17:40,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {174328#(< 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; {174324#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:17:40,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {174332#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174328#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:17:40,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {174336#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174332#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:17:40,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {174340#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174336#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:40,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {174344#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174340#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:17:40,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {174348#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174344#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:40,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {174352#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174348#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:17:40,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {174356#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174352#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:17:40,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {174360#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174356#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:17:40,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {174364#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174360#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:17:40,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {174368#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174364#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:17:40,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {174372#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174368#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:17:40,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {174376#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174372#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:17:40,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {174380#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174376#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:17:40,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {174384#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174380#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:17:40,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {174388#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174384#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:17:40,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {174392#(< 0 (mod (+ 19 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; {174388#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:17:40,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {174396#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174392#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:40,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {174400#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174396#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:17:40,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {174404#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174400#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:17:40,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {174408#(< 0 (mod (+ 23 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; {174404#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:17:40,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {174412#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174408#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:40,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {174416#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174412#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:17:40,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {174420#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174416#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:17:40,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {174424#(< 0 (mod (+ main_~y~0 27) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {174420#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-28 10:17:40,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {174129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {174424#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-28 10:17:40,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {174129#true} call #t~ret13 := main(); {174129#true} is VALID [2022-04-28 10:17:40,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {174129#true} {174129#true} #72#return; {174129#true} is VALID [2022-04-28 10:17:40,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {174129#true} assume true; {174129#true} is VALID [2022-04-28 10:17:40,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {174129#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); {174129#true} is VALID [2022-04-28 10:17:40,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {174129#true} call ULTIMATE.init(); {174129#true} is VALID [2022-04-28 10:17:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:17:40,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351256325] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:40,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:40,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-28 10:17:40,514 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:40,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888139967] [2022-04-28 10:17:40,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888139967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:40,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:40,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 10:17:40,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903689454] [2022-04-28 10:17:40,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:40,515 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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 42 [2022-04-28 10:17:40,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:40,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-28 10:17:40,540 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-28 10:17:40,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 10:17:40,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:40,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 10:17:40,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=2875, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 10:17:40,542 INFO L87 Difference]: Start difference. First operand 584 states and 797 transitions. Second operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-28 10:17:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:51,480 INFO L93 Difference]: Finished difference Result 928 states and 1445 transitions. [2022-04-28 10:17:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 10:17:51,480 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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 42 [2022-04-28 10:17:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-28 10:17:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 200 transitions. [2022-04-28 10:17:51,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-28 10:17:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 200 transitions. [2022-04-28 10:17:51,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 200 transitions. [2022-04-28 10:17:51,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:51,682 INFO L225 Difference]: With dead ends: 928 [2022-04-28 10:17:51,682 INFO L226 Difference]: Without dead ends: 895 [2022-04-28 10:17:51,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1837, Invalid=6353, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 10:17:51,683 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 186 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 4202 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 4202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:51,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 221 Invalid, 4317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 4202 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-28 10:17:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-04-28 10:17:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 607. [2022-04-28 10:17:54,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:54,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 895 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:54,578 INFO L74 IsIncluded]: Start isIncluded. First operand 895 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:54,578 INFO L87 Difference]: Start difference. First operand 895 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:54,600 INFO L93 Difference]: Finished difference Result 895 states and 1120 transitions. [2022-04-28 10:17:54,600 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1120 transitions. [2022-04-28 10:17:54,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:54,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:54,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 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 895 states. [2022-04-28 10:17:54,601 INFO L87 Difference]: Start difference. First operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 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 895 states. [2022-04-28 10:17:54,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:54,622 INFO L93 Difference]: Finished difference Result 895 states and 1120 transitions. [2022-04-28 10:17:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1120 transitions. [2022-04-28 10:17:54,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:54,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:54,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:54,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 831 transitions. [2022-04-28 10:17:54,646 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 831 transitions. Word has length 42 [2022-04-28 10:17:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:54,646 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 831 transitions. [2022-04-28 10:17:54,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-28 10:17:54,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 607 states and 831 transitions. [2022-04-28 10:17:59,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 831 edges. 831 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 831 transitions. [2022-04-28 10:17:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:17:59,052 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:59,052 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:59,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-04-28 10:17:59,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:59,253 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:59,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:59,254 INFO L85 PathProgramCache]: Analyzing trace with hash -7434424, now seen corresponding path program 83 times [2022-04-28 10:17:59,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:59,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1472365128] [2022-04-28 10:17:59,257 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:59,257 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:59,257 INFO L85 PathProgramCache]: Analyzing trace with hash -7434424, now seen corresponding path program 84 times [2022-04-28 10:17:59,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:59,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519305817] [2022-04-28 10:17:59,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:59,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:59,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:59,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {179395#(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); {179363#true} is VALID [2022-04-28 10:17:59,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {179363#true} assume true; {179363#true} is VALID [2022-04-28 10:17:59,971 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {179363#true} {179363#true} #72#return; {179363#true} is VALID [2022-04-28 10:17:59,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {179363#true} call ULTIMATE.init(); {179395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:59,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {179395#(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); {179363#true} is VALID [2022-04-28 10:17:59,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {179363#true} assume true; {179363#true} is VALID [2022-04-28 10:17:59,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179363#true} {179363#true} #72#return; {179363#true} is VALID [2022-04-28 10:17:59,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {179363#true} call #t~ret13 := main(); {179363#true} is VALID [2022-04-28 10:17:59,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {179363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {179368#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:17:59,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {179368#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179369#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)))} is VALID [2022-04-28 10:17:59,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {179369#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~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; {179370#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 2)))} is VALID [2022-04-28 10:17:59,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {179370#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) 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; {179371#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} is VALID [2022-04-28 10:17:59,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {179371#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179372#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 4)) (<= (+ (* main_~x~0 2) main_~y~0 4) (* main_~n~0 2)))} is VALID [2022-04-28 10:17:59,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {179372#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 4)) (<= (+ (* main_~x~0 2) main_~y~0 4) (* main_~n~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; {179373#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) 5 main_~y~0)) (<= (+ (* main_~x~0 2) 5 main_~y~0) (* main_~n~0 2)))} is VALID [2022-04-28 10:17:59,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {179373#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) 5 main_~y~0)) (<= (+ (* main_~x~0 2) 5 main_~y~0) (* main_~n~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; {179374#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 6)) (<= (+ (* main_~x~0 2) main_~y~0 6) (* main_~n~0 2)))} is VALID [2022-04-28 10:17:59,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {179374#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 6)) (<= (+ (* main_~x~0 2) main_~y~0 6) (* main_~n~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; {179375#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) 7 main_~y~0)) (<= (+ (* main_~x~0 2) 7 main_~y~0) (* main_~n~0 2)))} is VALID [2022-04-28 10:17:59,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {179375#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) 7 main_~y~0)) (<= (+ (* main_~x~0 2) 7 main_~y~0) (* main_~n~0 2)))} assume !(~x~0 % 4294967296 > 0); {179376#(and (<= (+ 7 main_~y~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ 7 main_~y~0 (* 8589934592 (div main_~x~0 4294967296)))))} is VALID [2022-04-28 10:17:59,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {179376#(and (<= (+ 7 main_~y~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ 7 main_~y~0 (* 8589934592 (div main_~x~0 4294967296)))))} ~z~0 := ~y~0; {179377#(and (<= (+ 7 main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ 7 main_~z~0 (* 8589934592 (div main_~x~0 4294967296)))))} is VALID [2022-04-28 10:17:59,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {179377#(and (<= (+ 7 main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ 7 main_~z~0 (* 8589934592 (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; {179378#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 10:17:59,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {179378#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 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; {179379#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0 9))} is VALID [2022-04-28 10:17:59,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {179379#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) 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; {179380#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} is VALID [2022-04-28 10:17:59,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {179380#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {179381#(<= (* main_~n~0 2) (+ main_~z~0 11 (* (div (+ (- 11) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:59,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {179381#(<= (* main_~n~0 2) (+ main_~z~0 11 (* (div (+ (- 11) (* (- 1) main_~z~0) (* main_~n~0 2)) 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; {179382#(<= (* main_~n~0 2) (+ main_~z~0 12 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 12)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:59,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {179382#(<= (* main_~n~0 2) (+ main_~z~0 12 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 12)) 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; {179383#(<= (* main_~n~0 2) (+ (* (div (+ (- 13) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 13))} is VALID [2022-04-28 10:17:59,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {179383#(<= (* main_~n~0 2) (+ (* (div (+ (- 13) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {179384#(<= (* main_~n~0 2) (+ main_~z~0 14 (* 4294967296 (div (+ (- 14) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296))))} is VALID [2022-04-28 10:17:59,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {179384#(<= (* main_~n~0 2) (+ main_~z~0 14 (* 4294967296 (div (+ (- 14) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {179384#(<= (* main_~n~0 2) (+ main_~z~0 14 (* 4294967296 (div (+ (- 14) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296))))} is VALID [2022-04-28 10:17:59,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {179384#(<= (* main_~n~0 2) (+ main_~z~0 14 (* 4294967296 (div (+ (- 14) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179383#(<= (* main_~n~0 2) (+ (* (div (+ (- 13) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 13))} is VALID [2022-04-28 10:17:59,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {179383#(<= (* main_~n~0 2) (+ (* (div (+ (- 13) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 13))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179382#(<= (* main_~n~0 2) (+ main_~z~0 12 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 12)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:59,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {179382#(<= (* main_~n~0 2) (+ main_~z~0 12 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 12)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179381#(<= (* main_~n~0 2) (+ main_~z~0 11 (* (div (+ (- 11) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:59,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {179381#(<= (* main_~n~0 2) (+ main_~z~0 11 (* (div (+ (- 11) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179380#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} is VALID [2022-04-28 10:17:59,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {179380#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179379#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0 9))} is VALID [2022-04-28 10:17:59,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {179379#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179378#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 10:17:59,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {179378#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179385#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:59,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {179385#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {179385#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:59,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {179385#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179386#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:59,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {179386#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179387#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 10:17:59,994 INFO L290 TraceCheckUtils]: 33: Hoare triple {179387#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179388#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} is VALID [2022-04-28 10:17:59,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {179388#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179389#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:59,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {179389#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179390#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} is VALID [2022-04-28 10:17:59,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {179390#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179391#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} is VALID [2022-04-28 10:18:00,013 INFO L290 TraceCheckUtils]: 37: Hoare triple {179391#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179392#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:18:00,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {179392#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {179392#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:18:00,023 INFO L272 TraceCheckUtils]: 39: Hoare triple {179392#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {179393#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:18:00,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {179393#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {179394#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:18:00,024 INFO L290 TraceCheckUtils]: 41: Hoare triple {179394#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {179364#false} is VALID [2022-04-28 10:18:00,024 INFO L290 TraceCheckUtils]: 42: Hoare triple {179364#false} assume !false; {179364#false} is VALID [2022-04-28 10:18:00,024 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:18:00,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:18:00,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519305817] [2022-04-28 10:18:00,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519305817] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:18:00,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952123235] [2022-04-28 10:18:00,025 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:18:00,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:00,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:18:00,026 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:18:00,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-04-28 10:18:00,354 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:18:00,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:18:00,357 WARN L261 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 111 conjunts are in the unsatisfiable core [2022-04-28 10:18:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:01,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:18:03,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {179363#true} call ULTIMATE.init(); {179363#true} is VALID [2022-04-28 10:18:03,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {179363#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); {179363#true} is VALID [2022-04-28 10:18:03,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {179363#true} assume true; {179363#true} is VALID [2022-04-28 10:18:03,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179363#true} {179363#true} #72#return; {179363#true} is VALID [2022-04-28 10:18:03,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {179363#true} call #t~ret13 := main(); {179363#true} is VALID [2022-04-28 10:18:03,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {179363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {179368#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:18:03,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {179368#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179417#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 10:18:03,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {179417#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179421#(and (= (+ (- 2) main_~y~0) 0) (= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:18:03,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {179421#(and (= (+ (- 2) main_~y~0) 0) (= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179425#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3))} is VALID [2022-04-28 10:18:03,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {179425#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179429#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:18:03,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {179429#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179433#(and (= (+ 5 main_~x~0) main_~n~0) (= 5 main_~y~0))} is VALID [2022-04-28 10:18:03,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {179433#(and (= (+ 5 main_~x~0) main_~n~0) (= 5 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; {179437#(and (= main_~y~0 6) (= main_~n~0 (+ main_~x~0 6)))} is VALID [2022-04-28 10:18:03,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {179437#(and (= main_~y~0 6) (= main_~n~0 (+ main_~x~0 6)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179441#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0))} is VALID [2022-04-28 10:18:03,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {179441#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {179441#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0))} is VALID [2022-04-28 10:18:03,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {179441#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0))} ~z~0 := ~y~0; {179448#(and (= 7 main_~z~0) (= (+ 7 main_~x~0) main_~n~0))} is VALID [2022-04-28 10:18:03,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {179448#(and (= 7 main_~z~0) (= (+ 7 main_~x~0) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {179452#(and (= (+ main_~n~0 (- 6)) main_~x~0) (= 7 (+ main_~z~0 1)))} is VALID [2022-04-28 10:18:03,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {179452#(and (= (+ main_~n~0 (- 6)) main_~x~0) (= 7 (+ 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; {179456#(and (= (+ (- 1) main_~x~0) (+ main_~n~0 (- 6))) (= 7 (+ main_~z~0 2)))} is VALID [2022-04-28 10:18:03,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {179456#(and (= (+ (- 1) main_~x~0) (+ main_~n~0 (- 6))) (= 7 (+ 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; {179460#(and (= 7 (+ main_~z~0 3)) (= main_~x~0 (+ main_~n~0 (- 4))))} is VALID [2022-04-28 10:18:03,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {179460#(and (= 7 (+ main_~z~0 3)) (= main_~x~0 (+ main_~n~0 (- 4))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {179464#(and (= 7 (+ main_~z~0 4)) (= (+ (- 1) main_~x~0) (+ main_~n~0 (- 4))))} is VALID [2022-04-28 10:18:03,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {179464#(and (= 7 (+ main_~z~0 4)) (= (+ (- 1) main_~x~0) (+ main_~n~0 (- 4))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {179468#(and (= (+ main_~n~0 (- 4)) (+ (- 2) main_~x~0)) (= 3 (+ main_~z~0 1)))} is VALID [2022-04-28 10:18:03,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {179468#(and (= (+ main_~n~0 (- 4)) (+ (- 2) main_~x~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; {179472#(and (= main_~x~0 (+ (- 1) main_~n~0)) (= 3 (+ main_~z~0 2)))} is VALID [2022-04-28 10:18:03,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {179472#(and (= main_~x~0 (+ (- 1) main_~n~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; {179476#(and (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)) (= 3 (+ main_~z~0 3)))} is VALID [2022-04-28 10:18:03,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {179476#(and (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)) (= 3 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {179476#(and (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)) (= 3 (+ main_~z~0 3)))} is VALID [2022-04-28 10:18:03,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {179476#(and (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)) (= 3 (+ main_~z~0 3)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179483#(and (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)) (= 3 (+ main_~z~0 2)))} is VALID [2022-04-28 10:18:03,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {179483#(and (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)) (= 3 (+ main_~z~0 2)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179487#(and (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)) (= main_~z~0 2))} is VALID [2022-04-28 10:18:03,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {179487#(and (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)) (= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179491#(and (= 2 (+ (- 1) main_~z~0)) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:18:03,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {179491#(and (= 2 (+ (- 1) main_~z~0)) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179495#(and (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)) (= 2 (+ (- 2) main_~z~0)))} is VALID [2022-04-28 10:18:03,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {179495#(and (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)) (= 2 (+ (- 2) main_~z~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179499#(and (= 2 (+ main_~z~0 (- 3))) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:18:03,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {179499#(and (= 2 (+ main_~z~0 (- 3))) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179503#(and (= 2 (+ main_~z~0 (- 4))) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:18:03,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {179503#(and (= 2 (+ main_~z~0 (- 4))) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179507#(and (= 7 main_~z~0) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:18:03,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {179507#(and (= 7 main_~z~0) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {179507#(and (= 7 main_~z~0) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:18:03,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {179507#(and (= 7 main_~z~0) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179514#(and (= (+ main_~x~0 1) main_~n~0) (= 7 (+ (- 1) main_~z~0)))} is VALID [2022-04-28 10:18:03,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {179514#(and (= (+ main_~x~0 1) main_~n~0) (= 7 (+ (- 1) main_~z~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179518#(and (= main_~n~0 (+ main_~x~0 2)) (= main_~z~0 9))} is VALID [2022-04-28 10:18:03,800 INFO L290 TraceCheckUtils]: 33: Hoare triple {179518#(and (= main_~n~0 (+ main_~x~0 2)) (= main_~z~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179522#(and (= 9 (+ (- 1) main_~z~0)) (= (+ main_~x~0 3) main_~n~0))} is VALID [2022-04-28 10:18:03,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {179522#(and (= 9 (+ (- 1) main_~z~0)) (= (+ main_~x~0 3) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179526#(and (= main_~z~0 11) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:18:03,801 INFO L290 TraceCheckUtils]: 35: Hoare triple {179526#(and (= main_~z~0 11) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179530#(and (= main_~z~0 12) (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:18:03,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {179530#(and (= main_~z~0 12) (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179534#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 5))) (= 12 (+ (- 1) main_~z~0)) (< 0 (mod (+ 4294967291 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:18:03,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {179534#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 5))) (= 12 (+ (- 1) main_~z~0)) (< 0 (mod (+ 4294967291 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179538#(and (< 0 (mod (+ 4294967290 main_~n~0) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 6))) (< 0 (mod (+ 4294967291 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)) (= main_~z~0 14))} is VALID [2022-04-28 10:18:03,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {179538#(and (< 0 (mod (+ 4294967290 main_~n~0) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 6))) (< 0 (mod (+ 4294967291 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)) (= main_~z~0 14))} assume !(~x~0 % 4294967296 > 0); {179542#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= main_~z~0 14))} is VALID [2022-04-28 10:18:03,806 INFO L272 TraceCheckUtils]: 39: Hoare triple {179542#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= main_~z~0 14))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {179546#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:18:03,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {179546#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {179550#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:18:03,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {179550#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {179364#false} is VALID [2022-04-28 10:18:03,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {179364#false} assume !false; {179364#false} is VALID [2022-04-28 10:18:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:18:03,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:18:08,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {179364#false} assume !false; {179364#false} is VALID [2022-04-28 10:18:08,669 INFO L290 TraceCheckUtils]: 41: Hoare triple {179550#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {179364#false} is VALID [2022-04-28 10:18:08,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {179546#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {179550#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:18:08,671 INFO L272 TraceCheckUtils]: 39: Hoare triple {179392#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {179546#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:18:08,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {179569#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {179392#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:18:08,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {179573#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179569#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:18:08,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {179577#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179573#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-28 10:18:08,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {179581#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179577#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:18:08,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {179585#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179581#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} is VALID [2022-04-28 10:18:08,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {179589#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179585#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:08,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {179593#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179589#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:18:08,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {179597#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {179593#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:08,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {179597#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {179597#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:08,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {179604#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179597#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:08,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {179608#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179604#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:08,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {179612#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179608#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:08,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {179616#(or (and (< (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11) (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179612#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:08,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {179620#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12) (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 13))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179616#(or (and (< (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11) (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:08,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {179624#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (and (< (+ (* 4294967296 (div (+ main_~z~0 13) 4294967296)) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 14)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 13) (+ (* 4294967296 (div (+ main_~z~0 13) 4294967296)) (* main_~n~0 2)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179620#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12) (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 13))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:08,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {179628#(or (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~z~0 14) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 15)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 14) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~z~0 14) 4294967296))))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {179624#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (and (< (+ (* 4294967296 (div (+ main_~z~0 13) 4294967296)) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 14)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 13) (+ (* 4294967296 (div (+ main_~z~0 13) 4294967296)) (* main_~n~0 2)))))} is VALID [2022-04-28 10:18:08,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {179628#(or (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~z~0 14) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 15)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 14) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~z~0 14) 4294967296))))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {179628#(or (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~z~0 14) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 15)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 14) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~z~0 14) 4294967296))))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:08,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {179635#(or (and (< (+ (* 4294967296 (div (+ main_~z~0 13) 4294967296)) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 14)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 13) (+ (* 4294967296 (div (+ main_~z~0 13) 4294967296)) (* main_~n~0 2)))) (< 0 (mod (+ 4294967290 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; {179628#(or (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~z~0 14) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 15)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 14) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~z~0 14) 4294967296))))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:08,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {179639#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12) (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 13))) (< 0 (mod (+ 4294967291 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; {179635#(or (and (< (+ (* 4294967296 (div (+ main_~z~0 13) 4294967296)) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 14)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 13) (+ (* 4294967296 (div (+ main_~z~0 13) 4294967296)) (* main_~n~0 2)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:08,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {179643#(or (and (< (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11) (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 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; {179639#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12) (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 12) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 13))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:08,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {179647#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 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; {179643#(or (and (< (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 12)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11) (+ (* (div (+ main_~z~0 11) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:08,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {179651#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~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; {179647#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)))))} is VALID [2022-04-28 10:18:08,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {179655#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~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; {179651#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:18:08,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {179659#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {179655#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))))} is VALID [2022-04-28 10:18:08,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {179663#(or (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0) (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))))) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {179659#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:18:08,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {179663#(or (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0) (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))))) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {179663#(or (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0) (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:18:08,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {179670#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~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; {179663#(or (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0) (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:18:08,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {179674#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9) (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) (* main_~n~0 2))) (< (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 10))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179670#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-28 10:18:08,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {179678#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 10) (+ (* main_~n~0 2) (* (div (+ main_~y~0 10) 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179674#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9) (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) (* main_~n~0 2))) (< (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 10))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:18:08,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {179682#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 11) (+ (* main_~n~0 2) (* (div (+ main_~y~0 11) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 11) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 12))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179678#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 10) (+ (* main_~n~0 2) (* (div (+ main_~y~0 10) 4294967296) 4294967296)))))} is VALID [2022-04-28 10:18:08,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {179686#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 12) (+ (* (div (+ main_~y~0 12) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 12) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 13))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179682#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 11) (+ (* main_~n~0 2) (* (div (+ main_~y~0 11) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 11) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 12))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:08,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {179690#(or (and (< (+ (* (div (+ main_~y~0 13) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 14)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 13) (+ (* (div (+ main_~y~0 13) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {179686#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 12) (+ (* (div (+ main_~y~0 12) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 12) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 13))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:08,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {179694#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 14) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 15)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 14) (+ (* main_~n~0 2) (* (div (+ main_~y~0 14) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~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; {179690#(or (and (< (+ (* (div (+ main_~y~0 13) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 14)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 13) (+ (* (div (+ main_~y~0 13) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:08,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {179363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {179694#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 14) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 15)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 14) (+ (* main_~n~0 2) (* (div (+ main_~y~0 14) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:08,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {179363#true} call #t~ret13 := main(); {179363#true} is VALID [2022-04-28 10:18:08,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179363#true} {179363#true} #72#return; {179363#true} is VALID [2022-04-28 10:18:08,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {179363#true} assume true; {179363#true} is VALID [2022-04-28 10:18:08,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {179363#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); {179363#true} is VALID [2022-04-28 10:18:08,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {179363#true} call ULTIMATE.init(); {179363#true} is VALID [2022-04-28 10:18:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:18:08,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952123235] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:18:08,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:18:08,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 35, 35] total 92 [2022-04-28 10:18:08,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:18:08,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1472365128] [2022-04-28 10:18:08,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1472365128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:18:08,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:18:08,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 10:18:08,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844309979] [2022-04-28 10:18:08,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:18:08,717 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3) internal successors, (39), 28 states have internal predecessors, (39), 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 43 [2022-04-28 10:18:08,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:18:08,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.3) internal successors, (39), 28 states have internal predecessors, (39), 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-28 10:18:08,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:08,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 10:18:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:08,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 10:18:08,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=8103, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 10:18:08,770 INFO L87 Difference]: Start difference. First operand 607 states and 831 transitions. Second operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 28 states have internal predecessors, (39), 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-28 10:18:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:16,466 INFO L93 Difference]: Finished difference Result 628 states and 852 transitions. [2022-04-28 10:18:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 10:18:16,466 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3) internal successors, (39), 28 states have internal predecessors, (39), 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 43 [2022-04-28 10:18:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:18:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 28 states have internal predecessors, (39), 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-28 10:18:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 58 transitions. [2022-04-28 10:18:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 28 states have internal predecessors, (39), 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-28 10:18:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 58 transitions. [2022-04-28 10:18:16,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 58 transitions. [2022-04-28 10:18:16,543 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-28 10:18:16,558 INFO L225 Difference]: With dead ends: 628 [2022-04-28 10:18:16,558 INFO L226 Difference]: Without dead ends: 623 [2022-04-28 10:18:16,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1783 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=591, Invalid=14415, Unknown=0, NotChecked=0, Total=15006 [2022-04-28 10:18:16,559 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:18:16,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 148 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:18:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2022-04-28 10:18:19,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 607. [2022-04-28 10:18:19,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:19,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 623 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:19,584 INFO L74 IsIncluded]: Start isIncluded. First operand 623 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:19,584 INFO L87 Difference]: Start difference. First operand 623 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:19,595 INFO L93 Difference]: Finished difference Result 623 states and 847 transitions. [2022-04-28 10:18:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 847 transitions. [2022-04-28 10:18:19,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:19,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:19,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 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 623 states. [2022-04-28 10:18:19,596 INFO L87 Difference]: Start difference. First operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 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 623 states. [2022-04-28 10:18:19,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:19,607 INFO L93 Difference]: Finished difference Result 623 states and 847 transitions. [2022-04-28 10:18:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 847 transitions. [2022-04-28 10:18:19,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:19,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:19,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:19,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:19,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 831 transitions. [2022-04-28 10:18:19,622 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 831 transitions. Word has length 43 [2022-04-28 10:18:19,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:19,622 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 831 transitions. [2022-04-28 10:18:19,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.3) internal successors, (39), 28 states have internal predecessors, (39), 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-28 10:18:19,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 607 states and 831 transitions. [2022-04-28 10:18:24,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 831 edges. 831 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 831 transitions. [2022-04-28 10:18:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:18:24,626 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:18:24,627 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:18:24,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2022-04-28 10:18:24,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2022-04-28 10:18:24,827 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:18:24,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:18:24,827 INFO L85 PathProgramCache]: Analyzing trace with hash 878062920, now seen corresponding path program 85 times [2022-04-28 10:18:24,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:24,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [757388208] [2022-04-28 10:18:24,830 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:18:24,830 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:18:24,830 INFO L85 PathProgramCache]: Analyzing trace with hash 878062920, now seen corresponding path program 86 times [2022-04-28 10:18:24,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:18:24,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406452908] [2022-04-28 10:18:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:18:24,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:18:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:25,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:18:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:25,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {183514#(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); {183493#true} is VALID [2022-04-28 10:18:25,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {183493#true} assume true; {183493#true} is VALID [2022-04-28 10:18:25,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {183493#true} {183493#true} #72#return; {183493#true} is VALID [2022-04-28 10:18:25,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {183493#true} call ULTIMATE.init(); {183514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:18:25,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {183514#(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); {183493#true} is VALID [2022-04-28 10:18:25,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {183493#true} assume true; {183493#true} is VALID [2022-04-28 10:18:25,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183493#true} {183493#true} #72#return; {183493#true} is VALID [2022-04-28 10:18:25,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {183493#true} call #t~ret13 := main(); {183493#true} is VALID [2022-04-28 10:18:25,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {183493#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {183498#(= main_~y~0 0)} is VALID [2022-04-28 10:18:25,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {183498#(= 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; {183499#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:25,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {183499#(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; {183500#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:25,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {183500#(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; {183501#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:25,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {183501#(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; {183502#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:25,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {183502#(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; {183503#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:25,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {183503#(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; {183504#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:25,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {183504#(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; {183505#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:25,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {183505#(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; {183506#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:25,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {183506#(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; {183507#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:25,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {183507#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {183507#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:25,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {183507#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {183508#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:18:25,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {183508#(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; {183509#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:18:25,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {183509#(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; {183510#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:18:25,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {183510#(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; {183511#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:18:25,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {183511#(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; {183512#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:18:25,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {183512#(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; {183513#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:18:25,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {183513#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {183494#false} is VALID [2022-04-28 10:18:25,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {183494#false} assume !(~y~0 % 4294967296 > 0); {183494#false} is VALID [2022-04-28 10:18:25,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {183494#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {183494#false} is VALID [2022-04-28 10:18:25,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {183494#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {183494#false} is VALID [2022-04-28 10:18:25,113 INFO L290 TraceCheckUtils]: 35: Hoare triple {183494#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {183494#false} is VALID [2022-04-28 10:18:25,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {183494#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {183494#false} is VALID [2022-04-28 10:18:25,113 INFO L290 TraceCheckUtils]: 37: Hoare triple {183494#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {183494#false} is VALID [2022-04-28 10:18:25,113 INFO L290 TraceCheckUtils]: 38: Hoare triple {183494#false} assume !(~x~0 % 4294967296 > 0); {183494#false} is VALID [2022-04-28 10:18:25,113 INFO L272 TraceCheckUtils]: 39: Hoare triple {183494#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {183494#false} is VALID [2022-04-28 10:18:25,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {183494#false} ~cond := #in~cond; {183494#false} is VALID [2022-04-28 10:18:25,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {183494#false} assume 0 == ~cond; {183494#false} is VALID [2022-04-28 10:18:25,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {183494#false} assume !false; {183494#false} is VALID [2022-04-28 10:18:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 10:18:25,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:18:25,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406452908] [2022-04-28 10:18:25,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406452908] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:18:25,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997610226] [2022-04-28 10:18:25,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:18:25,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:25,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:18:25,115 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:18:25,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-04-28 10:18:25,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:18:25,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:18:25,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:18:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:25,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:18:25,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {183493#true} call ULTIMATE.init(); {183493#true} is VALID [2022-04-28 10:18:25,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {183493#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); {183493#true} is VALID [2022-04-28 10:18:25,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {183493#true} assume true; {183493#true} is VALID [2022-04-28 10:18:25,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183493#true} {183493#true} #72#return; {183493#true} is VALID [2022-04-28 10:18:25,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {183493#true} call #t~ret13 := main(); {183493#true} is VALID [2022-04-28 10:18:25,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {183493#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {183498#(= main_~y~0 0)} is VALID [2022-04-28 10:18:25,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {183498#(= 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; {183499#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:25,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {183499#(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; {183500#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:25,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {183500#(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; {183501#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:25,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {183501#(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; {183502#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:25,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {183502#(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; {183503#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:25,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {183503#(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; {183504#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:25,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {183504#(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; {183505#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:25,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {183505#(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; {183506#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:25,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {183506#(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; {183507#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:25,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {183507#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {183507#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:25,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {183507#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {183508#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:18:25,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {183508#(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; {183509#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:18:25,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {183509#(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; {183510#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:18:25,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {183510#(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; {183511#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:18:25,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {183511#(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; {183512#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:18:25,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {183512#(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; {183581#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:18:25,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {183581#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {183494#false} is VALID [2022-04-28 10:18:25,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {183494#false} assume !(~y~0 % 4294967296 > 0); {183494#false} is VALID [2022-04-28 10:18:25,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {183494#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {183494#false} is VALID [2022-04-28 10:18:25,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {183494#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {183494#false} is VALID [2022-04-28 10:18:25,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {183494#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {183494#false} is VALID [2022-04-28 10:18:25,476 INFO L290 TraceCheckUtils]: 36: Hoare triple {183494#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {183494#false} is VALID [2022-04-28 10:18:25,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {183494#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {183494#false} is VALID [2022-04-28 10:18:25,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {183494#false} assume !(~x~0 % 4294967296 > 0); {183494#false} is VALID [2022-04-28 10:18:25,476 INFO L272 TraceCheckUtils]: 39: Hoare triple {183494#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {183494#false} is VALID [2022-04-28 10:18:25,476 INFO L290 TraceCheckUtils]: 40: Hoare triple {183494#false} ~cond := #in~cond; {183494#false} is VALID [2022-04-28 10:18:25,476 INFO L290 TraceCheckUtils]: 41: Hoare triple {183494#false} assume 0 == ~cond; {183494#false} is VALID [2022-04-28 10:18:25,476 INFO L290 TraceCheckUtils]: 42: Hoare triple {183494#false} assume !false; {183494#false} is VALID [2022-04-28 10:18:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 10:18:25,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:18:25,968 INFO L290 TraceCheckUtils]: 42: Hoare triple {183494#false} assume !false; {183494#false} is VALID [2022-04-28 10:18:25,968 INFO L290 TraceCheckUtils]: 41: Hoare triple {183494#false} assume 0 == ~cond; {183494#false} is VALID [2022-04-28 10:18:25,968 INFO L290 TraceCheckUtils]: 40: Hoare triple {183494#false} ~cond := #in~cond; {183494#false} is VALID [2022-04-28 10:18:25,968 INFO L272 TraceCheckUtils]: 39: Hoare triple {183494#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {183494#false} is VALID [2022-04-28 10:18:25,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {183494#false} assume !(~x~0 % 4294967296 > 0); {183494#false} is VALID [2022-04-28 10:18:25,968 INFO L290 TraceCheckUtils]: 37: Hoare triple {183494#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {183494#false} is VALID [2022-04-28 10:18:25,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {183494#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {183494#false} is VALID [2022-04-28 10:18:25,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {183494#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {183494#false} is VALID [2022-04-28 10:18:25,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {183494#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {183494#false} is VALID [2022-04-28 10:18:25,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {183494#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {183494#false} is VALID [2022-04-28 10:18:25,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {183494#false} assume !(~y~0 % 4294967296 > 0); {183494#false} is VALID [2022-04-28 10:18:25,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {183494#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183494#false} is VALID [2022-04-28 10:18:25,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {183705#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {183494#false} is VALID [2022-04-28 10:18:25,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {183709#(< 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; {183705#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:18:25,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {183713#(< 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; {183709#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:18:25,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {183717#(< 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; {183713#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:18:25,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {183721#(< 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; {183717#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:18:25,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {183725#(< 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; {183721#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:18:25,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {183729#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {183725#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:18:25,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {183729#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {183729#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:25,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {183736#(< 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; {183729#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:25,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {183740#(< 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; {183736#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:25,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {183744#(< 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; {183740#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:18:25,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {183748#(< 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; {183744#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:18:25,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {183752#(< 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; {183748#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:18:25,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {183756#(< 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; {183752#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:18:25,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {183760#(< 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; {183756#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:18:25,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {183764#(< 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; {183760#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:18:25,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {183768#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183764#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:18:25,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {183493#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {183768#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:18:25,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {183493#true} call #t~ret13 := main(); {183493#true} is VALID [2022-04-28 10:18:25,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183493#true} {183493#true} #72#return; {183493#true} is VALID [2022-04-28 10:18:25,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {183493#true} assume true; {183493#true} is VALID [2022-04-28 10:18:25,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {183493#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); {183493#true} is VALID [2022-04-28 10:18:25,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {183493#true} call ULTIMATE.init(); {183493#true} is VALID [2022-04-28 10:18:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 10:18:25,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997610226] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:18:25,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:18:25,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:18:25,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:18:25,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [757388208] [2022-04-28 10:18:25,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [757388208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:18:25,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:18:25,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:18:25,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199771745] [2022-04-28 10:18:25,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:18:25,982 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 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 43 [2022-04-28 10:18:25,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:18:25,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:26,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-28 10:18:26,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:18:26,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:26,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:18:26,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:18:26,005 INFO L87 Difference]: Start difference. First operand 607 states and 831 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:31,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:31,089 INFO L93 Difference]: Finished difference Result 696 states and 920 transitions. [2022-04-28 10:18:31,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:18:31,089 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 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 43 [2022-04-28 10:18:31,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:18:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 78 transitions. [2022-04-28 10:18:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 78 transitions. [2022-04-28 10:18:31,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 78 transitions. [2022-04-28 10:18:31,155 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-28 10:18:31,173 INFO L225 Difference]: With dead ends: 696 [2022-04-28 10:18:31,173 INFO L226 Difference]: Without dead ends: 675 [2022-04-28 10:18:31,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=686, Invalid=2974, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:18:31,173 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 37 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:18:31,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 75 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:18:31,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-04-28 10:18:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 607. [2022-04-28 10:18:34,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:34,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 675 states. Second operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:34,184 INFO L74 IsIncluded]: Start isIncluded. First operand 675 states. Second operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:34,184 INFO L87 Difference]: Start difference. First operand 675 states. Second operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:34,196 INFO L93 Difference]: Finished difference Result 675 states and 899 transitions. [2022-04-28 10:18:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 899 transitions. [2022-04-28 10:18:34,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:34,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:34,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 3 states have call successors, (3), 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 675 states. [2022-04-28 10:18:34,198 INFO L87 Difference]: Start difference. First operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 3 states have call successors, (3), 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 675 states. [2022-04-28 10:18:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:34,210 INFO L93 Difference]: Finished difference Result 675 states and 899 transitions. [2022-04-28 10:18:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 899 transitions. [2022-04-28 10:18:34,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:34,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:34,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:34,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:34,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 830 transitions. [2022-04-28 10:18:34,225 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 830 transitions. Word has length 43 [2022-04-28 10:18:34,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:34,225 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 830 transitions. [2022-04-28 10:18:34,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:34,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 607 states and 830 transitions. [2022-04-28 10:18:39,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 830 edges. 830 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 830 transitions. [2022-04-28 10:18:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:18:39,346 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:18:39,346 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:18:39,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2022-04-28 10:18:39,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:39,547 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:18:39,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:18:39,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1640467482, now seen corresponding path program 33 times [2022-04-28 10:18:39,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:39,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [48897006] [2022-04-28 10:18:39,549 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:18:39,549 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:18:39,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1640467482, now seen corresponding path program 34 times [2022-04-28 10:18:39,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:18:39,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886247281] [2022-04-28 10:18:39,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:18:39,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:18:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:39,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:18:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:39,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {187820#(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); {187795#true} is VALID [2022-04-28 10:18:39,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {187795#true} assume true; {187795#true} is VALID [2022-04-28 10:18:39,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {187795#true} {187795#true} #72#return; {187795#true} is VALID [2022-04-28 10:18:39,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {187795#true} call ULTIMATE.init(); {187820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:18:39,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {187820#(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); {187795#true} is VALID [2022-04-28 10:18:39,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {187795#true} assume true; {187795#true} is VALID [2022-04-28 10:18:39,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187795#true} {187795#true} #72#return; {187795#true} is VALID [2022-04-28 10:18:39,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {187795#true} call #t~ret13 := main(); {187795#true} is VALID [2022-04-28 10:18:39,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {187795#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {187800#(= main_~y~0 0)} is VALID [2022-04-28 10:18:39,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {187800#(= 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; {187801#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:39,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {187801#(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; {187802#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:39,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {187802#(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; {187803#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:39,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {187803#(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; {187804#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:39,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {187804#(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; {187805#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:39,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {187805#(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; {187806#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:39,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {187806#(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; {187807#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:39,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {187807#(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; {187808#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:39,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {187808#(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; {187809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:39,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {187809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {187809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:39,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {187809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {187810#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:18:39,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {187810#(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; {187811#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:18:39,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {187811#(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; {187812#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:18:39,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {187812#(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; {187813#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:18:39,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {187813#(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; {187814#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:18:39,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {187814#(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; {187815#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:18:39,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {187815#(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; {187816#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:18:39,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {187816#(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; {187817#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:18:39,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {187817#(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; {187818#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:18:39,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {187818#(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; {187819#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:18:39,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {187819#(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; {187796#false} is VALID [2022-04-28 10:18:39,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {187796#false} assume !(~z~0 % 4294967296 > 0); {187796#false} is VALID [2022-04-28 10:18:39,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:39,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:39,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:39,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:39,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:39,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:39,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:39,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:39,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:39,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {187796#false} assume !(~y~0 % 4294967296 > 0); {187796#false} is VALID [2022-04-28 10:18:39,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {187796#false} assume !(~x~0 % 4294967296 > 0); {187796#false} is VALID [2022-04-28 10:18:39,903 INFO L272 TraceCheckUtils]: 39: Hoare triple {187796#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {187796#false} is VALID [2022-04-28 10:18:39,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {187796#false} ~cond := #in~cond; {187796#false} is VALID [2022-04-28 10:18:39,903 INFO L290 TraceCheckUtils]: 41: Hoare triple {187796#false} assume 0 == ~cond; {187796#false} is VALID [2022-04-28 10:18:39,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {187796#false} assume !false; {187796#false} is VALID [2022-04-28 10:18:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:18:39,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:18:39,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886247281] [2022-04-28 10:18:39,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886247281] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:18:39,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229284605] [2022-04-28 10:18:39,904 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:18:39,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:39,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:18:39,905 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:18:39,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-04-28 10:18:39,954 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:18:39,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:18:39,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 10:18:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:39,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:18:40,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {187795#true} call ULTIMATE.init(); {187795#true} is VALID [2022-04-28 10:18:40,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {187795#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); {187795#true} is VALID [2022-04-28 10:18:40,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {187795#true} assume true; {187795#true} is VALID [2022-04-28 10:18:40,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187795#true} {187795#true} #72#return; {187795#true} is VALID [2022-04-28 10:18:40,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {187795#true} call #t~ret13 := main(); {187795#true} is VALID [2022-04-28 10:18:40,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {187795#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {187800#(= main_~y~0 0)} is VALID [2022-04-28 10:18:40,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {187800#(= 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; {187801#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:40,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {187801#(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; {187802#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:40,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {187802#(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; {187803#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:40,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {187803#(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; {187804#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:40,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {187804#(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; {187805#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:40,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {187805#(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; {187806#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:40,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {187806#(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; {187807#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:40,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {187807#(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; {187808#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:40,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {187808#(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; {187809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:40,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {187809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {187809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:40,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {187809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {187872#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:40,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {187872#(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; {187876#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:18:40,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {187876#(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; {187880#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:40,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {187880#(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; {187884#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:40,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {187884#(and (= (+ main_~z~0 2) (+ (- 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; {187888#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:40,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {187888#(and (= (+ main_~z~0 3) (+ (- 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; {187892#(and (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:40,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {187892#(and (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= 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; {187896#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:40,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {187896#(and (= (+ main_~y~0 (- 5)) (+ 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; {187900#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:40,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {187900#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 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; {187904#(and (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:40,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {187904#(and (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 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; {187908#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 7))) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:40,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {187908#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 7))) (<= 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; {187796#false} is VALID [2022-04-28 10:18:40,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {187796#false} assume !(~z~0 % 4294967296 > 0); {187796#false} is VALID [2022-04-28 10:18:40,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:40,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:40,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:40,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:40,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:40,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:40,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:40,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:40,461 INFO L290 TraceCheckUtils]: 36: Hoare triple {187796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187796#false} is VALID [2022-04-28 10:18:40,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {187796#false} assume !(~y~0 % 4294967296 > 0); {187796#false} is VALID [2022-04-28 10:18:40,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {187796#false} assume !(~x~0 % 4294967296 > 0); {187796#false} is VALID [2022-04-28 10:18:40,461 INFO L272 TraceCheckUtils]: 39: Hoare triple {187796#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {187796#false} is VALID [2022-04-28 10:18:40,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {187796#false} ~cond := #in~cond; {187796#false} is VALID [2022-04-28 10:18:40,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {187796#false} assume 0 == ~cond; {187796#false} is VALID [2022-04-28 10:18:40,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {187796#false} assume !false; {187796#false} is VALID [2022-04-28 10:18:40,462 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:18:40,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:18:41,284 INFO L290 TraceCheckUtils]: 42: Hoare triple {187796#false} assume !false; {187796#false} is VALID [2022-04-28 10:18:41,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {187796#false} assume 0 == ~cond; {187796#false} is VALID [2022-04-28 10:18:41,284 INFO L290 TraceCheckUtils]: 40: Hoare triple {187796#false} ~cond := #in~cond; {187796#false} is VALID [2022-04-28 10:18:41,284 INFO L272 TraceCheckUtils]: 39: Hoare triple {187796#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {187796#false} is VALID [2022-04-28 10:18:41,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {187796#false} assume !(~x~0 % 4294967296 > 0); {187796#false} is VALID [2022-04-28 10:18:41,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {187975#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {187796#false} is VALID [2022-04-28 10:18:41,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {187979#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187975#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:18:41,286 INFO L290 TraceCheckUtils]: 35: Hoare triple {187983#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187979#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:18:41,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {187987#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187983#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:18:41,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {187991#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187987#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:18:41,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {187995#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187991#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:41,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {187999#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187995#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:41,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {188003#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187999#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:41,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {188007#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {188003#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:18:41,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {188011#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {188007#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:41,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {188011#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !(~z~0 % 4294967296 > 0); {188011#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-28 10:18:41,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {188018#(or (< 0 (mod (+ main_~y~0 4294967287) 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; {188011#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-28 10:18:41,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {188022#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {188018#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:18:41,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {188026#(or (< 0 (mod (+ main_~y~0 4294967287) 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; {188022#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:18:41,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {188030#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {188026#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:18:41,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {188034#(or (< 0 (mod (+ main_~y~0 4294967287) 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; {188030#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:18:41,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {188038#(or (< 0 (mod (+ main_~y~0 4294967287) 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; {188034#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:18:41,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {188042#(or (< 0 (mod (+ main_~y~0 4294967287) 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; {188038#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:18:41,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {188046#(or (< 0 (mod (+ main_~y~0 4294967287) 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; {188042#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:18:41,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {188050#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 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; {188046#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-28 10:18:41,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {188054#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 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; {188050#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:18:41,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {187795#true} ~z~0 := ~y~0; {188054#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} is VALID [2022-04-28 10:18:41,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {187795#true} assume !(~x~0 % 4294967296 > 0); {187795#true} is VALID [2022-04-28 10:18:41,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {187795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187795#true} is VALID [2022-04-28 10:18:41,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {187795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187795#true} is VALID [2022-04-28 10:18:41,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {187795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187795#true} is VALID [2022-04-28 10:18:41,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {187795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187795#true} is VALID [2022-04-28 10:18:41,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {187795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187795#true} is VALID [2022-04-28 10:18:41,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {187795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187795#true} is VALID [2022-04-28 10:18:41,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {187795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187795#true} is VALID [2022-04-28 10:18:41,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {187795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187795#true} is VALID [2022-04-28 10:18:41,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {187795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187795#true} is VALID [2022-04-28 10:18:41,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {187795#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {187795#true} is VALID [2022-04-28 10:18:41,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {187795#true} call #t~ret13 := main(); {187795#true} is VALID [2022-04-28 10:18:41,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187795#true} {187795#true} #72#return; {187795#true} is VALID [2022-04-28 10:18:41,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {187795#true} assume true; {187795#true} is VALID [2022-04-28 10:18:41,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {187795#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); {187795#true} is VALID [2022-04-28 10:18:41,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {187795#true} call ULTIMATE.init(); {187795#true} is VALID [2022-04-28 10:18:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:18:41,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229284605] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:18:41,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:18:41,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 53 [2022-04-28 10:18:41,302 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:18:41,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [48897006] [2022-04-28 10:18:41,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [48897006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:18:41,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:18:41,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:18:41,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319413253] [2022-04-28 10:18:41,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:18:41,302 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 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 43 [2022-04-28 10:18:41,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:18:41,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:41,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:41,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:18:41,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:41,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:18:41,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=2333, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 10:18:41,327 INFO L87 Difference]: Start difference. First operand 607 states and 830 transitions. Second operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:48,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:48,639 INFO L93 Difference]: Finished difference Result 711 states and 935 transitions. [2022-04-28 10:18:48,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-28 10:18:48,639 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 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 43 [2022-04-28 10:18:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:18:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 109 transitions. [2022-04-28 10:18:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 109 transitions. [2022-04-28 10:18:48,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 109 transitions. [2022-04-28 10:18:48,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:48,758 INFO L225 Difference]: With dead ends: 711 [2022-04-28 10:18:48,758 INFO L226 Difference]: Without dead ends: 649 [2022-04-28 10:18:48,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2700 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1763, Invalid=10447, Unknown=0, NotChecked=0, Total=12210 [2022-04-28 10:18:48,759 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:18:48,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 118 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 10:18:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-04-28 10:18:51,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 606. [2022-04-28 10:18:51,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:51,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 649 states. Second operand has 606 states, 601 states have (on average 1.3643926788685523) internal successors, (820), 601 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:51,763 INFO L74 IsIncluded]: Start isIncluded. First operand 649 states. Second operand has 606 states, 601 states have (on average 1.3643926788685523) internal successors, (820), 601 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:51,763 INFO L87 Difference]: Start difference. First operand 649 states. Second operand has 606 states, 601 states have (on average 1.3643926788685523) internal successors, (820), 601 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:51,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:51,775 INFO L93 Difference]: Finished difference Result 649 states and 868 transitions. [2022-04-28 10:18:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 868 transitions. [2022-04-28 10:18:51,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:51,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:51,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 601 states have (on average 1.3643926788685523) internal successors, (820), 601 states have internal predecessors, (820), 3 states have call successors, (3), 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 649 states. [2022-04-28 10:18:51,776 INFO L87 Difference]: Start difference. First operand has 606 states, 601 states have (on average 1.3643926788685523) internal successors, (820), 601 states have internal predecessors, (820), 3 states have call successors, (3), 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 649 states. [2022-04-28 10:18:51,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:51,787 INFO L93 Difference]: Finished difference Result 649 states and 868 transitions. [2022-04-28 10:18:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 868 transitions. [2022-04-28 10:18:51,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:51,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:51,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:51,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 601 states have (on average 1.3643926788685523) internal successors, (820), 601 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 824 transitions. [2022-04-28 10:18:51,802 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 824 transitions. Word has length 43 [2022-04-28 10:18:51,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:51,802 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 824 transitions. [2022-04-28 10:18:51,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:51,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 606 states and 824 transitions. [2022-04-28 10:18:56,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 824 edges. 824 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 824 transitions. [2022-04-28 10:18:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:18:56,307 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:18:56,307 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:18:56,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-04-28 10:18:56,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:56,507 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:18:56,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:18:56,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1870434904, now seen corresponding path program 87 times [2022-04-28 10:18:56,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:56,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1028912224] [2022-04-28 10:18:56,510 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:18:56,510 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:18:56,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1870434904, now seen corresponding path program 88 times [2022-04-28 10:18:56,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:18:56,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250840854] [2022-04-28 10:18:56,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:18:56,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:18:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:56,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:18:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:56,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {192177#(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); {192156#true} is VALID [2022-04-28 10:18:56,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {192156#true} assume true; {192156#true} is VALID [2022-04-28 10:18:56,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {192156#true} {192156#true} #72#return; {192156#true} is VALID [2022-04-28 10:18:56,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {192156#true} call ULTIMATE.init(); {192177#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:18:56,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {192177#(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); {192156#true} is VALID [2022-04-28 10:18:56,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {192156#true} assume true; {192156#true} is VALID [2022-04-28 10:18:56,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192156#true} {192156#true} #72#return; {192156#true} is VALID [2022-04-28 10:18:56,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {192156#true} call #t~ret13 := main(); {192156#true} is VALID [2022-04-28 10:18:56,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {192156#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {192161#(= main_~y~0 0)} is VALID [2022-04-28 10:18:56,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {192161#(= 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; {192162#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:56,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {192162#(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; {192163#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:56,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {192163#(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; {192164#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:56,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {192164#(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; {192165#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:56,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {192165#(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; {192166#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:56,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {192166#(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; {192167#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:56,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {192167#(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; {192168#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:56,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {192168#(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; {192169#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:56,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {192169#(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; {192170#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:56,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {192170#(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; {192171#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:18:56,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {192171#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {192171#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:18:56,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {192171#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {192172#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:18:56,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {192172#(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; {192173#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:18:56,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {192173#(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; {192174#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:18:56,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {192174#(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; {192175#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:18:56,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {192175#(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; {192176#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:18:56,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {192176#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {192157#false} is VALID [2022-04-28 10:18:56,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:56,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:56,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:56,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:56,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:56,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:56,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:56,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:56,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:56,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:56,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {192157#false} assume !(~y~0 % 4294967296 > 0); {192157#false} is VALID [2022-04-28 10:18:56,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {192157#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {192157#false} is VALID [2022-04-28 10:18:56,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {192157#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {192157#false} is VALID [2022-04-28 10:18:56,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {192157#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {192157#false} is VALID [2022-04-28 10:18:56,775 INFO L290 TraceCheckUtils]: 37: Hoare triple {192157#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {192157#false} is VALID [2022-04-28 10:18:56,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {192157#false} assume !(~x~0 % 4294967296 > 0); {192157#false} is VALID [2022-04-28 10:18:56,775 INFO L272 TraceCheckUtils]: 39: Hoare triple {192157#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {192157#false} is VALID [2022-04-28 10:18:56,775 INFO L290 TraceCheckUtils]: 40: Hoare triple {192157#false} ~cond := #in~cond; {192157#false} is VALID [2022-04-28 10:18:56,775 INFO L290 TraceCheckUtils]: 41: Hoare triple {192157#false} assume 0 == ~cond; {192157#false} is VALID [2022-04-28 10:18:56,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {192157#false} assume !false; {192157#false} is VALID [2022-04-28 10:18:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-04-28 10:18:56,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:18:56,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250840854] [2022-04-28 10:18:56,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250840854] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:18:56,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479281109] [2022-04-28 10:18:56,775 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:18:56,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:56,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:18:56,776 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:18:56,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-04-28 10:18:56,827 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:18:56,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:18:56,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:18:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:56,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:18:57,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {192156#true} call ULTIMATE.init(); {192156#true} is VALID [2022-04-28 10:18:57,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {192156#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); {192156#true} is VALID [2022-04-28 10:18:57,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {192156#true} assume true; {192156#true} is VALID [2022-04-28 10:18:57,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192156#true} {192156#true} #72#return; {192156#true} is VALID [2022-04-28 10:18:57,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {192156#true} call #t~ret13 := main(); {192156#true} is VALID [2022-04-28 10:18:57,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {192156#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {192161#(= main_~y~0 0)} is VALID [2022-04-28 10:18:57,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {192161#(= 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; {192162#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:57,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {192162#(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; {192163#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:57,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {192163#(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; {192164#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:57,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {192164#(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; {192165#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:57,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {192165#(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; {192166#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:57,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {192166#(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; {192167#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:57,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {192167#(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; {192168#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:57,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {192168#(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; {192169#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:57,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {192169#(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; {192170#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:57,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {192170#(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; {192171#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:18:57,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {192171#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {192171#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:18:57,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {192171#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {192172#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:18:57,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {192172#(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; {192173#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:18:57,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {192173#(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; {192174#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:18:57,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {192174#(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; {192175#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:18:57,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {192175#(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; {192244#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:18:57,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {192244#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {192157#false} is VALID [2022-04-28 10:18:57,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,148 INFO L290 TraceCheckUtils]: 32: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {192157#false} assume !(~y~0 % 4294967296 > 0); {192157#false} is VALID [2022-04-28 10:18:57,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {192157#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {192157#false} is VALID [2022-04-28 10:18:57,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {192157#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {192157#false} is VALID [2022-04-28 10:18:57,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {192157#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {192157#false} is VALID [2022-04-28 10:18:57,148 INFO L290 TraceCheckUtils]: 37: Hoare triple {192157#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {192157#false} is VALID [2022-04-28 10:18:57,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {192157#false} assume !(~x~0 % 4294967296 > 0); {192157#false} is VALID [2022-04-28 10:18:57,148 INFO L272 TraceCheckUtils]: 39: Hoare triple {192157#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {192157#false} is VALID [2022-04-28 10:18:57,148 INFO L290 TraceCheckUtils]: 40: Hoare triple {192157#false} ~cond := #in~cond; {192157#false} is VALID [2022-04-28 10:18:57,148 INFO L290 TraceCheckUtils]: 41: Hoare triple {192157#false} assume 0 == ~cond; {192157#false} is VALID [2022-04-28 10:18:57,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {192157#false} assume !false; {192157#false} is VALID [2022-04-28 10:18:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-04-28 10:18:57,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:18:57,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {192157#false} assume !false; {192157#false} is VALID [2022-04-28 10:18:57,641 INFO L290 TraceCheckUtils]: 41: Hoare triple {192157#false} assume 0 == ~cond; {192157#false} is VALID [2022-04-28 10:18:57,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {192157#false} ~cond := #in~cond; {192157#false} is VALID [2022-04-28 10:18:57,641 INFO L272 TraceCheckUtils]: 39: Hoare triple {192157#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {192157#false} is VALID [2022-04-28 10:18:57,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {192157#false} assume !(~x~0 % 4294967296 > 0); {192157#false} is VALID [2022-04-28 10:18:57,641 INFO L290 TraceCheckUtils]: 37: Hoare triple {192157#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {192157#false} is VALID [2022-04-28 10:18:57,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {192157#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {192157#false} is VALID [2022-04-28 10:18:57,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {192157#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {192157#false} is VALID [2022-04-28 10:18:57,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {192157#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {192157#false} is VALID [2022-04-28 10:18:57,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {192157#false} assume !(~y~0 % 4294967296 > 0); {192157#false} is VALID [2022-04-28 10:18:57,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,642 INFO L290 TraceCheckUtils]: 28: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,642 INFO L290 TraceCheckUtils]: 27: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {192157#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192157#false} is VALID [2022-04-28 10:18:57,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {192368#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {192157#false} is VALID [2022-04-28 10:18:57,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {192372#(< 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; {192368#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:18:57,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {192376#(< 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; {192372#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:18:57,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {192380#(< 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; {192376#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:18:57,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {192384#(< 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; {192380#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:18:57,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {192388#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {192384#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:18:57,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {192388#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {192388#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:57,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {192395#(< 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; {192388#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:57,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {192399#(< 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; {192395#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:18:57,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {192403#(< 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; {192399#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:18:57,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {192407#(< 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; {192403#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:18:57,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {192411#(< 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; {192407#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:18:57,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {192415#(< 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; {192411#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:18:57,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {192419#(< 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; {192415#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:18:57,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {192423#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192419#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:18:57,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {192427#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192423#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:18:57,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {192431#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192427#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:57,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {192156#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {192431#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:18:57,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {192156#true} call #t~ret13 := main(); {192156#true} is VALID [2022-04-28 10:18:57,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192156#true} {192156#true} #72#return; {192156#true} is VALID [2022-04-28 10:18:57,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {192156#true} assume true; {192156#true} is VALID [2022-04-28 10:18:57,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {192156#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); {192156#true} is VALID [2022-04-28 10:18:57,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {192156#true} call ULTIMATE.init(); {192156#true} is VALID [2022-04-28 10:18:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-04-28 10:18:57,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479281109] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:18:57,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:18:57,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:18:57,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:18:57,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1028912224] [2022-04-28 10:18:57,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1028912224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:18:57,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:18:57,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:18:57,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683472956] [2022-04-28 10:18:57,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:18:57,655 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 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 43 [2022-04-28 10:18:57,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:18:57,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:57,677 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-28 10:18:57,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:18:57,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:57,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:18:57,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:18:57,678 INFO L87 Difference]: Start difference. First operand 606 states and 824 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:03,176 INFO L93 Difference]: Finished difference Result 711 states and 929 transitions. [2022-04-28 10:19:03,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:19:03,176 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 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 43 [2022-04-28 10:19:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:19:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 83 transitions. [2022-04-28 10:19:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 83 transitions. [2022-04-28 10:19:03,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 83 transitions. [2022-04-28 10:19:03,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:03,263 INFO L225 Difference]: With dead ends: 711 [2022-04-28 10:19:03,263 INFO L226 Difference]: Without dead ends: 690 [2022-04-28 10:19:03,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=708, Invalid=2952, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:19:03,263 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:19:03,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 99 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:19:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-04-28 10:19:06,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 606. [2022-04-28 10:19:06,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:19:06,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 690 states. Second operand has 606 states, 601 states have (on average 1.362728785357737) internal successors, (819), 601 states have internal predecessors, (819), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:06,293 INFO L74 IsIncluded]: Start isIncluded. First operand 690 states. Second operand has 606 states, 601 states have (on average 1.362728785357737) internal successors, (819), 601 states have internal predecessors, (819), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:06,293 INFO L87 Difference]: Start difference. First operand 690 states. Second operand has 606 states, 601 states have (on average 1.362728785357737) internal successors, (819), 601 states have internal predecessors, (819), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:06,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:06,306 INFO L93 Difference]: Finished difference Result 690 states and 908 transitions. [2022-04-28 10:19:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 908 transitions. [2022-04-28 10:19:06,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:06,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:06,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 601 states have (on average 1.362728785357737) internal successors, (819), 601 states have internal predecessors, (819), 3 states have call successors, (3), 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 690 states. [2022-04-28 10:19:06,307 INFO L87 Difference]: Start difference. First operand has 606 states, 601 states have (on average 1.362728785357737) internal successors, (819), 601 states have internal predecessors, (819), 3 states have call successors, (3), 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 690 states. [2022-04-28 10:19:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:06,319 INFO L93 Difference]: Finished difference Result 690 states and 908 transitions. [2022-04-28 10:19:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 908 transitions. [2022-04-28 10:19:06,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:06,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:06,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:19:06,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:19:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 601 states have (on average 1.362728785357737) internal successors, (819), 601 states have internal predecessors, (819), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 823 transitions. [2022-04-28 10:19:06,334 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 823 transitions. Word has length 43 [2022-04-28 10:19:06,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:19:06,335 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 823 transitions. [2022-04-28 10:19:06,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:06,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 606 states and 823 transitions. [2022-04-28 10:19:11,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 823 edges. 823 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:11,778 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 823 transitions. [2022-04-28 10:19:11,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:19:11,778 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:19:11,778 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:19:11,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2022-04-28 10:19:11,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:11,983 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:19:11,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:19:11,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1838331064, now seen corresponding path program 89 times [2022-04-28 10:19:11,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:11,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [152517511] [2022-04-28 10:19:11,986 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:19:11,986 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:19:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1838331064, now seen corresponding path program 90 times [2022-04-28 10:19:11,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:19:11,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272824565] [2022-04-28 10:19:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:19:11,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:19:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:12,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:19:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:12,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {196537#(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); {196516#true} is VALID [2022-04-28 10:19:12,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {196516#true} assume true; {196516#true} is VALID [2022-04-28 10:19:12,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {196516#true} {196516#true} #72#return; {196516#true} is VALID [2022-04-28 10:19:12,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {196516#true} call ULTIMATE.init(); {196537#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:19:12,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {196537#(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); {196516#true} is VALID [2022-04-28 10:19:12,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {196516#true} assume true; {196516#true} is VALID [2022-04-28 10:19:12,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196516#true} {196516#true} #72#return; {196516#true} is VALID [2022-04-28 10:19:12,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {196516#true} call #t~ret13 := main(); {196516#true} is VALID [2022-04-28 10:19:12,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {196516#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {196521#(= main_~y~0 0)} is VALID [2022-04-28 10:19:12,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {196521#(= 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; {196522#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:12,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {196522#(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; {196523#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:12,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {196523#(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; {196524#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:12,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {196524#(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; {196525#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:12,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {196525#(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; {196526#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:12,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {196526#(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; {196527#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:12,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {196527#(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; {196528#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:12,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {196528#(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; {196529#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:12,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {196529#(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; {196530#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:12,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {196530#(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; {196531#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:12,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {196531#(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; {196532#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:12,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {196532#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {196532#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:12,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {196532#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {196533#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:19:12,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {196533#(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; {196534#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:19:12,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {196534#(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; {196535#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:19:12,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {196535#(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; {196536#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:19:12,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {196536#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {196517#false} is VALID [2022-04-28 10:19:12,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {196517#false} assume !(~y~0 % 4294967296 > 0); {196517#false} is VALID [2022-04-28 10:19:12,248 INFO L290 TraceCheckUtils]: 35: Hoare triple {196517#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {196517#false} is VALID [2022-04-28 10:19:12,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {196517#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {196517#false} is VALID [2022-04-28 10:19:12,248 INFO L290 TraceCheckUtils]: 37: Hoare triple {196517#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {196517#false} is VALID [2022-04-28 10:19:12,248 INFO L290 TraceCheckUtils]: 38: Hoare triple {196517#false} assume !(~x~0 % 4294967296 > 0); {196517#false} is VALID [2022-04-28 10:19:12,248 INFO L272 TraceCheckUtils]: 39: Hoare triple {196517#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {196517#false} is VALID [2022-04-28 10:19:12,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {196517#false} ~cond := #in~cond; {196517#false} is VALID [2022-04-28 10:19:12,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {196517#false} assume 0 == ~cond; {196517#false} is VALID [2022-04-28 10:19:12,248 INFO L290 TraceCheckUtils]: 42: Hoare triple {196517#false} assume !false; {196517#false} is VALID [2022-04-28 10:19:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 10:19:12,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:19:12,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272824565] [2022-04-28 10:19:12,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272824565] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:19:12,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094027825] [2022-04-28 10:19:12,248 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:19:12,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:12,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:19:12,249 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:19:12,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-04-28 10:19:12,506 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:19:12,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:19:12,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:19:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:12,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:19:12,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {196516#true} call ULTIMATE.init(); {196516#true} is VALID [2022-04-28 10:19:12,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {196516#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); {196516#true} is VALID [2022-04-28 10:19:12,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {196516#true} assume true; {196516#true} is VALID [2022-04-28 10:19:12,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196516#true} {196516#true} #72#return; {196516#true} is VALID [2022-04-28 10:19:12,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {196516#true} call #t~ret13 := main(); {196516#true} is VALID [2022-04-28 10:19:12,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {196516#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {196521#(= main_~y~0 0)} is VALID [2022-04-28 10:19:12,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {196521#(= 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; {196522#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:12,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {196522#(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; {196523#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:12,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {196523#(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; {196524#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:12,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {196524#(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; {196525#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:12,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {196525#(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; {196526#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:12,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {196526#(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; {196527#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:12,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {196527#(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; {196528#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:12,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {196528#(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; {196529#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:12,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {196529#(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; {196530#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:12,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {196530#(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; {196531#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:12,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {196531#(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; {196532#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:12,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {196532#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {196532#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:12,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {196532#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {196533#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:19:12,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {196533#(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; {196534#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:19:12,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {196534#(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; {196535#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:19:12,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {196535#(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; {196604#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:19:12,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {196604#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {196517#false} is VALID [2022-04-28 10:19:12,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {196517#false} assume !(~y~0 % 4294967296 > 0); {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {196517#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L290 TraceCheckUtils]: 36: Hoare triple {196517#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {196517#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {196517#false} assume !(~x~0 % 4294967296 > 0); {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L272 TraceCheckUtils]: 39: Hoare triple {196517#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {196517#false} is VALID [2022-04-28 10:19:12,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {196517#false} ~cond := #in~cond; {196517#false} is VALID [2022-04-28 10:19:12,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {196517#false} assume 0 == ~cond; {196517#false} is VALID [2022-04-28 10:19:12,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {196517#false} assume !false; {196517#false} is VALID [2022-04-28 10:19:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 10:19:12,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:19:13,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {196517#false} assume !false; {196517#false} is VALID [2022-04-28 10:19:13,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {196517#false} assume 0 == ~cond; {196517#false} is VALID [2022-04-28 10:19:13,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {196517#false} ~cond := #in~cond; {196517#false} is VALID [2022-04-28 10:19:13,363 INFO L272 TraceCheckUtils]: 39: Hoare triple {196517#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {196517#false} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {196517#false} assume !(~x~0 % 4294967296 > 0); {196517#false} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {196517#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {196517#false} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {196517#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {196517#false} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {196517#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {196517#false} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {196517#false} assume !(~y~0 % 4294967296 > 0); {196517#false} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:13,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:13,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {196517#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {196517#false} is VALID [2022-04-28 10:19:13,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {196728#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {196517#false} is VALID [2022-04-28 10:19:13,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {196732#(< 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; {196728#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:13,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {196736#(< 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; {196732#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:19:13,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {196740#(< 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; {196736#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:19:13,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {196744#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {196740#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:19:13,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {196744#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {196744#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:19:13,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {196751#(< 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; {196744#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:19:13,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {196755#(< 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; {196751#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:19:13,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {196759#(< 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; {196755#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:19:13,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {196763#(< 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; {196759#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:19:13,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {196767#(< 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; {196763#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:19:13,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {196771#(< 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; {196767#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {196775#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {196771#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:19:13,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {196779#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {196775#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:19:13,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {196783#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {196779#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:13,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {196787#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {196783#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:19:13,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {196791#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {196787#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:13,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {196516#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {196791#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:19:13,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {196516#true} call #t~ret13 := main(); {196516#true} is VALID [2022-04-28 10:19:13,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196516#true} {196516#true} #72#return; {196516#true} is VALID [2022-04-28 10:19:13,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {196516#true} assume true; {196516#true} is VALID [2022-04-28 10:19:13,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {196516#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); {196516#true} is VALID [2022-04-28 10:19:13,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {196516#true} call ULTIMATE.init(); {196516#true} is VALID [2022-04-28 10:19:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 10:19:13,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094027825] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:19:13,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:19:13,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:19:13,376 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:19:13,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [152517511] [2022-04-28 10:19:13,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [152517511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:19:13,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:19:13,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:19:13,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973221090] [2022-04-28 10:19:13,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:19:13,377 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 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 43 [2022-04-28 10:19:13,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:19:13,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:13,397 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-28 10:19:13,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:19:13,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:13,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:19:13,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:19:13,398 INFO L87 Difference]: Start difference. First operand 606 states and 823 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:19,034 INFO L93 Difference]: Finished difference Result 729 states and 946 transitions. [2022-04-28 10:19:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:19:19,035 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 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 43 [2022-04-28 10:19:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:19:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 85 transitions. [2022-04-28 10:19:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 85 transitions. [2022-04-28 10:19:19,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 85 transitions. [2022-04-28 10:19:19,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:19,127 INFO L225 Difference]: With dead ends: 729 [2022-04-28 10:19:19,128 INFO L226 Difference]: Without dead ends: 708 [2022-04-28 10:19:19,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=653, Invalid=2653, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:19:19,128 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:19:19,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 107 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:19:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-04-28 10:19:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 606. [2022-04-28 10:19:22,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:19:22,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 708 states. Second operand has 606 states, 601 states have (on average 1.3610648918469217) internal successors, (818), 601 states have internal predecessors, (818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:22,171 INFO L74 IsIncluded]: Start isIncluded. First operand 708 states. Second operand has 606 states, 601 states have (on average 1.3610648918469217) internal successors, (818), 601 states have internal predecessors, (818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:22,171 INFO L87 Difference]: Start difference. First operand 708 states. Second operand has 606 states, 601 states have (on average 1.3610648918469217) internal successors, (818), 601 states have internal predecessors, (818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:22,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:22,185 INFO L93 Difference]: Finished difference Result 708 states and 925 transitions. [2022-04-28 10:19:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 925 transitions. [2022-04-28 10:19:22,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:22,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:22,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 601 states have (on average 1.3610648918469217) internal successors, (818), 601 states have internal predecessors, (818), 3 states have call successors, (3), 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 708 states. [2022-04-28 10:19:22,186 INFO L87 Difference]: Start difference. First operand has 606 states, 601 states have (on average 1.3610648918469217) internal successors, (818), 601 states have internal predecessors, (818), 3 states have call successors, (3), 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 708 states. [2022-04-28 10:19:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:22,199 INFO L93 Difference]: Finished difference Result 708 states and 925 transitions. [2022-04-28 10:19:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 925 transitions. [2022-04-28 10:19:22,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:22,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:22,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:19:22,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:19:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 601 states have (on average 1.3610648918469217) internal successors, (818), 601 states have internal predecessors, (818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 822 transitions. [2022-04-28 10:19:22,214 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 822 transitions. Word has length 43 [2022-04-28 10:19:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:19:22,214 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 822 transitions. [2022-04-28 10:19:22,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:22,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 606 states and 822 transitions. [2022-04-28 10:19:26,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 822 edges. 822 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 822 transitions. [2022-04-28 10:19:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:19:26,991 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:19:26,991 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:19:26,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-04-28 10:19:27,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable92 [2022-04-28 10:19:27,191 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:19:27,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:19:27,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2096516008, now seen corresponding path program 91 times [2022-04-28 10:19:27,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:27,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [700233789] [2022-04-28 10:19:27,194 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:19:27,194 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:19:27,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2096516008, now seen corresponding path program 92 times [2022-04-28 10:19:27,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:19:27,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209900954] [2022-04-28 10:19:27,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:19:27,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:19:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:27,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:19:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:27,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {200963#(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); {200942#true} is VALID [2022-04-28 10:19:27,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {200942#true} assume true; {200942#true} is VALID [2022-04-28 10:19:27,450 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {200942#true} {200942#true} #72#return; {200942#true} is VALID [2022-04-28 10:19:27,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {200942#true} call ULTIMATE.init(); {200963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:19:27,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {200963#(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); {200942#true} is VALID [2022-04-28 10:19:27,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {200942#true} assume true; {200942#true} is VALID [2022-04-28 10:19:27,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {200942#true} {200942#true} #72#return; {200942#true} is VALID [2022-04-28 10:19:27,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {200942#true} call #t~ret13 := main(); {200942#true} is VALID [2022-04-28 10:19:27,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {200942#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {200947#(= main_~y~0 0)} is VALID [2022-04-28 10:19:27,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {200947#(= 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; {200948#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:27,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {200948#(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; {200949#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:27,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {200949#(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; {200950#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:27,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {200950#(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; {200951#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:27,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {200951#(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; {200952#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:27,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {200952#(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; {200953#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:27,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {200953#(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; {200954#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:27,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {200954#(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; {200955#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:27,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {200955#(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; {200956#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:27,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {200956#(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; {200957#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:27,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {200957#(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; {200958#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:27,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {200958#(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; {200959#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:19:27,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {200959#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {200959#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:19:27,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {200959#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {200960#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:19:27,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {200960#(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; {200961#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:19:27,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {200961#(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; {200962#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:19:27,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {200962#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {200943#false} is VALID [2022-04-28 10:19:27,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {200943#false} assume !(~y~0 % 4294967296 > 0); {200943#false} is VALID [2022-04-28 10:19:27,461 INFO L290 TraceCheckUtils]: 36: Hoare triple {200943#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {200943#false} is VALID [2022-04-28 10:19:27,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {200943#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {200943#false} is VALID [2022-04-28 10:19:27,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {200943#false} assume !(~x~0 % 4294967296 > 0); {200943#false} is VALID [2022-04-28 10:19:27,461 INFO L272 TraceCheckUtils]: 39: Hoare triple {200943#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {200943#false} is VALID [2022-04-28 10:19:27,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {200943#false} ~cond := #in~cond; {200943#false} is VALID [2022-04-28 10:19:27,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {200943#false} assume 0 == ~cond; {200943#false} is VALID [2022-04-28 10:19:27,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {200943#false} assume !false; {200943#false} is VALID [2022-04-28 10:19:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-28 10:19:27,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:19:27,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209900954] [2022-04-28 10:19:27,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209900954] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:19:27,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983563697] [2022-04-28 10:19:27,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:19:27,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:27,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:19:27,463 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:19:27,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-04-28 10:19:27,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:19:27,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:19:27,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:19:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:27,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:19:27,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {200942#true} call ULTIMATE.init(); {200942#true} is VALID [2022-04-28 10:19:27,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {200942#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); {200942#true} is VALID [2022-04-28 10:19:27,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {200942#true} assume true; {200942#true} is VALID [2022-04-28 10:19:27,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {200942#true} {200942#true} #72#return; {200942#true} is VALID [2022-04-28 10:19:27,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {200942#true} call #t~ret13 := main(); {200942#true} is VALID [2022-04-28 10:19:27,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {200942#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {200947#(= main_~y~0 0)} is VALID [2022-04-28 10:19:27,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {200947#(= 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; {200948#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:27,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {200948#(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; {200949#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:27,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {200949#(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; {200950#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:27,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {200950#(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; {200951#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:27,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {200951#(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; {200952#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:27,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {200952#(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; {200953#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:27,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {200953#(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; {200954#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:27,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {200954#(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; {200955#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:27,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {200955#(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; {200956#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:27,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {200956#(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; {200957#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:27,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {200957#(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; {200958#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:27,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {200958#(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; {200959#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:19:27,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {200959#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {200959#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:19:27,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {200959#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {200960#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:19:27,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {200960#(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; {200961#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:19:27,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {200961#(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; {201030#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:19:27,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {201030#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {200943#false} is VALID [2022-04-28 10:19:27,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:27,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {200943#false} assume !(~y~0 % 4294967296 > 0); {200943#false} is VALID [2022-04-28 10:19:27,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {200943#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {200943#false} is VALID [2022-04-28 10:19:27,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {200943#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {200943#false} is VALID [2022-04-28 10:19:27,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {200943#false} assume !(~x~0 % 4294967296 > 0); {200943#false} is VALID [2022-04-28 10:19:27,823 INFO L272 TraceCheckUtils]: 39: Hoare triple {200943#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {200943#false} is VALID [2022-04-28 10:19:27,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {200943#false} ~cond := #in~cond; {200943#false} is VALID [2022-04-28 10:19:27,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {200943#false} assume 0 == ~cond; {200943#false} is VALID [2022-04-28 10:19:27,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {200943#false} assume !false; {200943#false} is VALID [2022-04-28 10:19:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-28 10:19:27,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:19:28,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {200943#false} assume !false; {200943#false} is VALID [2022-04-28 10:19:28,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {200943#false} assume 0 == ~cond; {200943#false} is VALID [2022-04-28 10:19:28,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {200943#false} ~cond := #in~cond; {200943#false} is VALID [2022-04-28 10:19:28,325 INFO L272 TraceCheckUtils]: 39: Hoare triple {200943#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {200943#false} is VALID [2022-04-28 10:19:28,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {200943#false} assume !(~x~0 % 4294967296 > 0); {200943#false} is VALID [2022-04-28 10:19:28,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {200943#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {200943#false} is VALID [2022-04-28 10:19:28,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {200943#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {200943#false} is VALID [2022-04-28 10:19:28,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {200943#false} assume !(~y~0 % 4294967296 > 0); {200943#false} is VALID [2022-04-28 10:19:28,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:28,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:28,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:28,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:28,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:28,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:28,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:28,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:28,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:28,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:28,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:28,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {200943#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {200943#false} is VALID [2022-04-28 10:19:28,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {201154#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {200943#false} is VALID [2022-04-28 10:19:28,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {201158#(< 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; {201154#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:28,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {201162#(< 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; {201158#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:19:28,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {201166#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {201162#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:19:28,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {201166#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {201166#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:19:28,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {201173#(< 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; {201166#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:19:28,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {201177#(< 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; {201173#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:19:28,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {201181#(< 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; {201177#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:19:28,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {201185#(< 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; {201181#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:19:28,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {201189#(< 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; {201185#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:19:28,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {201193#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {201189#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:19:28,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {201197#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {201193#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:19:28,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {201201#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {201197#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:28,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {201205#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {201201#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:19:28,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {201209#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {201205#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:28,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {201213#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {201209#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:19:28,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {201217#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {201213#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:19:28,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {200942#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {201217#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:19:28,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {200942#true} call #t~ret13 := main(); {200942#true} is VALID [2022-04-28 10:19:28,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {200942#true} {200942#true} #72#return; {200942#true} is VALID [2022-04-28 10:19:28,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {200942#true} assume true; {200942#true} is VALID [2022-04-28 10:19:28,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {200942#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); {200942#true} is VALID [2022-04-28 10:19:28,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {200942#true} call ULTIMATE.init(); {200942#true} is VALID [2022-04-28 10:19:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-28 10:19:28,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983563697] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:19:28,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:19:28,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:19:28,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:19:28,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [700233789] [2022-04-28 10:19:28,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [700233789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:19:28,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:19:28,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:19:28,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876484897] [2022-04-28 10:19:28,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:19:28,339 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 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 43 [2022-04-28 10:19:28,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:19:28,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:28,359 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-28 10:19:28,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:19:28,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:28,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:19:28,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:19:28,360 INFO L87 Difference]: Start difference. First operand 606 states and 822 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:34,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:34,137 INFO L93 Difference]: Finished difference Result 749 states and 965 transitions. [2022-04-28 10:19:34,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:19:34,137 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 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 43 [2022-04-28 10:19:34,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:19:34,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 87 transitions. [2022-04-28 10:19:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 87 transitions. [2022-04-28 10:19:34,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 87 transitions. [2022-04-28 10:19:34,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:34,230 INFO L225 Difference]: With dead ends: 749 [2022-04-28 10:19:34,230 INFO L226 Difference]: Without dead ends: 728 [2022-04-28 10:19:34,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=606, Invalid=2364, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:19:34,231 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 59 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:19:34,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 111 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:19:34,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-04-28 10:19:37,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 606. [2022-04-28 10:19:37,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:19:37,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 728 states. Second operand has 606 states, 601 states have (on average 1.3594009983361064) internal successors, (817), 601 states have internal predecessors, (817), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:37,263 INFO L74 IsIncluded]: Start isIncluded. First operand 728 states. Second operand has 606 states, 601 states have (on average 1.3594009983361064) internal successors, (817), 601 states have internal predecessors, (817), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:37,264 INFO L87 Difference]: Start difference. First operand 728 states. Second operand has 606 states, 601 states have (on average 1.3594009983361064) internal successors, (817), 601 states have internal predecessors, (817), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:37,278 INFO L93 Difference]: Finished difference Result 728 states and 944 transitions. [2022-04-28 10:19:37,278 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 944 transitions. [2022-04-28 10:19:37,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:37,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:37,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 601 states have (on average 1.3594009983361064) internal successors, (817), 601 states have internal predecessors, (817), 3 states have call successors, (3), 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 728 states. [2022-04-28 10:19:37,279 INFO L87 Difference]: Start difference. First operand has 606 states, 601 states have (on average 1.3594009983361064) internal successors, (817), 601 states have internal predecessors, (817), 3 states have call successors, (3), 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 728 states. [2022-04-28 10:19:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:37,293 INFO L93 Difference]: Finished difference Result 728 states and 944 transitions. [2022-04-28 10:19:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 944 transitions. [2022-04-28 10:19:37,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:37,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:37,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:19:37,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:19:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 601 states have (on average 1.3594009983361064) internal successors, (817), 601 states have internal predecessors, (817), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:37,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 821 transitions. [2022-04-28 10:19:37,307 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 821 transitions. Word has length 43 [2022-04-28 10:19:37,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:19:37,307 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 821 transitions. [2022-04-28 10:19:37,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:37,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 606 states and 821 transitions. [2022-04-28 10:19:42,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 821 edges. 821 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 821 transitions. [2022-04-28 10:19:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:19:42,186 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:19:42,186 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:19:42,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2022-04-28 10:19:42,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:42,386 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:19:42,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:19:42,386 INFO L85 PathProgramCache]: Analyzing trace with hash 666102088, now seen corresponding path program 93 times [2022-04-28 10:19:42,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:42,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [163155266] [2022-04-28 10:19:42,389 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:19:42,389 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:19:42,389 INFO L85 PathProgramCache]: Analyzing trace with hash 666102088, now seen corresponding path program 94 times [2022-04-28 10:19:42,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:19:42,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008731802] [2022-04-28 10:19:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:19:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:19:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:42,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:19:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:42,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {205463#(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); {205442#true} is VALID [2022-04-28 10:19:42,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {205442#true} assume true; {205442#true} is VALID [2022-04-28 10:19:42,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {205442#true} {205442#true} #72#return; {205442#true} is VALID [2022-04-28 10:19:42,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {205442#true} call ULTIMATE.init(); {205463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:19:42,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {205463#(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); {205442#true} is VALID [2022-04-28 10:19:42,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {205442#true} assume true; {205442#true} is VALID [2022-04-28 10:19:42,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {205442#true} {205442#true} #72#return; {205442#true} is VALID [2022-04-28 10:19:42,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {205442#true} call #t~ret13 := main(); {205442#true} is VALID [2022-04-28 10:19:42,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {205442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {205447#(= main_~y~0 0)} is VALID [2022-04-28 10:19:42,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {205447#(= 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; {205448#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:42,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {205448#(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; {205449#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:42,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {205449#(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; {205450#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:42,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {205450#(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; {205451#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:42,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {205451#(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; {205452#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:42,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {205452#(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; {205453#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:42,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {205453#(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; {205454#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:42,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {205454#(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; {205455#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:42,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {205455#(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; {205456#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:42,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {205456#(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; {205457#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:42,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {205457#(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; {205458#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:42,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {205458#(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; {205459#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:19:42,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {205459#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {205460#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:19:42,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {205460#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {205460#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:19:42,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {205460#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {205461#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:19:42,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {205461#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {205462#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-28 10:19:42,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {205462#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {205443#false} is VALID [2022-04-28 10:19:42,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:42,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:42,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:42,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:42,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:42,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:42,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:42,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:42,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:42,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:42,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:42,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:42,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:42,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {205443#false} assume !(~y~0 % 4294967296 > 0); {205443#false} is VALID [2022-04-28 10:19:42,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {205443#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {205443#false} is VALID [2022-04-28 10:19:42,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {205443#false} assume !(~x~0 % 4294967296 > 0); {205443#false} is VALID [2022-04-28 10:19:42,652 INFO L272 TraceCheckUtils]: 39: Hoare triple {205443#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {205443#false} is VALID [2022-04-28 10:19:42,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {205443#false} ~cond := #in~cond; {205443#false} is VALID [2022-04-28 10:19:42,652 INFO L290 TraceCheckUtils]: 41: Hoare triple {205443#false} assume 0 == ~cond; {205443#false} is VALID [2022-04-28 10:19:42,652 INFO L290 TraceCheckUtils]: 42: Hoare triple {205443#false} assume !false; {205443#false} is VALID [2022-04-28 10:19:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-28 10:19:42,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:19:42,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008731802] [2022-04-28 10:19:42,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008731802] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:19:42,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457444821] [2022-04-28 10:19:42,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:19:42,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:42,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:19:42,654 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:19:42,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-04-28 10:19:42,703 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:19:42,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:19:42,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:19:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:42,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:19:42,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {205442#true} call ULTIMATE.init(); {205442#true} is VALID [2022-04-28 10:19:42,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {205442#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); {205442#true} is VALID [2022-04-28 10:19:42,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {205442#true} assume true; {205442#true} is VALID [2022-04-28 10:19:42,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {205442#true} {205442#true} #72#return; {205442#true} is VALID [2022-04-28 10:19:42,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {205442#true} call #t~ret13 := main(); {205442#true} is VALID [2022-04-28 10:19:42,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {205442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {205447#(= main_~y~0 0)} is VALID [2022-04-28 10:19:42,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {205447#(= 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; {205448#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:42,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {205448#(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; {205449#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:42,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {205449#(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; {205450#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:42,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {205450#(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; {205451#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:43,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {205451#(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; {205452#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:43,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {205452#(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; {205453#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:43,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {205453#(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; {205454#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:43,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {205454#(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; {205455#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:43,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {205455#(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; {205456#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:43,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {205456#(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; {205457#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:43,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {205457#(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; {205458#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:43,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {205458#(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; {205459#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:19:43,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {205459#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {205460#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:19:43,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {205460#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {205460#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:19:43,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {205460#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {205461#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:19:43,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {205461#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {205530#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:19:43,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {205530#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {205443#false} is VALID [2022-04-28 10:19:43,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {205443#false} assume !(~y~0 % 4294967296 > 0); {205443#false} is VALID [2022-04-28 10:19:43,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {205443#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {205443#false} is VALID [2022-04-28 10:19:43,007 INFO L290 TraceCheckUtils]: 38: Hoare triple {205443#false} assume !(~x~0 % 4294967296 > 0); {205443#false} is VALID [2022-04-28 10:19:43,007 INFO L272 TraceCheckUtils]: 39: Hoare triple {205443#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {205443#false} is VALID [2022-04-28 10:19:43,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {205443#false} ~cond := #in~cond; {205443#false} is VALID [2022-04-28 10:19:43,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {205443#false} assume 0 == ~cond; {205443#false} is VALID [2022-04-28 10:19:43,007 INFO L290 TraceCheckUtils]: 42: Hoare triple {205443#false} assume !false; {205443#false} is VALID [2022-04-28 10:19:43,008 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-28 10:19:43,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:19:43,520 INFO L290 TraceCheckUtils]: 42: Hoare triple {205443#false} assume !false; {205443#false} is VALID [2022-04-28 10:19:43,520 INFO L290 TraceCheckUtils]: 41: Hoare triple {205443#false} assume 0 == ~cond; {205443#false} is VALID [2022-04-28 10:19:43,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {205443#false} ~cond := #in~cond; {205443#false} is VALID [2022-04-28 10:19:43,520 INFO L272 TraceCheckUtils]: 39: Hoare triple {205443#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {205443#false} is VALID [2022-04-28 10:19:43,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {205443#false} assume !(~x~0 % 4294967296 > 0); {205443#false} is VALID [2022-04-28 10:19:43,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {205443#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {205443#false} is VALID [2022-04-28 10:19:43,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {205443#false} assume !(~y~0 % 4294967296 > 0); {205443#false} is VALID [2022-04-28 10:19:43,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {205443#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {205443#false} is VALID [2022-04-28 10:19:43,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {205654#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {205443#false} is VALID [2022-04-28 10:19:43,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {205658#(< 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; {205654#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:43,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {205662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {205658#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:19:43,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {205662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {205662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:19:43,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {205669#(< 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; {205662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:19:43,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {205673#(< 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; {205669#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:19:43,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {205677#(< 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; {205673#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:19:43,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {205681#(< 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; {205677#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:19:43,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {205685#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {205681#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:19:43,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {205689#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {205685#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:19:43,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {205693#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {205689#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:43,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {205697#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {205693#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:19:43,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {205701#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {205697#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:43,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {205705#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {205701#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:19:43,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {205709#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {205705#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:19:43,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {205713#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {205709#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:19:43,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {205717#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {205713#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:19:43,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {205442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {205717#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:19:43,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {205442#true} call #t~ret13 := main(); {205442#true} is VALID [2022-04-28 10:19:43,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {205442#true} {205442#true} #72#return; {205442#true} is VALID [2022-04-28 10:19:43,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {205442#true} assume true; {205442#true} is VALID [2022-04-28 10:19:43,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {205442#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); {205442#true} is VALID [2022-04-28 10:19:43,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {205442#true} call ULTIMATE.init(); {205442#true} is VALID [2022-04-28 10:19:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-28 10:19:43,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457444821] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:19:43,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:19:43,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:19:43,534 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:19:43,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [163155266] [2022-04-28 10:19:43,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [163155266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:19:43,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:19:43,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:19:43,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312806061] [2022-04-28 10:19:43,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:19:43,535 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 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 43 [2022-04-28 10:19:43,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:19:43,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:43,563 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-28 10:19:43,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:19:43,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:43,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:19:43,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:19:43,564 INFO L87 Difference]: Start difference. First operand 606 states and 821 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:49,455 INFO L93 Difference]: Finished difference Result 771 states and 986 transitions. [2022-04-28 10:19:49,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:19:49,455 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 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 43 [2022-04-28 10:19:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:19:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions. [2022-04-28 10:19:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions. [2022-04-28 10:19:49,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 90 transitions. [2022-04-28 10:19:49,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:49,550 INFO L225 Difference]: With dead ends: 771 [2022-04-28 10:19:49,550 INFO L226 Difference]: Without dead ends: 750 [2022-04-28 10:19:49,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=589, Invalid=2167, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 10:19:49,550 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 70 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:19:49,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 110 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:19:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states.