/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-de51.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:08:14,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:08:14,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:08:14,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:08:14,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:08:14,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:08:14,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:08:14,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:08:14,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:08:14,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:08:14,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:08:14,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:08:14,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:08:14,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:08:14,434 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:08:14,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:08:14,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:08:14,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:08:14,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:08:14,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:08:14,439 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:08:14,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:08:14,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:08:14,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:08:14,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:08:14,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:08:14,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:08:14,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:08:14,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:08:14,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:08:14,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:08:14,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:08:14,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:08:14,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:08:14,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:08:14,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:08:14,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:08:14,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:08:14,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:08:14,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:08:14,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:08:14,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:08:14,467 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:08:14,475 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:08:14,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:08:14,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:08:14,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:08:14,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:08:14,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:08:14,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:08:14,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:08:14,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:08:14,477 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:08:14,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:08:14,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:08:14,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:08:14,478 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:08:14,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:08:14,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:08:14,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:08:14,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:08:14,478 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:08:14,478 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:08:14,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:08:14,478 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:08:14,479 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:08:14,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:08:14,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:08:14,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:08:14,690 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:08:14,690 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:08:14,691 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-04-28 10:08:14,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918e46741/f90e22df9dc5423ca7b7fc088845014d/FLAG9062dad39 [2022-04-28 10:08:15,106 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:08:15,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-04-28 10:08:15,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918e46741/f90e22df9dc5423ca7b7fc088845014d/FLAG9062dad39 [2022-04-28 10:08:15,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918e46741/f90e22df9dc5423ca7b7fc088845014d [2022-04-28 10:08:15,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:08:15,126 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:08:15,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:08:15,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:08:15,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:08:15,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:08:15" (1/1) ... [2022-04-28 10:08:15,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ac8a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:15, skipping insertion in model container [2022-04-28 10:08:15,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:08:15" (1/1) ... [2022-04-28 10:08:15,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:08:15,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:08:15,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c[368,381] [2022-04-28 10:08:15,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:08:15,330 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:08:15,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c[368,381] [2022-04-28 10:08:15,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:08:15,360 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:08:15,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:15 WrapperNode [2022-04-28 10:08:15,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:08:15,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:08:15,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:08:15,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:08:15,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:15" (1/1) ... [2022-04-28 10:08:15,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:15" (1/1) ... [2022-04-28 10:08:15,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:15" (1/1) ... [2022-04-28 10:08:15,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:15" (1/1) ... [2022-04-28 10:08:15,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:15" (1/1) ... [2022-04-28 10:08:15,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:15" (1/1) ... [2022-04-28 10:08:15,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:15" (1/1) ... [2022-04-28 10:08:15,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:08:15,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:08:15,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:08:15,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:08:15,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:15" (1/1) ... [2022-04-28 10:08:15,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:08:15,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:15,426 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:08:15,444 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:08:15,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:08:15,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:08:15,456 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:08:15,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:08:15,456 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:08:15,456 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:08:15,456 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:08:15,456 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:08:15,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:08:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 10:08:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:08:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:08:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:08:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:08:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:08:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:08:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:08:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:08:15,500 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:08:15,502 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:08:15,730 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:08:15,735 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:08:15,735 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-28 10:08:15,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:08:15 BoogieIcfgContainer [2022-04-28 10:08:15,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:08:15,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:08:15,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:08:15,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:08:15,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:08:15" (1/3) ... [2022-04-28 10:08:15,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5715fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:08:15, skipping insertion in model container [2022-04-28 10:08:15,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:15" (2/3) ... [2022-04-28 10:08:15,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5715fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:08:15, skipping insertion in model container [2022-04-28 10:08:15,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:08:15" (3/3) ... [2022-04-28 10:08:15,754 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de51.c [2022-04-28 10:08:15,763 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:08:15,764 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:08:15,804 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:08:15,808 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@5a1ab467, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1cf92990 [2022-04-28 10:08:15,808 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:08:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:08:15,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:08:15,822 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:15,823 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:08:15,824 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:15,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-04-28 10:08:15,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:15,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1383854487] [2022-04-28 10:08:15,843 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:08:15,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 2 times [2022-04-28 10:08:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:15,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907993080] [2022-04-28 10:08:15,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:15,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:15,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:15,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-28 10:08:15,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 10:08:15,986 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-28 10:08:15,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:15,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-28 10:08:15,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 10:08:15,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-28 10:08:15,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret15 := main(); {27#true} is VALID [2022-04-28 10:08:15,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27#true} is VALID [2022-04-28 10:08:15,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~x~0 % 4294967296 > 0); {27#true} is VALID [2022-04-28 10:08:15,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~z~0 := ~y~0; {27#true} is VALID [2022-04-28 10:08:15,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !(~z~0 % 4294967296 > 0); {27#true} is VALID [2022-04-28 10:08:15,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~y~0 % 4294967296 > 0); {27#true} is VALID [2022-04-28 10:08:15,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-28 10:08:15,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !(~z~0 % 4294967296 > 0); {28#false} is VALID [2022-04-28 10:08:15,990 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-28 10:08:15,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-28 10:08:15,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-28 10:08:15,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 10:08:15,990 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:08:15,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:15,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907993080] [2022-04-28 10:08:15,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907993080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:15,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:15,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:08:15,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:15,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1383854487] [2022-04-28 10:08:15,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1383854487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:15,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:15,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:08:15,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358246315] [2022-04-28 10:08:15,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:15,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:08:15,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:16,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,035 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:08:16,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:08:16,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:16,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:08:16,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:08:16,055 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:16,152 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-28 10:08:16,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:08:16,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:08:16,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-28 10:08:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-28 10:08:16,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-28 10:08:16,233 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:08:16,238 INFO L225 Difference]: With dead ends: 41 [2022-04-28 10:08:16,238 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 10:08:16,240 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:08:16,242 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:16,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 10:08:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 10:08:16,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:16,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,264 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,264 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:16,266 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-28 10:08:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-28 10:08:16,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:16,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:16,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:08:16,267 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:08:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:16,269 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-28 10:08:16,269 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-28 10:08:16,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:16,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:16,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:16,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-04-28 10:08:16,272 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-04-28 10:08:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:16,272 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-04-28 10:08:16,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 21 transitions. [2022-04-28 10:08:16,304 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:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-28 10:08:16,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:08:16,305 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:16,305 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:08:16,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:08:16,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:16,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:16,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-04-28 10:08:16,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:16,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [697788777] [2022-04-28 10:08:16,307 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:08:16,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 2 times [2022-04-28 10:08:16,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:16,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138840001] [2022-04-28 10:08:16,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:16,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:16,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:16,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-28 10:08:16,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-28 10:08:16,474 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-28 10:08:16,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:16,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-28 10:08:16,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-28 10:08:16,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-28 10:08:16,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret15 := main(); {185#true} is VALID [2022-04-28 10:08:16,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:16,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:16,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} ~z~0 := ~y~0; {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:16,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:16,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:16,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:16,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:16,481 INFO L272 TraceCheckUtils]: 12: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {191#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:08:16,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {191#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:08:16,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {186#false} is VALID [2022-04-28 10:08:16,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#false} assume !false; {186#false} is VALID [2022-04-28 10:08:16,482 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:08:16,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:16,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138840001] [2022-04-28 10:08:16,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138840001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:16,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:16,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:08:16,485 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:16,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [697788777] [2022-04-28 10:08:16,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [697788777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:16,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:16,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:08:16,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393167398] [2022-04-28 10:08:16,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:16,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:08:16,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:16,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,502 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:08:16,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:08:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:16,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:08:16,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:08:16,503 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:16,665 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-28 10:08:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:08:16,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:08:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 10:08:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 10:08:16,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-28 10:08:16,713 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:16,716 INFO L225 Difference]: With dead ends: 28 [2022-04-28 10:08:16,717 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:08:16,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:08:16,720 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:16,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 31 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:16,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:08:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 10:08:16,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:16,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,726 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,726 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:16,728 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-28 10:08:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-28 10:08:16,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:16,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:16,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 10:08:16,729 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 10:08:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:16,730 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-28 10:08:16,731 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-28 10:08:16,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:16,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:16,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:16,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-04-28 10:08:16,733 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2022-04-28 10:08:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:16,733 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-04-28 10:08:16,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 31 transitions. [2022-04-28 10:08:16,763 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:08:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-28 10:08:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:08:16,764 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:16,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:16,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:08:16,764 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:16,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:16,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-04-28 10:08:16,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:16,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [178896251] [2022-04-28 10:08:16,766 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:16,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 2 times [2022-04-28 10:08:16,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:16,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50322140] [2022-04-28 10:08:16,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:16,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:16,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:16,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {350#true} is VALID [2022-04-28 10:08:16,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#true} assume true; {350#true} is VALID [2022-04-28 10:08:16,833 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {350#true} {350#true} #83#return; {350#true} is VALID [2022-04-28 10:08:16,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {350#true} call ULTIMATE.init(); {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:16,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {350#true} is VALID [2022-04-28 10:08:16,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#true} assume true; {350#true} is VALID [2022-04-28 10:08:16,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {350#true} {350#true} #83#return; {350#true} is VALID [2022-04-28 10:08:16,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {350#true} call #t~ret15 := main(); {350#true} is VALID [2022-04-28 10:08:16,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {350#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {350#true} is VALID [2022-04-28 10:08:16,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {350#true} assume !(~x~0 % 4294967296 > 0); {350#true} is VALID [2022-04-28 10:08:16,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {350#true} ~z~0 := ~y~0; {350#true} is VALID [2022-04-28 10:08:16,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {350#true} assume !(~z~0 % 4294967296 > 0); {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 10:08:16,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 10:08:16,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 10:08:16,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {351#false} is VALID [2022-04-28 10:08:16,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {351#false} assume !(~z~0 % 4294967296 > 0); {351#false} is VALID [2022-04-28 10:08:16,842 INFO L272 TraceCheckUtils]: 13: Hoare triple {351#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {351#false} is VALID [2022-04-28 10:08:16,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {351#false} ~cond := #in~cond; {351#false} is VALID [2022-04-28 10:08:16,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {351#false} assume 0 == ~cond; {351#false} is VALID [2022-04-28 10:08:16,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {351#false} assume !false; {351#false} is VALID [2022-04-28 10:08:16,843 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:08:16,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:16,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50322140] [2022-04-28 10:08:16,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50322140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:16,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:16,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:08:16,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:16,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [178896251] [2022-04-28 10:08:16,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [178896251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:16,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:16,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:08:16,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087191323] [2022-04-28 10:08:16,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:16,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:08:16,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:16,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,861 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:08:16,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:08:16,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:16,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:08:16,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:08:16,862 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:16,959 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-28 10:08:16,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:08:16,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:08:16,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:16,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-28 10:08:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-28 10:08:16,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-28 10:08:16,987 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:08:16,988 INFO L225 Difference]: With dead ends: 35 [2022-04-28 10:08:16,988 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 10:08:16,988 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:08:16,989 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:16,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 10:08:17,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 10:08:17,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:17,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,011 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,011 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:17,013 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 10:08:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 10:08:17,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:17,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:17,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:08:17,013 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:08:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:17,014 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 10:08:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 10:08:17,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:17,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:17,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:17,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-28 10:08:17,016 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 17 [2022-04-28 10:08:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:17,016 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-28 10:08:17,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-28 10:08:17,051 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:08:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 10:08:17,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:08:17,052 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:17,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:17,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 10:08:17,052 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:17,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:17,052 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-04-28 10:08:17,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:17,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2066103532] [2022-04-28 10:08:17,053 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:17,053 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 2 times [2022-04-28 10:08:17,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:17,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497472455] [2022-04-28 10:08:17,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:17,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:17,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:17,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {543#true} is VALID [2022-04-28 10:08:17,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-28 10:08:17,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {543#true} {543#true} #83#return; {543#true} is VALID [2022-04-28 10:08:17,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {543#true} call ULTIMATE.init(); {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:17,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {543#true} is VALID [2022-04-28 10:08:17,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-28 10:08:17,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {543#true} {543#true} #83#return; {543#true} is VALID [2022-04-28 10:08:17,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {543#true} call #t~ret15 := main(); {543#true} is VALID [2022-04-28 10:08:17,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {543#true} is VALID [2022-04-28 10:08:17,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {543#true} assume !(~x~0 % 4294967296 > 0); {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:17,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:17,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:17,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:17,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {544#false} is VALID [2022-04-28 10:08:17,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#false} assume !(~x~0 % 4294967296 > 0); {544#false} is VALID [2022-04-28 10:08:17,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {544#false} assume !(~z~0 % 4294967296 > 0); {544#false} is VALID [2022-04-28 10:08:17,094 INFO L272 TraceCheckUtils]: 13: Hoare triple {544#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {544#false} is VALID [2022-04-28 10:08:17,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {544#false} ~cond := #in~cond; {544#false} is VALID [2022-04-28 10:08:17,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {544#false} assume 0 == ~cond; {544#false} is VALID [2022-04-28 10:08:17,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {544#false} assume !false; {544#false} is VALID [2022-04-28 10:08:17,095 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:08:17,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:17,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497472455] [2022-04-28 10:08:17,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497472455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:17,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:17,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:08:17,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:17,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2066103532] [2022-04-28 10:08:17,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2066103532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:17,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:17,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:08:17,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271327134] [2022-04-28 10:08:17,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:17,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:08:17,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:17,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,110 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:08:17,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:08:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:17,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:08:17,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:08:17,111 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:17,218 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-04-28 10:08:17,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:08:17,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:08:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 10:08:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 10:08:17,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 10:08:17,256 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:17,257 INFO L225 Difference]: With dead ends: 44 [2022-04-28 10:08:17,257 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 10:08:17,258 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:08:17,258 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:17,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 25 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:17,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 10:08:17,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-28 10:08:17,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:17,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,280 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,280 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:17,282 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-28 10:08:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-28 10:08:17,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:17,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:17,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 10:08:17,283 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 10:08:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:17,284 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-28 10:08:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-28 10:08:17,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:17,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:17,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:17,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-04-28 10:08:17,286 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 17 [2022-04-28 10:08:17,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:17,286 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-04-28 10:08:17,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 44 transitions. [2022-04-28 10:08:17,326 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:08:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2022-04-28 10:08:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:08:17,327 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:17,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:17,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 10:08:17,327 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:17,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:17,328 INFO L85 PathProgramCache]: Analyzing trace with hash -578961840, now seen corresponding path program 1 times [2022-04-28 10:08:17,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:17,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1548352689] [2022-04-28 10:08:17,338 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:17,339 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:17,339 INFO L85 PathProgramCache]: Analyzing trace with hash -578961840, now seen corresponding path program 2 times [2022-04-28 10:08:17,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:17,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783998251] [2022-04-28 10:08:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:17,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:17,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-28 10:08:17,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 10:08:17,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {774#true} {774#true} #83#return; {774#true} is VALID [2022-04-28 10:08:17,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:17,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-28 10:08:17,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 10:08:17,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #83#return; {774#true} is VALID [2022-04-28 10:08:17,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret15 := main(); {774#true} is VALID [2022-04-28 10:08:17,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {779#(= main_~y~0 0)} is VALID [2022-04-28 10:08:17,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {779#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {779#(= main_~y~0 0)} is VALID [2022-04-28 10:08:17,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {779#(= main_~y~0 0)} ~z~0 := ~y~0; {780#(= main_~z~0 0)} is VALID [2022-04-28 10:08:17,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {780#(= 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; {775#false} is VALID [2022-04-28 10:08:17,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {775#false} assume !(~z~0 % 4294967296 > 0); {775#false} is VALID [2022-04-28 10:08:17,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {775#false} assume !(~y~0 % 4294967296 > 0); {775#false} is VALID [2022-04-28 10:08:17,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {775#false} assume !(~x~0 % 4294967296 > 0); {775#false} is VALID [2022-04-28 10:08:17,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {775#false} assume !(~z~0 % 4294967296 > 0); {775#false} is VALID [2022-04-28 10:08:17,395 INFO L272 TraceCheckUtils]: 13: Hoare triple {775#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {775#false} is VALID [2022-04-28 10:08:17,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-28 10:08:17,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-28 10:08:17,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-28 10:08:17,396 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:08:17,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:17,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783998251] [2022-04-28 10:08:17,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783998251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:17,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:17,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:08:17,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:17,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1548352689] [2022-04-28 10:08:17,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1548352689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:17,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:17,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:08:17,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454373676] [2022-04-28 10:08:17,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:17,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:08:17,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:17,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,408 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:08:17,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:08:17,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:17,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:08:17,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:08:17,409 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:17,506 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2022-04-28 10:08:17,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:08:17,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:08:17,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-28 10:08:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-28 10:08:17,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-28 10:08:17,540 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:08:17,541 INFO L225 Difference]: With dead ends: 44 [2022-04-28 10:08:17,541 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 10:08:17,541 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:08:17,542 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:17,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 30 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 10:08:17,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 10:08:17,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:17,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,554 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,554 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:17,555 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2022-04-28 10:08:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-28 10:08:17,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:17,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:17,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 10:08:17,555 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 10:08:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:17,556 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2022-04-28 10:08:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-28 10:08:17,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:17,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:17,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:17,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-04-28 10:08:17,557 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 17 [2022-04-28 10:08:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:17,557 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-04-28 10:08:17,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:17,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 35 transitions. [2022-04-28 10:08:17,585 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:08:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-28 10:08:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:08:17,585 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:17,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:17,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 10:08:17,586 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:17,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:17,586 INFO L85 PathProgramCache]: Analyzing trace with hash 388404751, now seen corresponding path program 1 times [2022-04-28 10:08:17,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:17,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1001948493] [2022-04-28 10:08:17,589 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:17,589 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:17,589 INFO L85 PathProgramCache]: Analyzing trace with hash 388404751, now seen corresponding path program 2 times [2022-04-28 10:08:17,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:17,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243463761] [2022-04-28 10:08:17,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:17,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:17,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:17,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {980#true} is VALID [2022-04-28 10:08:17,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} assume true; {980#true} is VALID [2022-04-28 10:08:17,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {980#true} {980#true} #83#return; {980#true} is VALID [2022-04-28 10:08:17,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {980#true} call ULTIMATE.init(); {988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:17,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {980#true} is VALID [2022-04-28 10:08:17,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} assume true; {980#true} is VALID [2022-04-28 10:08:17,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {980#true} #83#return; {980#true} is VALID [2022-04-28 10:08:17,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {980#true} call #t~ret15 := main(); {980#true} is VALID [2022-04-28 10:08:17,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {980#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {985#(= main_~y~0 0)} is VALID [2022-04-28 10:08:17,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {985#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:17,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:17,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {987#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:17,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {987#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {981#false} is VALID [2022-04-28 10:08:17,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {981#false} assume !(~y~0 % 4294967296 > 0); {981#false} is VALID [2022-04-28 10:08:17,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {981#false} assume !(~x~0 % 4294967296 > 0); {981#false} is VALID [2022-04-28 10:08:17,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {981#false} assume !(~z~0 % 4294967296 > 0); {981#false} is VALID [2022-04-28 10:08:17,667 INFO L272 TraceCheckUtils]: 13: Hoare triple {981#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {981#false} is VALID [2022-04-28 10:08:17,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {981#false} ~cond := #in~cond; {981#false} is VALID [2022-04-28 10:08:17,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {981#false} assume 0 == ~cond; {981#false} is VALID [2022-04-28 10:08:17,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {981#false} assume !false; {981#false} is VALID [2022-04-28 10:08:17,669 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:08:17,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:17,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243463761] [2022-04-28 10:08:17,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243463761] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:17,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361759338] [2022-04-28 10:08:17,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:17,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:17,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:17,677 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:08:17,678 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:08:17,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:17,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:17,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:08:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:17,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:17,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {980#true} call ULTIMATE.init(); {980#true} is VALID [2022-04-28 10:08:17,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {980#true} is VALID [2022-04-28 10:08:17,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} assume true; {980#true} is VALID [2022-04-28 10:08:17,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {980#true} #83#return; {980#true} is VALID [2022-04-28 10:08:17,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {980#true} call #t~ret15 := main(); {980#true} is VALID [2022-04-28 10:08:17,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {980#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {985#(= main_~y~0 0)} is VALID [2022-04-28 10:08:17,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {985#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:17,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:17,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {986#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1016#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:17,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {1016#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {981#false} is VALID [2022-04-28 10:08:17,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {981#false} assume !(~y~0 % 4294967296 > 0); {981#false} is VALID [2022-04-28 10:08:17,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {981#false} assume !(~x~0 % 4294967296 > 0); {981#false} is VALID [2022-04-28 10:08:17,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {981#false} assume !(~z~0 % 4294967296 > 0); {981#false} is VALID [2022-04-28 10:08:17,967 INFO L272 TraceCheckUtils]: 13: Hoare triple {981#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {981#false} is VALID [2022-04-28 10:08:17,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {981#false} ~cond := #in~cond; {981#false} is VALID [2022-04-28 10:08:17,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {981#false} assume 0 == ~cond; {981#false} is VALID [2022-04-28 10:08:17,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {981#false} assume !false; {981#false} is VALID [2022-04-28 10:08:17,968 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:08:17,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:18,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {981#false} assume !false; {981#false} is VALID [2022-04-28 10:08:18,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {981#false} assume 0 == ~cond; {981#false} is VALID [2022-04-28 10:08:18,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {981#false} ~cond := #in~cond; {981#false} is VALID [2022-04-28 10:08:18,071 INFO L272 TraceCheckUtils]: 13: Hoare triple {981#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {981#false} is VALID [2022-04-28 10:08:18,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {981#false} assume !(~z~0 % 4294967296 > 0); {981#false} is VALID [2022-04-28 10:08:18,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {981#false} assume !(~x~0 % 4294967296 > 0); {981#false} is VALID [2022-04-28 10:08:18,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {981#false} assume !(~y~0 % 4294967296 > 0); {981#false} is VALID [2022-04-28 10:08:18,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {1062#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {981#false} is VALID [2022-04-28 10:08:18,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1062#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:18,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {1066#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1066#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:18,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {1073#(< 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; {1066#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:18,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {980#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1073#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:18,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {980#true} call #t~ret15 := main(); {980#true} is VALID [2022-04-28 10:08:18,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {980#true} #83#return; {980#true} is VALID [2022-04-28 10:08:18,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} assume true; {980#true} is VALID [2022-04-28 10:08:18,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {980#true} is VALID [2022-04-28 10:08:18,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {980#true} call ULTIMATE.init(); {980#true} is VALID [2022-04-28 10:08:18,074 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:08:18,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361759338] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:18,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:18,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 10:08:18,075 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:18,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1001948493] [2022-04-28 10:08:18,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1001948493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:18,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:18,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:08:18,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745137244] [2022-04-28 10:08:18,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:18,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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:08:18,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:18,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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:08:18,088 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:08:18,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:08:18,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:18,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:08:18,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:08:18,090 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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:08:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:18,298 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2022-04-28 10:08:18,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:08:18,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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:08:18,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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:08:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-28 10:08:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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:08:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-28 10:08:18,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-28 10:08:18,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:18,341 INFO L225 Difference]: With dead ends: 52 [2022-04-28 10:08:18,341 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 10:08:18,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 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:08:18,342 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:18,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:18,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 10:08:18,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-04-28 10:08:18,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:18,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call 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:18,365 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call 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:18,365 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call 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:18,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:18,366 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-28 10:08:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-04-28 10:08:18,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:18,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:18,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 10:08:18,366 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 10:08:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:18,367 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-28 10:08:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-04-28 10:08:18,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:18,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:18,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:18,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:18,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call 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:18,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-04-28 10:08:18,369 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 17 [2022-04-28 10:08:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:18,369 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-04-28 10:08:18,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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:08:18,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 43 transitions. [2022-04-28 10:08:18,407 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:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-28 10:08:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:08:18,408 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:18,408 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:18,427 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:08:18,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-28 10:08:18,619 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1596703394, now seen corresponding path program 3 times [2022-04-28 10:08:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:18,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1532425495] [2022-04-28 10:08:18,623 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:18,623 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:18,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1596703394, now seen corresponding path program 4 times [2022-04-28 10:08:18,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:18,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743510812] [2022-04-28 10:08:18,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:18,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:18,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:18,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {1353#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1344#true} is VALID [2022-04-28 10:08:18,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {1344#true} assume true; {1344#true} is VALID [2022-04-28 10:08:18,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1344#true} {1344#true} #83#return; {1344#true} is VALID [2022-04-28 10:08:18,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {1344#true} call ULTIMATE.init(); {1353#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:18,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {1353#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1344#true} is VALID [2022-04-28 10:08:18,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {1344#true} assume true; {1344#true} is VALID [2022-04-28 10:08:18,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1344#true} {1344#true} #83#return; {1344#true} is VALID [2022-04-28 10:08:18,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {1344#true} call #t~ret15 := main(); {1344#true} is VALID [2022-04-28 10:08:18,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {1344#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1349#(= main_~y~0 0)} is VALID [2022-04-28 10:08:18,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {1349#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1350#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:18,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {1350#(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; {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:18,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:18,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1352#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:18,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {1352#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-28 10:08:18,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {1345#false} assume !(~y~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-28 10:08:18,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {1345#false} assume !(~x~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-28 10:08:18,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {1345#false} assume !(~z~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-28 10:08:18,734 INFO L272 TraceCheckUtils]: 14: Hoare triple {1345#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1345#false} is VALID [2022-04-28 10:08:18,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {1345#false} ~cond := #in~cond; {1345#false} is VALID [2022-04-28 10:08:18,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {1345#false} assume 0 == ~cond; {1345#false} is VALID [2022-04-28 10:08:18,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {1345#false} assume !false; {1345#false} is VALID [2022-04-28 10:08:18,734 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:08:18,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:18,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743510812] [2022-04-28 10:08:18,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743510812] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:18,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734886413] [2022-04-28 10:08:18,735 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:18,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:18,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:18,736 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:08:18,737 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:08:18,774 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:18,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:18,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:08:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:18,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:18,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {1344#true} call ULTIMATE.init(); {1344#true} is VALID [2022-04-28 10:08:18,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {1344#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1344#true} is VALID [2022-04-28 10:08:18,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {1344#true} assume true; {1344#true} is VALID [2022-04-28 10:08:18,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1344#true} {1344#true} #83#return; {1344#true} is VALID [2022-04-28 10:08:18,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {1344#true} call #t~ret15 := main(); {1344#true} is VALID [2022-04-28 10:08:18,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {1344#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1349#(= main_~y~0 0)} is VALID [2022-04-28 10:08:18,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {1349#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1350#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:18,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {1350#(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; {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:18,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:18,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {1351#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1384#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:18,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {1384#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-28 10:08:18,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {1345#false} assume !(~y~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-28 10:08:18,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {1345#false} assume !(~x~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-28 10:08:18,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {1345#false} assume !(~z~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-28 10:08:18,998 INFO L272 TraceCheckUtils]: 14: Hoare triple {1345#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1345#false} is VALID [2022-04-28 10:08:18,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {1345#false} ~cond := #in~cond; {1345#false} is VALID [2022-04-28 10:08:18,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {1345#false} assume 0 == ~cond; {1345#false} is VALID [2022-04-28 10:08:18,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {1345#false} assume !false; {1345#false} is VALID [2022-04-28 10:08:18,999 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:08:18,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:19,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {1345#false} assume !false; {1345#false} is VALID [2022-04-28 10:08:19,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {1345#false} assume 0 == ~cond; {1345#false} is VALID [2022-04-28 10:08:19,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {1345#false} ~cond := #in~cond; {1345#false} is VALID [2022-04-28 10:08:19,092 INFO L272 TraceCheckUtils]: 14: Hoare triple {1345#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1345#false} is VALID [2022-04-28 10:08:19,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {1345#false} assume !(~z~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-28 10:08:19,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {1345#false} assume !(~x~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-28 10:08:19,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {1345#false} assume !(~y~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-28 10:08:19,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {1430#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1345#false} is VALID [2022-04-28 10:08:19,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {1434#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1430#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:19,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {1434#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1434#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:19,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {1441#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1434#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:19,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {1445#(< 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; {1441#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:19,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {1344#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1445#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:19,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {1344#true} call #t~ret15 := main(); {1344#true} is VALID [2022-04-28 10:08:19,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1344#true} {1344#true} #83#return; {1344#true} is VALID [2022-04-28 10:08:19,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {1344#true} assume true; {1344#true} is VALID [2022-04-28 10:08:19,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {1344#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1344#true} is VALID [2022-04-28 10:08:19,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {1344#true} call ULTIMATE.init(); {1344#true} is VALID [2022-04-28 10:08:19,099 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:08:19,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734886413] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:19,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:19,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 10:08:19,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:19,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1532425495] [2022-04-28 10:08:19,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1532425495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:19,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:19,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:08:19,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412499256] [2022-04-28 10:08:19,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:19,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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:08:19,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:19,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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:08:19,112 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:08:19,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:08:19,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:19,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:08:19,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:08:19,113 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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:08:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:19,421 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2022-04-28 10:08:19,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:08:19,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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:08:19,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:19,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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:08:19,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 10:08:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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:08:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 10:08:19,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-28 10:08:19,474 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:19,475 INFO L225 Difference]: With dead ends: 62 [2022-04-28 10:08:19,475 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 10:08:19,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 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:08:19,476 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 45 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:19,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 48 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 10:08:19,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2022-04-28 10:08:19,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:19,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:19,514 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:19,514 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:19,515 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-04-28 10:08:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-04-28 10:08:19,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:19,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:19,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-28 10:08:19,516 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-28 10:08:19,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:19,517 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-04-28 10:08:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-04-28 10:08:19,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:19,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:19,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:19,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-04-28 10:08:19,518 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 18 [2022-04-28 10:08:19,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:19,519 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-04-28 10:08:19,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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:08:19,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 50 transitions. [2022-04-28 10:08:19,562 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:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-04-28 10:08:19,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:08:19,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:19,562 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:08:19,579 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:08:19,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-04-28 10:08:19,763 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:19,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:19,763 INFO L85 PathProgramCache]: Analyzing trace with hash 9935328, now seen corresponding path program 1 times [2022-04-28 10:08:19,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:19,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [873466239] [2022-04-28 10:08:19,766 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:19,767 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:19,767 INFO L85 PathProgramCache]: Analyzing trace with hash 9935328, now seen corresponding path program 2 times [2022-04-28 10:08:19,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:19,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232804341] [2022-04-28 10:08:19,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:19,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:19,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:19,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {1778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1768#true} is VALID [2022-04-28 10:08:19,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {1768#true} assume true; {1768#true} is VALID [2022-04-28 10:08:19,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1768#true} {1768#true} #83#return; {1768#true} is VALID [2022-04-28 10:08:19,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {1768#true} call ULTIMATE.init(); {1778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:19,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {1778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1768#true} is VALID [2022-04-28 10:08:19,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {1768#true} assume true; {1768#true} is VALID [2022-04-28 10:08:19,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1768#true} {1768#true} #83#return; {1768#true} is VALID [2022-04-28 10:08:19,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {1768#true} call #t~ret15 := main(); {1768#true} is VALID [2022-04-28 10:08:19,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {1768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1773#(= main_~y~0 0)} is VALID [2022-04-28 10:08:19,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {1773#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:19,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {1774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:19,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {1774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1775#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:19,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#(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; {1776#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:19,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {1776#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1776#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:19,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {1776#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1777#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:19,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {1777#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1777#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:19,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {1777#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {1777#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:19,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {1777#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1769#false} is VALID [2022-04-28 10:08:19,842 INFO L272 TraceCheckUtils]: 15: Hoare triple {1769#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1769#false} is VALID [2022-04-28 10:08:19,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {1769#false} ~cond := #in~cond; {1769#false} is VALID [2022-04-28 10:08:19,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {1769#false} assume 0 == ~cond; {1769#false} is VALID [2022-04-28 10:08:19,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {1769#false} assume !false; {1769#false} is VALID [2022-04-28 10:08:19,842 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:08:19,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:19,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232804341] [2022-04-28 10:08:19,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232804341] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:19,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416527653] [2022-04-28 10:08:19,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:19,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:19,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:19,844 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:08:19,871 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:08:19,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:19,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:19,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:08:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:19,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:20,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {1768#true} call ULTIMATE.init(); {1768#true} is VALID [2022-04-28 10:08:20,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {1768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1768#true} is VALID [2022-04-28 10:08:20,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {1768#true} assume true; {1768#true} is VALID [2022-04-28 10:08:20,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1768#true} {1768#true} #83#return; {1768#true} is VALID [2022-04-28 10:08:20,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {1768#true} call #t~ret15 := main(); {1768#true} is VALID [2022-04-28 10:08:20,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {1768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1768#true} is VALID [2022-04-28 10:08:20,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {1768#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:20,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:20,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} ~z~0 := ~y~0; {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:20,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:20,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:20,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:20,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:20,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1769#false} is VALID [2022-04-28 10:08:20,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {1769#false} assume !(~z~0 % 4294967296 > 0); {1769#false} is VALID [2022-04-28 10:08:20,004 INFO L272 TraceCheckUtils]: 15: Hoare triple {1769#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1769#false} is VALID [2022-04-28 10:08:20,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {1769#false} ~cond := #in~cond; {1769#false} is VALID [2022-04-28 10:08:20,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {1769#false} assume 0 == ~cond; {1769#false} is VALID [2022-04-28 10:08:20,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {1769#false} assume !false; {1769#false} is VALID [2022-04-28 10:08:20,005 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:08:20,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:20,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {1769#false} assume !false; {1769#false} is VALID [2022-04-28 10:08:20,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {1769#false} assume 0 == ~cond; {1769#false} is VALID [2022-04-28 10:08:20,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {1769#false} ~cond := #in~cond; {1769#false} is VALID [2022-04-28 10:08:20,075 INFO L272 TraceCheckUtils]: 15: Hoare triple {1769#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1769#false} is VALID [2022-04-28 10:08:20,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {1769#false} assume !(~z~0 % 4294967296 > 0); {1769#false} is VALID [2022-04-28 10:08:20,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1769#false} is VALID [2022-04-28 10:08:20,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:20,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:20,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {1810#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:20,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1810#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:20,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} ~z~0 := ~y~0; {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:20,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:20,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {1768#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1800#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:20,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {1768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1768#true} is VALID [2022-04-28 10:08:20,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {1768#true} call #t~ret15 := main(); {1768#true} is VALID [2022-04-28 10:08:20,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1768#true} {1768#true} #83#return; {1768#true} is VALID [2022-04-28 10:08:20,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {1768#true} assume true; {1768#true} is VALID [2022-04-28 10:08:20,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {1768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1768#true} is VALID [2022-04-28 10:08:20,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {1768#true} call ULTIMATE.init(); {1768#true} is VALID [2022-04-28 10:08:20,078 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:08:20,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416527653] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:20,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:20,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2022-04-28 10:08:20,079 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:20,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [873466239] [2022-04-28 10:08:20,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [873466239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:20,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:20,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:08:20,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125941887] [2022-04-28 10:08:20,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:20,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:20,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:20,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:20,096 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:20,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:08:20,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:20,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:08:20,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:08:20,097 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:20,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:20,486 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2022-04-28 10:08:20,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:08:20,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:20,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-28 10:08:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-28 10:08:20,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 63 transitions. [2022-04-28 10:08:20,537 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:20,538 INFO L225 Difference]: With dead ends: 61 [2022-04-28 10:08:20,538 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 10:08:20,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:08:20,539 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:20,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 43 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:20,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 10:08:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2022-04-28 10:08:20,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:20,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call 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:20,584 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call 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:20,584 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call 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:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:20,586 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-04-28 10:08:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-04-28 10:08:20,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:20,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:20,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 10:08:20,586 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 10:08:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:20,587 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-04-28 10:08:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-04-28 10:08:20,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:20,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:20,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:20,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call 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:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2022-04-28 10:08:20,589 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 19 [2022-04-28 10:08:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:20,589 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2022-04-28 10:08:20,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:20,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 54 transitions. [2022-04-28 10:08:20,638 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:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2022-04-28 10:08:20,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:08:20,639 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:20,639 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:20,663 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:08:20,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:20,847 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:20,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash 399255663, now seen corresponding path program 5 times [2022-04-28 10:08:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:20,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1467502230] [2022-04-28 10:08:20,852 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:20,852 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:20,852 INFO L85 PathProgramCache]: Analyzing trace with hash 399255663, now seen corresponding path program 6 times [2022-04-28 10:08:20,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:20,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705903378] [2022-04-28 10:08:20,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:20,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:20,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:20,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {2226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2216#true} is VALID [2022-04-28 10:08:20,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-04-28 10:08:20,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2216#true} {2216#true} #83#return; {2216#true} is VALID [2022-04-28 10:08:20,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {2216#true} call ULTIMATE.init(); {2226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:20,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {2226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2216#true} is VALID [2022-04-28 10:08:20,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-04-28 10:08:20,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2216#true} {2216#true} #83#return; {2216#true} is VALID [2022-04-28 10:08:20,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {2216#true} call #t~ret15 := main(); {2216#true} is VALID [2022-04-28 10:08:20,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {2216#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2221#(= main_~y~0 0)} is VALID [2022-04-28 10:08:20,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {2221#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2222#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:20,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {2222#(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; {2223#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:20,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {2223#(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; {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:20,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:20,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2225#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:20,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {2225#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-28 10:08:20,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {2217#false} assume !(~y~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-28 10:08:20,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {2217#false} assume !(~x~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-28 10:08:20,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {2217#false} assume !(~z~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-28 10:08:20,944 INFO L272 TraceCheckUtils]: 15: Hoare triple {2217#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2217#false} is VALID [2022-04-28 10:08:20,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {2217#false} ~cond := #in~cond; {2217#false} is VALID [2022-04-28 10:08:20,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {2217#false} assume 0 == ~cond; {2217#false} is VALID [2022-04-28 10:08:20,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {2217#false} assume !false; {2217#false} is VALID [2022-04-28 10:08:20,945 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:08:20,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:20,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705903378] [2022-04-28 10:08:20,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705903378] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:20,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372205783] [2022-04-28 10:08:20,945 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:20,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:20,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:20,946 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:08:20,948 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:08:20,982 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:08:20,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:20,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:08:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:20,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:21,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {2216#true} call ULTIMATE.init(); {2216#true} is VALID [2022-04-28 10:08:21,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {2216#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2216#true} is VALID [2022-04-28 10:08:21,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-04-28 10:08:21,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2216#true} {2216#true} #83#return; {2216#true} is VALID [2022-04-28 10:08:21,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {2216#true} call #t~ret15 := main(); {2216#true} is VALID [2022-04-28 10:08:21,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {2216#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2221#(= main_~y~0 0)} is VALID [2022-04-28 10:08:21,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {2221#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2222#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:21,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {2222#(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; {2223#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:21,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {2223#(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; {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:21,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:21,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {2224#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2260#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:21,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {2260#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-28 10:08:21,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {2217#false} assume !(~y~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-28 10:08:21,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {2217#false} assume !(~x~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-28 10:08:21,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {2217#false} assume !(~z~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-28 10:08:21,154 INFO L272 TraceCheckUtils]: 15: Hoare triple {2217#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2217#false} is VALID [2022-04-28 10:08:21,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {2217#false} ~cond := #in~cond; {2217#false} is VALID [2022-04-28 10:08:21,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {2217#false} assume 0 == ~cond; {2217#false} is VALID [2022-04-28 10:08:21,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {2217#false} assume !false; {2217#false} is VALID [2022-04-28 10:08:21,155 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:08:21,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:21,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {2217#false} assume !false; {2217#false} is VALID [2022-04-28 10:08:21,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {2217#false} assume 0 == ~cond; {2217#false} is VALID [2022-04-28 10:08:21,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {2217#false} ~cond := #in~cond; {2217#false} is VALID [2022-04-28 10:08:21,258 INFO L272 TraceCheckUtils]: 15: Hoare triple {2217#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2217#false} is VALID [2022-04-28 10:08:21,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {2217#false} assume !(~z~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-28 10:08:21,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {2217#false} assume !(~x~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-28 10:08:21,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {2217#false} assume !(~y~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-28 10:08:21,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {2306#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2217#false} is VALID [2022-04-28 10:08:21,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {2310#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {2306#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:21,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {2310#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2310#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:21,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {2317#(< 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; {2310#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:21,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {2321#(< 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; {2317#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:21,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {2325#(< 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; {2321#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:21,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {2216#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2325#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:21,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {2216#true} call #t~ret15 := main(); {2216#true} is VALID [2022-04-28 10:08:21,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2216#true} {2216#true} #83#return; {2216#true} is VALID [2022-04-28 10:08:21,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-04-28 10:08:21,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {2216#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2216#true} is VALID [2022-04-28 10:08:21,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {2216#true} call ULTIMATE.init(); {2216#true} is VALID [2022-04-28 10:08:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:21,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372205783] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:21,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:21,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 10:08:21,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:21,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1467502230] [2022-04-28 10:08:21,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1467502230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:21,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:21,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:08:21,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840400878] [2022-04-28 10:08:21,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:21,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:21,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:21,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:21,275 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:21,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:08:21,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:21,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:08:21,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:08:21,276 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:21,812 INFO L93 Difference]: Finished difference Result 87 states and 124 transitions. [2022-04-28 10:08:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:08:21,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:21,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-28 10:08:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-04-28 10:08:21,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2022-04-28 10:08:21,871 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:08:21,883 INFO L225 Difference]: With dead ends: 87 [2022-04-28 10:08:21,883 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 10:08:21,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 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:08:21,885 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 60 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:08:21,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 60 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:08:21,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 10:08:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2022-04-28 10:08:21,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:21,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 46 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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:21,947 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 46 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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:21,947 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 46 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:21,954 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2022-04-28 10:08:21,954 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2022-04-28 10:08:21,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:21,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:21,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-28 10:08:21,955 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-28 10:08:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:21,956 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2022-04-28 10:08:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2022-04-28 10:08:21,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:21,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:21,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:21,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-04-28 10:08:21,957 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 19 [2022-04-28 10:08:21,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:21,958 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-04-28 10:08:21,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:21,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 61 transitions. [2022-04-28 10:08:22,014 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:08:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-04-28 10:08:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:08:22,014 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:22,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:22,035 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:08:22,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:22,223 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:22,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash 342490275, now seen corresponding path program 1 times [2022-04-28 10:08:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:22,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1092661982] [2022-04-28 10:08:22,226 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:22,226 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:22,226 INFO L85 PathProgramCache]: Analyzing trace with hash 342490275, now seen corresponding path program 2 times [2022-04-28 10:08:22,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:22,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097366906] [2022-04-28 10:08:22,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:22,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:22,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:22,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {2775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2768#true} is VALID [2022-04-28 10:08:22,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {2768#true} assume true; {2768#true} is VALID [2022-04-28 10:08:22,277 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2768#true} {2768#true} #83#return; {2768#true} is VALID [2022-04-28 10:08:22,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {2768#true} call ULTIMATE.init(); {2775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:22,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2768#true} is VALID [2022-04-28 10:08:22,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {2768#true} assume true; {2768#true} is VALID [2022-04-28 10:08:22,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2768#true} {2768#true} #83#return; {2768#true} is VALID [2022-04-28 10:08:22,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {2768#true} call #t~ret15 := main(); {2768#true} is VALID [2022-04-28 10:08:22,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {2768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2768#true} is VALID [2022-04-28 10:08:22,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {2768#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:22,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:22,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:22,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {2773#(<= 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; {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:22,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:22,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {2774#(<= (+ (* 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; {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:22,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:22,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2769#false} is VALID [2022-04-28 10:08:22,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {2769#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2769#false} is VALID [2022-04-28 10:08:22,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {2769#false} assume !(~z~0 % 4294967296 > 0); {2769#false} is VALID [2022-04-28 10:08:22,286 INFO L272 TraceCheckUtils]: 16: Hoare triple {2769#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2769#false} is VALID [2022-04-28 10:08:22,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {2769#false} ~cond := #in~cond; {2769#false} is VALID [2022-04-28 10:08:22,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {2769#false} assume 0 == ~cond; {2769#false} is VALID [2022-04-28 10:08:22,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {2769#false} assume !false; {2769#false} is VALID [2022-04-28 10:08:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:22,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:22,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097366906] [2022-04-28 10:08:22,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097366906] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:22,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141485739] [2022-04-28 10:08:22,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:22,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:22,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:22,288 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:08:22,289 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:08:22,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:22,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:22,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:08:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:22,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:22,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {2768#true} call ULTIMATE.init(); {2768#true} is VALID [2022-04-28 10:08:22,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {2768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2768#true} is VALID [2022-04-28 10:08:22,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {2768#true} assume true; {2768#true} is VALID [2022-04-28 10:08:22,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2768#true} {2768#true} #83#return; {2768#true} is VALID [2022-04-28 10:08:22,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {2768#true} call #t~ret15 := main(); {2768#true} is VALID [2022-04-28 10:08:22,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {2768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2768#true} is VALID [2022-04-28 10:08:22,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {2768#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:22,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:22,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:22,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {2773#(<= 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; {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:22,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:22,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {2774#(<= (+ (* 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; {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:22,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:22,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2769#false} is VALID [2022-04-28 10:08:22,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {2769#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2769#false} is VALID [2022-04-28 10:08:22,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {2769#false} assume !(~z~0 % 4294967296 > 0); {2769#false} is VALID [2022-04-28 10:08:22,551 INFO L272 TraceCheckUtils]: 16: Hoare triple {2769#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2769#false} is VALID [2022-04-28 10:08:22,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {2769#false} ~cond := #in~cond; {2769#false} is VALID [2022-04-28 10:08:22,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {2769#false} assume 0 == ~cond; {2769#false} is VALID [2022-04-28 10:08:22,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {2769#false} assume !false; {2769#false} is VALID [2022-04-28 10:08:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:22,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:22,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {2769#false} assume !false; {2769#false} is VALID [2022-04-28 10:08:22,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {2769#false} assume 0 == ~cond; {2769#false} is VALID [2022-04-28 10:08:22,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {2769#false} ~cond := #in~cond; {2769#false} is VALID [2022-04-28 10:08:22,794 INFO L272 TraceCheckUtils]: 16: Hoare triple {2769#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2769#false} is VALID [2022-04-28 10:08:22,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {2769#false} assume !(~z~0 % 4294967296 > 0); {2769#false} is VALID [2022-04-28 10:08:22,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {2769#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2769#false} is VALID [2022-04-28 10:08:22,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2769#false} is VALID [2022-04-28 10:08:22,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:22,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {2774#(<= (+ (* 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; {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:22,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:22,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {2773#(<= 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; {2774#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:08:22,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:22,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:22,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {2768#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2773#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:22,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {2768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2768#true} is VALID [2022-04-28 10:08:22,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {2768#true} call #t~ret15 := main(); {2768#true} is VALID [2022-04-28 10:08:22,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2768#true} {2768#true} #83#return; {2768#true} is VALID [2022-04-28 10:08:22,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {2768#true} assume true; {2768#true} is VALID [2022-04-28 10:08:22,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {2768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2768#true} is VALID [2022-04-28 10:08:22,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {2768#true} call ULTIMATE.init(); {2768#true} is VALID [2022-04-28 10:08:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:08:22,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141485739] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:22,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:22,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 10:08:22,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:22,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1092661982] [2022-04-28 10:08:22,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1092661982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:22,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:22,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:08:22,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277679698] [2022-04-28 10:08:22,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:22,805 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:22,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:22,805 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:22,820 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:22,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:08:22,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:22,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:08:22,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:08:22,821 INFO L87 Difference]: Start difference. First operand 46 states and 61 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:23,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:23,076 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2022-04-28 10:08:23,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:08:23,076 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:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:23,076 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:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-28 10:08:23,078 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:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-28 10:08:23,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-04-28 10:08:23,119 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:23,120 INFO L225 Difference]: With dead ends: 73 [2022-04-28 10:08:23,120 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 10:08:23,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 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:08:23,120 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:23,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 33 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 10:08:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2022-04-28 10:08:23,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:23,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 58 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:23,205 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 58 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:23,205 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 58 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:23,207 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-04-28 10:08:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2022-04-28 10:08:23,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:23,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:23,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 10:08:23,207 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 10:08:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:23,209 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-04-28 10:08:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2022-04-28 10:08:23,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:23,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:23,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:23,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2022-04-28 10:08:23,210 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 20 [2022-04-28 10:08:23,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:23,210 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2022-04-28 10:08:23,210 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:23,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 78 transitions. [2022-04-28 10:08:23,296 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:08:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2022-04-28 10:08:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:08:23,297 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:23,297 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:23,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:23,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 10:08:23,498 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:23,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:23,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1933081666, now seen corresponding path program 7 times [2022-04-28 10:08:23,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:23,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [264927822] [2022-04-28 10:08:23,500 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:23,500 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1933081666, now seen corresponding path program 8 times [2022-04-28 10:08:23,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:23,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707496166] [2022-04-28 10:08:23,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:23,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:23,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {3302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3291#true} is VALID [2022-04-28 10:08:23,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {3291#true} assume true; {3291#true} is VALID [2022-04-28 10:08:23,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3291#true} {3291#true} #83#return; {3291#true} is VALID [2022-04-28 10:08:23,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {3291#true} call ULTIMATE.init(); {3302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:23,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {3302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3291#true} is VALID [2022-04-28 10:08:23,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {3291#true} assume true; {3291#true} is VALID [2022-04-28 10:08:23,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3291#true} {3291#true} #83#return; {3291#true} is VALID [2022-04-28 10:08:23,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {3291#true} call #t~ret15 := main(); {3291#true} is VALID [2022-04-28 10:08:23,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {3291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3296#(= main_~y~0 0)} is VALID [2022-04-28 10:08:23,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {3296#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:23,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {3297#(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; {3298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:23,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {3298#(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; {3299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:23,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {3299#(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; {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:23,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:23,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3301#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:23,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {3301#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-28 10:08:23,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {3292#false} assume !(~y~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-28 10:08:23,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {3292#false} assume !(~x~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-28 10:08:23,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {3292#false} assume !(~z~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-28 10:08:23,613 INFO L272 TraceCheckUtils]: 16: Hoare triple {3292#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3292#false} is VALID [2022-04-28 10:08:23,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {3292#false} ~cond := #in~cond; {3292#false} is VALID [2022-04-28 10:08:23,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {3292#false} assume 0 == ~cond; {3292#false} is VALID [2022-04-28 10:08:23,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {3292#false} assume !false; {3292#false} is VALID [2022-04-28 10:08:23,613 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:23,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:23,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707496166] [2022-04-28 10:08:23,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707496166] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:23,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31397295] [2022-04-28 10:08:23,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:23,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:23,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:23,615 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:08:23,616 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:08:23,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:23,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:23,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:08:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:23,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:23,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {3291#true} call ULTIMATE.init(); {3291#true} is VALID [2022-04-28 10:08:23,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {3291#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3291#true} is VALID [2022-04-28 10:08:23,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {3291#true} assume true; {3291#true} is VALID [2022-04-28 10:08:23,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3291#true} {3291#true} #83#return; {3291#true} is VALID [2022-04-28 10:08:23,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {3291#true} call #t~ret15 := main(); {3291#true} is VALID [2022-04-28 10:08:23,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {3291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3296#(= main_~y~0 0)} is VALID [2022-04-28 10:08:23,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {3296#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:23,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {3297#(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; {3298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:23,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {3298#(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; {3299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:23,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {3299#(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; {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:23,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:23,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {3300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3339#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:08:23,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {3339#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-28 10:08:23,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {3292#false} assume !(~y~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-28 10:08:23,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {3292#false} assume !(~x~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-28 10:08:23,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {3292#false} assume !(~z~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-28 10:08:23,853 INFO L272 TraceCheckUtils]: 16: Hoare triple {3292#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3292#false} is VALID [2022-04-28 10:08:23,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {3292#false} ~cond := #in~cond; {3292#false} is VALID [2022-04-28 10:08:23,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {3292#false} assume 0 == ~cond; {3292#false} is VALID [2022-04-28 10:08:23,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {3292#false} assume !false; {3292#false} is VALID [2022-04-28 10:08:23,854 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:23,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:23,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {3292#false} assume !false; {3292#false} is VALID [2022-04-28 10:08:23,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {3292#false} assume 0 == ~cond; {3292#false} is VALID [2022-04-28 10:08:23,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {3292#false} ~cond := #in~cond; {3292#false} is VALID [2022-04-28 10:08:23,987 INFO L272 TraceCheckUtils]: 16: Hoare triple {3292#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3292#false} is VALID [2022-04-28 10:08:23,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {3292#false} assume !(~z~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-28 10:08:23,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {3292#false} assume !(~x~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-28 10:08:23,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {3292#false} assume !(~y~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-28 10:08:23,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {3385#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3292#false} is VALID [2022-04-28 10:08:23,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {3389#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {3385#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:23,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {3389#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3389#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:23,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {3396#(< 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; {3389#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:23,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {3400#(< 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; {3396#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:23,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {3404#(< 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; {3400#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:23,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {3408#(< 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; {3404#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:23,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {3291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3408#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:23,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {3291#true} call #t~ret15 := main(); {3291#true} is VALID [2022-04-28 10:08:23,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3291#true} {3291#true} #83#return; {3291#true} is VALID [2022-04-28 10:08:23,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {3291#true} assume true; {3291#true} is VALID [2022-04-28 10:08:23,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {3291#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3291#true} is VALID [2022-04-28 10:08:23,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {3291#true} call ULTIMATE.init(); {3291#true} is VALID [2022-04-28 10:08:23,992 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:23,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31397295] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:23,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:23,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 10:08:23,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:23,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [264927822] [2022-04-28 10:08:23,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [264927822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:23,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:23,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:08:23,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197254800] [2022-04-28 10:08:23,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:23,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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:23,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:23,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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:24,010 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:24,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:08:24,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:24,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:08:24,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:08:24,011 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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:24,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:24,851 INFO L93 Difference]: Finished difference Result 118 states and 172 transitions. [2022-04-28 10:08:24,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:08:24,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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:24,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-28 10:08:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-28 10:08:24,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 89 transitions. [2022-04-28 10:08:24,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:24,934 INFO L225 Difference]: With dead ends: 118 [2022-04-28 10:08:24,934 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 10:08:24,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 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:24,935 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 70 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:24,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 72 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:08:24,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 10:08:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 65. [2022-04-28 10:08:25,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:25,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call 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:25,067 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call 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:25,067 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call 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:25,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:25,068 INFO L93 Difference]: Finished difference Result 101 states and 138 transitions. [2022-04-28 10:08:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 138 transitions. [2022-04-28 10:08:25,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:25,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:25,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-28 10:08:25,069 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-28 10:08:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:25,070 INFO L93 Difference]: Finished difference Result 101 states and 138 transitions. [2022-04-28 10:08:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 138 transitions. [2022-04-28 10:08:25,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:25,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:25,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:25,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call 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:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2022-04-28 10:08:25,071 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 20 [2022-04-28 10:08:25,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:25,072 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2022-04-28 10:08:25,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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:25,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 88 transitions. [2022-04-28 10:08:25,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2022-04-28 10:08:25,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:08:25,179 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:25,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:25,197 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:25,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:25,380 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:25,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:25,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 1 times [2022-04-28 10:08:25,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:25,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1952155953] [2022-04-28 10:08:25,382 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:25,382 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:25,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 2 times [2022-04-28 10:08:25,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:25,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51245006] [2022-04-28 10:08:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:25,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:25,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:25,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {4021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4009#true} is VALID [2022-04-28 10:08:25,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {4009#true} assume true; {4009#true} is VALID [2022-04-28 10:08:25,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4009#true} {4009#true} #83#return; {4009#true} is VALID [2022-04-28 10:08:25,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {4009#true} call ULTIMATE.init(); {4021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:25,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {4021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4009#true} is VALID [2022-04-28 10:08:25,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {4009#true} assume true; {4009#true} is VALID [2022-04-28 10:08:25,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4009#true} {4009#true} #83#return; {4009#true} is VALID [2022-04-28 10:08:25,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {4009#true} call #t~ret15 := main(); {4009#true} is VALID [2022-04-28 10:08:25,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {4009#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:25,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-28 10:08:25,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-28 10:08:25,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} ~z~0 := ~y~0; {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-28 10:08:25,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-28 10:08:25,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-28 10:08:25,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-28 10:08:25,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} assume !(~y~0 % 4294967296 > 0); {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-28 10:08:25,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {4017#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-28 10:08:25,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-28 10:08:25,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {4016#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:25,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:25,550 INFO L272 TraceCheckUtils]: 17: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4019#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:08:25,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {4019#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4020#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:08:25,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {4020#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4010#false} is VALID [2022-04-28 10:08:25,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {4010#false} assume !false; {4010#false} is VALID [2022-04-28 10:08:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:08:25,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:25,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51245006] [2022-04-28 10:08:25,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51245006] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:25,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257859103] [2022-04-28 10:08:25,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:25,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:25,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:25,572 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:25,573 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:25,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:25,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:25,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:08:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:25,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:25,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {4009#true} call ULTIMATE.init(); {4009#true} is VALID [2022-04-28 10:08:25,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {4009#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4009#true} is VALID [2022-04-28 10:08:25,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {4009#true} assume true; {4009#true} is VALID [2022-04-28 10:08:25,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4009#true} {4009#true} #83#return; {4009#true} is VALID [2022-04-28 10:08:25,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {4009#true} call #t~ret15 := main(); {4009#true} is VALID [2022-04-28 10:08:25,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {4009#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:25,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-28 10:08:25,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-28 10:08:25,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} ~z~0 := ~y~0; {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-28 10:08:25,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:25,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:25,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:25,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:25,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-28 10:08:25,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-28 10:08:25,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {4015#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:25,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:25,707 INFO L272 TraceCheckUtils]: 17: Hoare triple {4014#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4076#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:25,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {4076#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4080#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:25,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {4080#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4010#false} is VALID [2022-04-28 10:08:25,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {4010#false} assume !false; {4010#false} is VALID [2022-04-28 10:08:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:08:25,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:25,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {4010#false} assume !false; {4010#false} is VALID [2022-04-28 10:08:25,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {4080#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4010#false} is VALID [2022-04-28 10:08:25,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {4076#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4080#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:25,877 INFO L272 TraceCheckUtils]: 17: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4076#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:25,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:25,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:25,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:25,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:25,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:25,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:25,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:25,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:25,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} ~z~0 := ~y~0; {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:25,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:25,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4102#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:25,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {4009#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4018#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:25,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {4009#true} call #t~ret15 := main(); {4009#true} is VALID [2022-04-28 10:08:25,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4009#true} {4009#true} #83#return; {4009#true} is VALID [2022-04-28 10:08:25,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {4009#true} assume true; {4009#true} is VALID [2022-04-28 10:08:25,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {4009#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4009#true} is VALID [2022-04-28 10:08:25,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {4009#true} call ULTIMATE.init(); {4009#true} is VALID [2022-04-28 10:08:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:08:25,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257859103] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:25,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:25,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 13 [2022-04-28 10:08:25,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:25,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1952155953] [2022-04-28 10:08:25,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1952155953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:25,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:25,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:08:25,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604941371] [2022-04-28 10:08:25,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:25,885 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) 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 21 [2022-04-28 10:08:25,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:25,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) 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:25,901 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:25,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:08:25,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:25,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:08:25,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:08:25,902 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand has 10 states, 10 states have (on average 1.7) 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:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:26,280 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-04-28 10:08:26,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:08:26,280 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) 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 21 [2022-04-28 10:08:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) 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:26,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2022-04-28 10:08:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) 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:26,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2022-04-28 10:08:26,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 45 transitions. [2022-04-28 10:08:26,316 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:26,317 INFO L225 Difference]: With dead ends: 77 [2022-04-28 10:08:26,317 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 10:08:26,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:08:26,318 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:26,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 36 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:26,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 10:08:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 10:08:26,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:26,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:26,403 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:26,403 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:26,404 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-04-28 10:08:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2022-04-28 10:08:26,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:26,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:26,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 10:08:26,405 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 10:08:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:26,405 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-04-28 10:08:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2022-04-28 10:08:26,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:26,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:26,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:26,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2022-04-28 10:08:26,407 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 21 [2022-04-28 10:08:26,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:26,407 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2022-04-28 10:08:26,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) 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:26,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 78 transitions. [2022-04-28 10:08:26,487 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:08:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2022-04-28 10:08:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:08:26,488 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:26,488 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:26,504 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:26,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:26,688 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:26,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:26,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2057919793, now seen corresponding path program 9 times [2022-04-28 10:08:26,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:26,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1081858059] [2022-04-28 10:08:26,691 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:26,691 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:26,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2057919793, now seen corresponding path program 10 times [2022-04-28 10:08:26,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:26,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181700188] [2022-04-28 10:08:26,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:26,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:26,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:26,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {4556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4544#true} is VALID [2022-04-28 10:08:26,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {4544#true} assume true; {4544#true} is VALID [2022-04-28 10:08:26,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4544#true} {4544#true} #83#return; {4544#true} is VALID [2022-04-28 10:08:26,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {4544#true} call ULTIMATE.init(); {4556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:26,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {4556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4544#true} is VALID [2022-04-28 10:08:26,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {4544#true} assume true; {4544#true} is VALID [2022-04-28 10:08:26,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4544#true} {4544#true} #83#return; {4544#true} is VALID [2022-04-28 10:08:26,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {4544#true} call #t~ret15 := main(); {4544#true} is VALID [2022-04-28 10:08:26,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {4544#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4549#(= main_~y~0 0)} is VALID [2022-04-28 10:08:26,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {4549#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4550#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:26,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {4550#(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; {4551#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:26,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {4551#(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; {4552#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:26,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {4552#(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; {4553#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:26,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {4553#(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; {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:26,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:26,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4555#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:26,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {4555#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {4545#false} is VALID [2022-04-28 10:08:26,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {4545#false} assume !(~y~0 % 4294967296 > 0); {4545#false} is VALID [2022-04-28 10:08:26,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {4545#false} assume !(~x~0 % 4294967296 > 0); {4545#false} is VALID [2022-04-28 10:08:26,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {4545#false} assume !(~z~0 % 4294967296 > 0); {4545#false} is VALID [2022-04-28 10:08:26,808 INFO L272 TraceCheckUtils]: 17: Hoare triple {4545#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4545#false} is VALID [2022-04-28 10:08:26,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {4545#false} ~cond := #in~cond; {4545#false} is VALID [2022-04-28 10:08:26,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {4545#false} assume 0 == ~cond; {4545#false} is VALID [2022-04-28 10:08:26,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {4545#false} assume !false; {4545#false} is VALID [2022-04-28 10:08:26,808 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:26,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:26,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181700188] [2022-04-28 10:08:26,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181700188] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:26,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42679672] [2022-04-28 10:08:26,809 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:26,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:26,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:26,810 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:26,811 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:26,839 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:26,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:26,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:08:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:26,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:27,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {4544#true} call ULTIMATE.init(); {4544#true} is VALID [2022-04-28 10:08:27,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {4544#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4544#true} is VALID [2022-04-28 10:08:27,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {4544#true} assume true; {4544#true} is VALID [2022-04-28 10:08:27,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4544#true} {4544#true} #83#return; {4544#true} is VALID [2022-04-28 10:08:27,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {4544#true} call #t~ret15 := main(); {4544#true} is VALID [2022-04-28 10:08:27,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {4544#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4549#(= main_~y~0 0)} is VALID [2022-04-28 10:08:27,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {4549#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4550#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:27,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {4550#(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; {4551#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:27,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {4551#(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; {4552#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:27,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {4552#(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; {4553#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:27,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {4553#(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; {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:27,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:27,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {4554#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:27,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:27,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:27,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:27,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {4596#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4545#false} is VALID [2022-04-28 10:08:27,053 INFO L272 TraceCheckUtils]: 17: Hoare triple {4545#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4545#false} is VALID [2022-04-28 10:08:27,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {4545#false} ~cond := #in~cond; {4545#false} is VALID [2022-04-28 10:08:27,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {4545#false} assume 0 == ~cond; {4545#false} is VALID [2022-04-28 10:08:27,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {4545#false} assume !false; {4545#false} is VALID [2022-04-28 10:08:27,053 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:27,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:27,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {4545#false} assume !false; {4545#false} is VALID [2022-04-28 10:08:27,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {4545#false} assume 0 == ~cond; {4545#false} is VALID [2022-04-28 10:08:27,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {4545#false} ~cond := #in~cond; {4545#false} is VALID [2022-04-28 10:08:27,222 INFO L272 TraceCheckUtils]: 17: Hoare triple {4545#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4545#false} is VALID [2022-04-28 10:08:27,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {4633#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4545#false} is VALID [2022-04-28 10:08:27,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {4633#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4633#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:27,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {4633#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4633#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:27,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {4633#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4633#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:27,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {4646#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {4633#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:27,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {4646#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4646#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:27,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {4653#(< 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; {4646#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:27,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {4657#(< 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; {4653#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:27,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {4661#(< 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; {4657#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:27,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {4665#(< 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; {4661#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:27,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {4669#(< 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; {4665#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:27,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {4544#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4669#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:27,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {4544#true} call #t~ret15 := main(); {4544#true} is VALID [2022-04-28 10:08:27,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4544#true} {4544#true} #83#return; {4544#true} is VALID [2022-04-28 10:08:27,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {4544#true} assume true; {4544#true} is VALID [2022-04-28 10:08:27,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {4544#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4544#true} is VALID [2022-04-28 10:08:27,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {4544#true} call ULTIMATE.init(); {4544#true} is VALID [2022-04-28 10:08:27,227 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:27,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42679672] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:27,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:27,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 10:08:27,227 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:27,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1081858059] [2022-04-28 10:08:27,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1081858059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:27,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:27,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:08:27,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427121632] [2022-04-28 10:08:27,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:27,228 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 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:27,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:27,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 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:27,248 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:27,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:08:27,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:27,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:08:27,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:08:27,249 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 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:28,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:28,181 INFO L93 Difference]: Finished difference Result 110 states and 165 transitions. [2022-04-28 10:08:28,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:08:28,181 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 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:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 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:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-28 10:08:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 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:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-28 10:08:28,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2022-04-28 10:08:28,263 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:08:28,265 INFO L225 Difference]: With dead ends: 110 [2022-04-28 10:08:28,265 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 10:08:28,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 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:28,266 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 73 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:28,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 81 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:08:28,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 10:08:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 64. [2022-04-28 10:08:28,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:28,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 64 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call 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:28,367 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 64 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call 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:28,367 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 64 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call 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:28,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:28,368 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2022-04-28 10:08:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2022-04-28 10:08:28,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:28,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:28,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 3 states have call successors, (3), 3 states 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:28,369 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 3 states have call successors, (3), 3 states 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:28,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:28,370 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2022-04-28 10:08:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2022-04-28 10:08:28,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:28,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:28,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:28,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call 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:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2022-04-28 10:08:28,371 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 21 [2022-04-28 10:08:28,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:28,372 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2022-04-28 10:08:28,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 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:28,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 88 transitions. [2022-04-28 10:08:28,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2022-04-28 10:08:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:08:28,478 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:28,478 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:28,495 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:28,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 10:08:28,690 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:28,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:28,691 INFO L85 PathProgramCache]: Analyzing trace with hash 38994402, now seen corresponding path program 1 times [2022-04-28 10:08:28,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:28,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2040295003] [2022-04-28 10:08:28,696 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:28,696 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:28,696 INFO L85 PathProgramCache]: Analyzing trace with hash 38994402, now seen corresponding path program 2 times [2022-04-28 10:08:28,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:28,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835811620] [2022-04-28 10:08:28,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:28,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:28,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {5248#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5238#true} is VALID [2022-04-28 10:08:28,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {5238#true} assume true; {5238#true} is VALID [2022-04-28 10:08:28,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5238#true} {5238#true} #83#return; {5238#true} is VALID [2022-04-28 10:08:28,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {5238#true} call ULTIMATE.init(); {5248#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:28,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {5248#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5238#true} is VALID [2022-04-28 10:08:28,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {5238#true} assume true; {5238#true} is VALID [2022-04-28 10:08:28,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5238#true} {5238#true} #83#return; {5238#true} is VALID [2022-04-28 10:08:28,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {5238#true} call #t~ret15 := main(); {5238#true} is VALID [2022-04-28 10:08:28,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {5238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5243#(= main_~y~0 0)} is VALID [2022-04-28 10:08:28,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {5243#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5244#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:28,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {5244#(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; {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:28,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:28,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {5246#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:28,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {5246#(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; {5247#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:28,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {5247#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-28 10:08:28,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {5239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5239#false} is VALID [2022-04-28 10:08:28,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {5239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5239#false} is VALID [2022-04-28 10:08:28,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {5239#false} assume !(~y~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-28 10:08:28,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {5239#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5239#false} is VALID [2022-04-28 10:08:28,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {5239#false} assume !(~x~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-28 10:08:28,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {5239#false} assume !(~z~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-28 10:08:28,789 INFO L272 TraceCheckUtils]: 18: Hoare triple {5239#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5239#false} is VALID [2022-04-28 10:08:28,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {5239#false} ~cond := #in~cond; {5239#false} is VALID [2022-04-28 10:08:28,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {5239#false} assume 0 == ~cond; {5239#false} is VALID [2022-04-28 10:08:28,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {5239#false} assume !false; {5239#false} is VALID [2022-04-28 10:08:28,790 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:28,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:28,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835811620] [2022-04-28 10:08:28,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835811620] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:28,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869409424] [2022-04-28 10:08:28,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:28,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:28,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:28,791 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:28,795 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:28,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:28,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:28,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:08:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:28,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:28,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {5238#true} call ULTIMATE.init(); {5238#true} is VALID [2022-04-28 10:08:28,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {5238#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5238#true} is VALID [2022-04-28 10:08:28,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {5238#true} assume true; {5238#true} is VALID [2022-04-28 10:08:28,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5238#true} {5238#true} #83#return; {5238#true} is VALID [2022-04-28 10:08:28,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {5238#true} call #t~ret15 := main(); {5238#true} is VALID [2022-04-28 10:08:28,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {5238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5243#(= main_~y~0 0)} is VALID [2022-04-28 10:08:28,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {5243#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5244#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:28,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {5244#(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; {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:28,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:28,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {5245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {5279#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:28,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {5279#(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; {5283#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:28,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {5283#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-28 10:08:28,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {5239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5239#false} is VALID [2022-04-28 10:08:28,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {5239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5239#false} is VALID [2022-04-28 10:08:28,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {5239#false} assume !(~y~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-28 10:08:28,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {5239#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5239#false} is VALID [2022-04-28 10:08:28,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {5239#false} assume !(~x~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-28 10:08:28,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {5239#false} assume !(~z~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-28 10:08:28,958 INFO L272 TraceCheckUtils]: 18: Hoare triple {5239#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5239#false} is VALID [2022-04-28 10:08:28,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {5239#false} ~cond := #in~cond; {5239#false} is VALID [2022-04-28 10:08:28,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {5239#false} assume 0 == ~cond; {5239#false} is VALID [2022-04-28 10:08:28,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {5239#false} assume !false; {5239#false} is VALID [2022-04-28 10:08:28,959 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:28,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:29,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {5239#false} assume !false; {5239#false} is VALID [2022-04-28 10:08:29,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {5239#false} assume 0 == ~cond; {5239#false} is VALID [2022-04-28 10:08:29,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {5239#false} ~cond := #in~cond; {5239#false} is VALID [2022-04-28 10:08:29,081 INFO L272 TraceCheckUtils]: 18: Hoare triple {5239#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5239#false} is VALID [2022-04-28 10:08:29,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {5239#false} assume !(~z~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-28 10:08:29,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {5239#false} assume !(~x~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-28 10:08:29,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {5239#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5239#false} is VALID [2022-04-28 10:08:29,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {5239#false} assume !(~y~0 % 4294967296 > 0); {5239#false} is VALID [2022-04-28 10:08:29,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {5341#(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; {5239#false} is VALID [2022-04-28 10:08:29,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {5345#(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; {5341#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:29,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {5349#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5345#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:29,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {5353#(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; {5349#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:08:29,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {5238#true} ~z~0 := ~y~0; {5353#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:08:29,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {5238#true} assume !(~x~0 % 4294967296 > 0); {5238#true} is VALID [2022-04-28 10:08:29,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {5238#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5238#true} is VALID [2022-04-28 10:08:29,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {5238#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5238#true} is VALID [2022-04-28 10:08:29,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {5238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5238#true} is VALID [2022-04-28 10:08:29,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {5238#true} call #t~ret15 := main(); {5238#true} is VALID [2022-04-28 10:08:29,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5238#true} {5238#true} #83#return; {5238#true} is VALID [2022-04-28 10:08:29,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {5238#true} assume true; {5238#true} is VALID [2022-04-28 10:08:29,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {5238#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5238#true} is VALID [2022-04-28 10:08:29,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {5238#true} call ULTIMATE.init(); {5238#true} is VALID [2022-04-28 10:08:29,084 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:29,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869409424] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:29,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:29,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-04-28 10:08:29,085 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:29,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2040295003] [2022-04-28 10:08:29,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2040295003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:29,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:29,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:08:29,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359735432] [2022-04-28 10:08:29,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:29,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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:29,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:29,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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:29,101 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:29,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:08:29,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:29,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:08:29,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:08:29,102 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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:29,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:29,571 INFO L93 Difference]: Finished difference Result 87 states and 118 transitions. [2022-04-28 10:08:29,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:08:29,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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:29,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-04-28 10:08:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-04-28 10:08:29,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2022-04-28 10:08:29,616 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:08:29,617 INFO L225 Difference]: With dead ends: 87 [2022-04-28 10:08:29,617 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 10:08:29,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:08:29,618 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:29,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 50 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 10:08:29,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2022-04-28 10:08:29,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:29,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:29,707 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:29,707 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:29,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:29,708 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2022-04-28 10:08:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 105 transitions. [2022-04-28 10:08:29,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:29,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:29,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 10:08:29,709 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 10:08:29,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:29,710 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2022-04-28 10:08:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 105 transitions. [2022-04-28 10:08:29,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:29,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:29,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:29,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2022-04-28 10:08:29,711 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 22 [2022-04-28 10:08:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:29,711 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2022-04-28 10:08:29,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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:29,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 87 transitions. [2022-04-28 10:08:29,805 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:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2022-04-28 10:08:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:08:29,805 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:29,805 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:29,821 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:30,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 10:08:30,011 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:30,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash -462225342, now seen corresponding path program 3 times [2022-04-28 10:08:30,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:30,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2005474571] [2022-04-28 10:08:30,016 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:30,016 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:30,016 INFO L85 PathProgramCache]: Analyzing trace with hash -462225342, now seen corresponding path program 4 times [2022-04-28 10:08:30,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:30,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637263643] [2022-04-28 10:08:30,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:30,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:30,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:30,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {5862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5850#true} is VALID [2022-04-28 10:08:30,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {5850#true} assume true; {5850#true} is VALID [2022-04-28 10:08:30,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5850#true} {5850#true} #83#return; {5850#true} is VALID [2022-04-28 10:08:30,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {5850#true} call ULTIMATE.init(); {5862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:30,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {5862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5850#true} is VALID [2022-04-28 10:08:30,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {5850#true} assume true; {5850#true} is VALID [2022-04-28 10:08:30,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5850#true} {5850#true} #83#return; {5850#true} is VALID [2022-04-28 10:08:30,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {5850#true} call #t~ret15 := main(); {5850#true} is VALID [2022-04-28 10:08:30,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {5850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5855#(= main_~y~0 0)} is VALID [2022-04-28 10:08:30,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {5855#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:30,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {5856#(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; {5857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:30,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {5857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {5857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:30,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {5857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {5858#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:30,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {5858#(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; {5859#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:30,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {5859#(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; {5860#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:30,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {5860#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5860#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:30,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {5860#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5859#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:30,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {5859#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5861#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:30,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {5861#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {5861#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:30,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {5861#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {5861#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:30,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {5861#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5851#false} is VALID [2022-04-28 10:08:30,124 INFO L272 TraceCheckUtils]: 18: Hoare triple {5851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5851#false} is VALID [2022-04-28 10:08:30,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {5851#false} ~cond := #in~cond; {5851#false} is VALID [2022-04-28 10:08:30,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {5851#false} assume 0 == ~cond; {5851#false} is VALID [2022-04-28 10:08:30,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {5851#false} assume !false; {5851#false} is VALID [2022-04-28 10:08:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:30,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:30,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637263643] [2022-04-28 10:08:30,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637263643] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:30,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863803587] [2022-04-28 10:08:30,125 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:30,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:30,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:30,126 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:30,147 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:30,163 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:30,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:30,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:08:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:30,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:30,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {5850#true} call ULTIMATE.init(); {5850#true} is VALID [2022-04-28 10:08:30,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {5850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5850#true} is VALID [2022-04-28 10:08:30,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {5850#true} assume true; {5850#true} is VALID [2022-04-28 10:08:30,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5850#true} {5850#true} #83#return; {5850#true} is VALID [2022-04-28 10:08:30,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {5850#true} call #t~ret15 := main(); {5850#true} is VALID [2022-04-28 10:08:30,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {5850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5850#true} is VALID [2022-04-28 10:08:30,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {5850#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:30,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:30,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:30,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:30,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:30,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:30,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:30,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:30,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:30,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:30,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5851#false} is VALID [2022-04-28 10:08:30,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {5851#false} assume !(~z~0 % 4294967296 > 0); {5851#false} is VALID [2022-04-28 10:08:30,268 INFO L272 TraceCheckUtils]: 18: Hoare triple {5851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5851#false} is VALID [2022-04-28 10:08:30,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {5851#false} ~cond := #in~cond; {5851#false} is VALID [2022-04-28 10:08:30,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {5851#false} assume 0 == ~cond; {5851#false} is VALID [2022-04-28 10:08:30,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {5851#false} assume !false; {5851#false} is VALID [2022-04-28 10:08:30,268 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:30,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:30,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {5851#false} assume !false; {5851#false} is VALID [2022-04-28 10:08:30,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {5851#false} assume 0 == ~cond; {5851#false} is VALID [2022-04-28 10:08:30,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {5851#false} ~cond := #in~cond; {5851#false} is VALID [2022-04-28 10:08:30,331 INFO L272 TraceCheckUtils]: 18: Hoare triple {5851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5851#false} is VALID [2022-04-28 10:08:30,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {5851#false} assume !(~z~0 % 4294967296 > 0); {5851#false} is VALID [2022-04-28 10:08:30,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5851#false} is VALID [2022-04-28 10:08:30,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:30,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:30,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:30,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {5901#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:30,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5901#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:30,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:30,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:30,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:30,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5888#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:30,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {5850#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5884#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:30,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {5850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5850#true} is VALID [2022-04-28 10:08:30,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {5850#true} call #t~ret15 := main(); {5850#true} is VALID [2022-04-28 10:08:30,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5850#true} {5850#true} #83#return; {5850#true} is VALID [2022-04-28 10:08:30,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {5850#true} assume true; {5850#true} is VALID [2022-04-28 10:08:30,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {5850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5850#true} is VALID [2022-04-28 10:08:30,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {5850#true} call ULTIMATE.init(); {5850#true} is VALID [2022-04-28 10:08:30,344 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:30,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863803587] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:30,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:30,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2022-04-28 10:08:30,344 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:30,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2005474571] [2022-04-28 10:08:30,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2005474571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:30,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:30,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:08:30,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258024070] [2022-04-28 10:08:30,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:30,345 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 22 [2022-04-28 10:08:30,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:30,345 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:30,359 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:30,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:08:30,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:30,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:08:30,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:08:30,359 INFO L87 Difference]: Start difference. First operand 64 states and 87 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:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:31,168 INFO L93 Difference]: Finished difference Result 98 states and 139 transitions. [2022-04-28 10:08:31,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:08:31,168 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 22 [2022-04-28 10:08:31,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:31,168 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:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 81 transitions. [2022-04-28 10:08:31,169 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:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 81 transitions. [2022-04-28 10:08:31,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 81 transitions. [2022-04-28 10:08:31,234 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:08:31,235 INFO L225 Difference]: With dead ends: 98 [2022-04-28 10:08:31,235 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 10:08:31,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:08:31,236 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:31,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 50 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:08:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 10:08:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2022-04-28 10:08:31,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:31,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 70 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call 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:31,350 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 70 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call 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:31,350 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 70 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call 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:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:31,351 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2022-04-28 10:08:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2022-04-28 10:08:31,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:31,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:31,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-28 10:08:31,352 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-28 10:08:31,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:31,353 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2022-04-28 10:08:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2022-04-28 10:08:31,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:31,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:31,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:31,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call 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:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2022-04-28 10:08:31,354 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 22 [2022-04-28 10:08:31,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:31,354 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2022-04-28 10:08:31,354 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:31,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 93 transitions. [2022-04-28 10:08:31,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:31,458 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2022-04-28 10:08:31,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:08:31,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:31,458 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:31,476 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:31,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 10:08:31,659 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:31,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1224913438, now seen corresponding path program 11 times [2022-04-28 10:08:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:31,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [601904443] [2022-04-28 10:08:31,662 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:31,662 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:31,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1224913438, now seen corresponding path program 12 times [2022-04-28 10:08:31,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:31,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694156562] [2022-04-28 10:08:31,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:31,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:31,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:31,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {6550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6537#true} is VALID [2022-04-28 10:08:31,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {6537#true} assume true; {6537#true} is VALID [2022-04-28 10:08:31,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6537#true} {6537#true} #83#return; {6537#true} is VALID [2022-04-28 10:08:31,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {6537#true} call ULTIMATE.init(); {6550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:31,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {6550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6537#true} is VALID [2022-04-28 10:08:31,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {6537#true} assume true; {6537#true} is VALID [2022-04-28 10:08:31,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6537#true} {6537#true} #83#return; {6537#true} is VALID [2022-04-28 10:08:31,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {6537#true} call #t~ret15 := main(); {6537#true} is VALID [2022-04-28 10:08:31,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {6537#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6542#(= main_~y~0 0)} is VALID [2022-04-28 10:08:31,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {6542#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:31,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {6543#(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; {6544#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:31,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {6544#(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; {6545#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:31,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {6545#(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; {6546#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:31,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {6546#(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; {6547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:31,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {6547#(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; {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:31,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:31,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {6549#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:31,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {6549#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-28 10:08:31,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {6538#false} assume !(~y~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-28 10:08:31,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {6538#false} assume !(~x~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-28 10:08:31,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {6538#false} assume !(~z~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-28 10:08:31,789 INFO L272 TraceCheckUtils]: 18: Hoare triple {6538#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6538#false} is VALID [2022-04-28 10:08:31,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {6538#false} ~cond := #in~cond; {6538#false} is VALID [2022-04-28 10:08:31,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {6538#false} assume 0 == ~cond; {6538#false} is VALID [2022-04-28 10:08:31,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {6538#false} assume !false; {6538#false} is VALID [2022-04-28 10:08:31,789 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:31,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:31,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694156562] [2022-04-28 10:08:31,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694156562] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:31,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943459372] [2022-04-28 10:08:31,790 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:31,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:31,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:31,804 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:31,805 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:31,842 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:08:31,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:31,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:08:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:31,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:32,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {6537#true} call ULTIMATE.init(); {6537#true} is VALID [2022-04-28 10:08:32,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {6537#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6537#true} is VALID [2022-04-28 10:08:32,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {6537#true} assume true; {6537#true} is VALID [2022-04-28 10:08:32,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6537#true} {6537#true} #83#return; {6537#true} is VALID [2022-04-28 10:08:32,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {6537#true} call #t~ret15 := main(); {6537#true} is VALID [2022-04-28 10:08:32,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {6537#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6542#(= main_~y~0 0)} is VALID [2022-04-28 10:08:32,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {6542#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:32,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {6543#(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; {6544#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:32,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {6544#(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; {6545#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:32,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {6545#(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; {6546#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:32,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {6546#(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; {6547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:32,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {6547#(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; {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:32,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:32,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {6548#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {6593#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:32,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {6593#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-28 10:08:32,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {6538#false} assume !(~y~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-28 10:08:32,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {6538#false} assume !(~x~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-28 10:08:32,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {6538#false} assume !(~z~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-28 10:08:32,052 INFO L272 TraceCheckUtils]: 18: Hoare triple {6538#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6538#false} is VALID [2022-04-28 10:08:32,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {6538#false} ~cond := #in~cond; {6538#false} is VALID [2022-04-28 10:08:32,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {6538#false} assume 0 == ~cond; {6538#false} is VALID [2022-04-28 10:08:32,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {6538#false} assume !false; {6538#false} is VALID [2022-04-28 10:08:32,052 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:32,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:32,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {6538#false} assume !false; {6538#false} is VALID [2022-04-28 10:08:32,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {6538#false} assume 0 == ~cond; {6538#false} is VALID [2022-04-28 10:08:32,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {6538#false} ~cond := #in~cond; {6538#false} is VALID [2022-04-28 10:08:32,215 INFO L272 TraceCheckUtils]: 18: Hoare triple {6538#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6538#false} is VALID [2022-04-28 10:08:32,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {6538#false} assume !(~z~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-28 10:08:32,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {6538#false} assume !(~x~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-28 10:08:32,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {6538#false} assume !(~y~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-28 10:08:32,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {6639#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6538#false} is VALID [2022-04-28 10:08:32,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {6643#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {6639#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:32,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {6643#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6643#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:32,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {6650#(< 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; {6643#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:32,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {6654#(< 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; {6650#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:32,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {6658#(< 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; {6654#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:32,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {6662#(< 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; {6658#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:32,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {6666#(< 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; {6662#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:32,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {6670#(< 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; {6666#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:32,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {6537#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6670#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:32,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {6537#true} call #t~ret15 := main(); {6537#true} is VALID [2022-04-28 10:08:32,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6537#true} {6537#true} #83#return; {6537#true} is VALID [2022-04-28 10:08:32,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {6537#true} assume true; {6537#true} is VALID [2022-04-28 10:08:32,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {6537#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6537#true} is VALID [2022-04-28 10:08:32,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {6537#true} call ULTIMATE.init(); {6537#true} is VALID [2022-04-28 10:08:32,221 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:32,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943459372] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:32,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:32,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:08:32,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:32,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [601904443] [2022-04-28 10:08:32,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [601904443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:32,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:32,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:08:32,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785400187] [2022-04-28 10:08:32,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:32,222 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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:32,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:32,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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:32,237 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:32,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:08:32,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:32,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:08:32,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:08:32,237 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:33,585 INFO L93 Difference]: Finished difference Result 156 states and 224 transitions. [2022-04-28 10:08:33,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:08:33,585 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2022-04-28 10:08:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2022-04-28 10:08:33,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 109 transitions. [2022-04-28 10:08:33,668 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:08:33,669 INFO L225 Difference]: With dead ends: 156 [2022-04-28 10:08:33,670 INFO L226 Difference]: Without dead ends: 139 [2022-04-28 10:08:33,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:08:33,670 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 82 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:33,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 95 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:08:33,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-28 10:08:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2022-04-28 10:08:33,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:33,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:33,810 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:33,810 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:33,812 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2022-04-28 10:08:33,812 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 186 transitions. [2022-04-28 10:08:33,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:33,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:33,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-28 10:08:33,812 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-28 10:08:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:33,814 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2022-04-28 10:08:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 186 transitions. [2022-04-28 10:08:33,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:33,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:33,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:33,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:33,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2022-04-28 10:08:33,815 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 22 [2022-04-28 10:08:33,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:33,816 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2022-04-28 10:08:33,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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:33,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 103 transitions. [2022-04-28 10:08:33,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2022-04-28 10:08:33,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:08:33,929 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:33,929 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:33,945 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:34,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 10:08:34,129 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:34,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1171520209, now seen corresponding path program 13 times [2022-04-28 10:08:34,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:34,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [666889624] [2022-04-28 10:08:34,132 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:34,132 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:34,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1171520209, now seen corresponding path program 14 times [2022-04-28 10:08:34,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:34,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181640041] [2022-04-28 10:08:34,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:34,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:34,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:34,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {7465#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7451#true} is VALID [2022-04-28 10:08:34,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {7451#true} assume true; {7451#true} is VALID [2022-04-28 10:08:34,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7451#true} {7451#true} #83#return; {7451#true} is VALID [2022-04-28 10:08:34,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {7451#true} call ULTIMATE.init(); {7465#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:34,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {7465#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7451#true} is VALID [2022-04-28 10:08:34,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {7451#true} assume true; {7451#true} is VALID [2022-04-28 10:08:34,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7451#true} {7451#true} #83#return; {7451#true} is VALID [2022-04-28 10:08:34,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {7451#true} call #t~ret15 := main(); {7451#true} is VALID [2022-04-28 10:08:34,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {7451#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7456#(= main_~y~0 0)} is VALID [2022-04-28 10:08:34,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {7456#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7457#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:34,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {7457#(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; {7458#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:34,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {7458#(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; {7459#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:34,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {7459#(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; {7460#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:34,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {7460#(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; {7461#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:34,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {7461#(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; {7462#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:34,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {7462#(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; {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:34,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:34,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {7464#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:34,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {7464#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-28 10:08:34,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {7452#false} assume !(~y~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-28 10:08:34,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {7452#false} assume !(~x~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-28 10:08:34,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {7452#false} assume !(~z~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-28 10:08:34,272 INFO L272 TraceCheckUtils]: 19: Hoare triple {7452#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7452#false} is VALID [2022-04-28 10:08:34,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {7452#false} ~cond := #in~cond; {7452#false} is VALID [2022-04-28 10:08:34,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {7452#false} assume 0 == ~cond; {7452#false} is VALID [2022-04-28 10:08:34,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {7452#false} assume !false; {7452#false} is VALID [2022-04-28 10:08:34,272 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:34,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:34,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181640041] [2022-04-28 10:08:34,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181640041] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:34,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126164453] [2022-04-28 10:08:34,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:34,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:34,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:34,273 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:34,274 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:34,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:34,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:34,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:08:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:34,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:34,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {7451#true} call ULTIMATE.init(); {7451#true} is VALID [2022-04-28 10:08:34,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {7451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7451#true} is VALID [2022-04-28 10:08:34,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {7451#true} assume true; {7451#true} is VALID [2022-04-28 10:08:34,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7451#true} {7451#true} #83#return; {7451#true} is VALID [2022-04-28 10:08:34,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {7451#true} call #t~ret15 := main(); {7451#true} is VALID [2022-04-28 10:08:34,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {7451#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7456#(= main_~y~0 0)} is VALID [2022-04-28 10:08:34,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {7456#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7457#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:34,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {7457#(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; {7458#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:34,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {7458#(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; {7459#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:34,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {7459#(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; {7460#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:34,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {7460#(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; {7461#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:34,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {7461#(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; {7462#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:34,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {7462#(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; {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:34,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:34,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {7463#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {7511#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:34,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {7511#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-28 10:08:34,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {7452#false} assume !(~y~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-28 10:08:34,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {7452#false} assume !(~x~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-28 10:08:34,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {7452#false} assume !(~z~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-28 10:08:34,524 INFO L272 TraceCheckUtils]: 19: Hoare triple {7452#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7452#false} is VALID [2022-04-28 10:08:34,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {7452#false} ~cond := #in~cond; {7452#false} is VALID [2022-04-28 10:08:34,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {7452#false} assume 0 == ~cond; {7452#false} is VALID [2022-04-28 10:08:34,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {7452#false} assume !false; {7452#false} is VALID [2022-04-28 10:08:34,524 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:34,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:34,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {7452#false} assume !false; {7452#false} is VALID [2022-04-28 10:08:34,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {7452#false} assume 0 == ~cond; {7452#false} is VALID [2022-04-28 10:08:34,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {7452#false} ~cond := #in~cond; {7452#false} is VALID [2022-04-28 10:08:34,737 INFO L272 TraceCheckUtils]: 19: Hoare triple {7452#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7452#false} is VALID [2022-04-28 10:08:34,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {7452#false} assume !(~z~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-28 10:08:34,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {7452#false} assume !(~x~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-28 10:08:34,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {7452#false} assume !(~y~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-28 10:08:34,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {7557#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7452#false} is VALID [2022-04-28 10:08:34,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {7561#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {7557#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:34,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {7561#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7561#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:34,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {7568#(< 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; {7561#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:34,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {7572#(< 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; {7568#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:34,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {7576#(< 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; {7572#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:34,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {7580#(< 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; {7576#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:34,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {7584#(< 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; {7580#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:34,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {7588#(< 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; {7584#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:34,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {7592#(< 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; {7588#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:34,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {7451#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7592#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:34,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {7451#true} call #t~ret15 := main(); {7451#true} is VALID [2022-04-28 10:08:34,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7451#true} {7451#true} #83#return; {7451#true} is VALID [2022-04-28 10:08:34,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {7451#true} assume true; {7451#true} is VALID [2022-04-28 10:08:34,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {7451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7451#true} is VALID [2022-04-28 10:08:34,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {7451#true} call ULTIMATE.init(); {7451#true} is VALID [2022-04-28 10:08:34,744 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:34,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126164453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:34,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:34,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:08:34,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:34,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [666889624] [2022-04-28 10:08:34,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [666889624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:34,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:34,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:08:34,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666224586] [2022-04-28 10:08:34,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:34,745 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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:34,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:34,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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:34,761 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:34,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:08:34,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:34,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:08:34,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:08:34,762 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:36,487 INFO L93 Difference]: Finished difference Result 172 states and 248 transitions. [2022-04-28 10:08:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:08:36,488 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2022-04-28 10:08:36,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2022-04-28 10:08:36,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 121 transitions. [2022-04-28 10:08:36,580 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:36,581 INFO L225 Difference]: With dead ends: 172 [2022-04-28 10:08:36,582 INFO L226 Difference]: Without dead ends: 155 [2022-04-28 10:08:36,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 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:36,582 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 97 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:36,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 105 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:08:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-28 10:08:36,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 84. [2022-04-28 10:08:36,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:36,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 84 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call 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:36,734 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 84 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call 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:36,734 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 84 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call 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:36,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:36,736 INFO L93 Difference]: Finished difference Result 155 states and 208 transitions. [2022-04-28 10:08:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 208 transitions. [2022-04-28 10:08:36,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:36,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:36,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 155 states. [2022-04-28 10:08:36,737 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 155 states. [2022-04-28 10:08:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:36,738 INFO L93 Difference]: Finished difference Result 155 states and 208 transitions. [2022-04-28 10:08:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 208 transitions. [2022-04-28 10:08:36,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:36,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:36,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:36,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call 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:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2022-04-28 10:08:36,740 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 23 [2022-04-28 10:08:36,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:36,740 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2022-04-28 10:08:36,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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:36,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 113 transitions. [2022-04-28 10:08:36,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2022-04-28 10:08:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:08:36,898 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:36,898 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:36,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:37,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 10:08:37,099 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:37,099 INFO L85 PathProgramCache]: Analyzing trace with hash -713078750, now seen corresponding path program 3 times [2022-04-28 10:08:37,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:37,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1580176031] [2022-04-28 10:08:37,103 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:37,103 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash -713078750, now seen corresponding path program 4 times [2022-04-28 10:08:37,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:37,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424078976] [2022-04-28 10:08:37,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:37,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:37,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:37,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {8462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8453#true} is VALID [2022-04-28 10:08:37,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {8453#true} assume true; {8453#true} is VALID [2022-04-28 10:08:37,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8453#true} {8453#true} #83#return; {8453#true} is VALID [2022-04-28 10:08:37,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {8453#true} call ULTIMATE.init(); {8462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:37,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {8462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8453#true} is VALID [2022-04-28 10:08:37,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {8453#true} assume true; {8453#true} is VALID [2022-04-28 10:08:37,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8453#true} {8453#true} #83#return; {8453#true} is VALID [2022-04-28 10:08:37,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {8453#true} call #t~ret15 := main(); {8453#true} is VALID [2022-04-28 10:08:37,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {8453#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8453#true} is VALID [2022-04-28 10:08:37,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {8453#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8458#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:37,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {8458#(<= 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; {8459#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:08:37,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {8459#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {8459#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:08:37,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {8459#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {8459#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:08:37,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {8459#(<= (* (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; {8460#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:08:37,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {8460#(<= (+ (* (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; {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:37,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:37,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {8461#(<= (+ 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; {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:37,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {8461#(<= (+ 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; {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:37,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:37,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {8461#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {8454#false} is VALID [2022-04-28 10:08:37,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {8454#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8454#false} is VALID [2022-04-28 10:08:37,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {8454#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8454#false} is VALID [2022-04-28 10:08:37,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {8454#false} assume !(~z~0 % 4294967296 > 0); {8454#false} is VALID [2022-04-28 10:08:37,181 INFO L272 TraceCheckUtils]: 20: Hoare triple {8454#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8454#false} is VALID [2022-04-28 10:08:37,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {8454#false} ~cond := #in~cond; {8454#false} is VALID [2022-04-28 10:08:37,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {8454#false} assume 0 == ~cond; {8454#false} is VALID [2022-04-28 10:08:37,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {8454#false} assume !false; {8454#false} is VALID [2022-04-28 10:08:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:08:37,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:37,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424078976] [2022-04-28 10:08:37,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424078976] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:37,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407615134] [2022-04-28 10:08:37,182 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:37,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:37,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:37,183 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:37,185 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:37,216 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:37,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:37,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:08:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:37,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:37,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {8453#true} call ULTIMATE.init(); {8453#true} is VALID [2022-04-28 10:08:37,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {8453#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8453#true} is VALID [2022-04-28 10:08:37,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {8453#true} assume true; {8453#true} is VALID [2022-04-28 10:08:37,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8453#true} {8453#true} #83#return; {8453#true} is VALID [2022-04-28 10:08:37,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {8453#true} call #t~ret15 := main(); {8453#true} is VALID [2022-04-28 10:08:37,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {8453#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8453#true} is VALID [2022-04-28 10:08:37,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {8453#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8458#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:37,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {8458#(<= 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; {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:37,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:37,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:37,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {8487#(<= 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; {8458#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:37,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {8458#(<= 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; {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:37,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:37,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {8500#(<= 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; {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:37,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {8500#(<= 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; {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:37,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:37,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8454#false} is VALID [2022-04-28 10:08:37,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {8454#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8454#false} is VALID [2022-04-28 10:08:37,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {8454#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8454#false} is VALID [2022-04-28 10:08:37,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {8454#false} assume !(~z~0 % 4294967296 > 0); {8454#false} is VALID [2022-04-28 10:08:37,435 INFO L272 TraceCheckUtils]: 20: Hoare triple {8454#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8454#false} is VALID [2022-04-28 10:08:37,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {8454#false} ~cond := #in~cond; {8454#false} is VALID [2022-04-28 10:08:37,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {8454#false} assume 0 == ~cond; {8454#false} is VALID [2022-04-28 10:08:37,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {8454#false} assume !false; {8454#false} is VALID [2022-04-28 10:08:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:08:37,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:37,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {8454#false} assume !false; {8454#false} is VALID [2022-04-28 10:08:37,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {8454#false} assume 0 == ~cond; {8454#false} is VALID [2022-04-28 10:08:37,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {8454#false} ~cond := #in~cond; {8454#false} is VALID [2022-04-28 10:08:37,514 INFO L272 TraceCheckUtils]: 20: Hoare triple {8454#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8454#false} is VALID [2022-04-28 10:08:37,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {8454#false} assume !(~z~0 % 4294967296 > 0); {8454#false} is VALID [2022-04-28 10:08:37,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {8454#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8454#false} is VALID [2022-04-28 10:08:37,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {8454#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8454#false} is VALID [2022-04-28 10:08:37,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8454#false} is VALID [2022-04-28 10:08:37,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:37,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {8500#(<= 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; {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:37,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {8500#(<= 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; {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:37,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:37,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {8458#(<= 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; {8500#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:37,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {8487#(<= 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; {8458#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:37,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:37,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:37,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {8458#(<= 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; {8487#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:37,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {8453#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8458#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:37,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {8453#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8453#true} is VALID [2022-04-28 10:08:37,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {8453#true} call #t~ret15 := main(); {8453#true} is VALID [2022-04-28 10:08:37,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8453#true} {8453#true} #83#return; {8453#true} is VALID [2022-04-28 10:08:37,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {8453#true} assume true; {8453#true} is VALID [2022-04-28 10:08:37,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {8453#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8453#true} is VALID [2022-04-28 10:08:37,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {8453#true} call ULTIMATE.init(); {8453#true} is VALID [2022-04-28 10:08:37,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:08:37,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407615134] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:37,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:37,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2022-04-28 10:08:37,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:37,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1580176031] [2022-04-28 10:08:37,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1580176031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:37,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:37,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:08:37,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670300811] [2022-04-28 10:08:37,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:37,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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:37,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:37,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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:37,536 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:37,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:08:37,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:37,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:08:37,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:08:37,537 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:38,051 INFO L93 Difference]: Finished difference Result 126 states and 176 transitions. [2022-04-28 10:08:38,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:08:38,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-28 10:08:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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:38,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-28 10:08:38,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-28 10:08:38,113 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:08:38,115 INFO L225 Difference]: With dead ends: 126 [2022-04-28 10:08:38,115 INFO L226 Difference]: Without dead ends: 117 [2022-04-28 10:08:38,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 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:38,115 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 47 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:38,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 38 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:08:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-28 10:08:38,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2022-04-28 10:08:38,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:38,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 104 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call 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:38,332 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 104 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call 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:38,332 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 104 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call 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:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:38,334 INFO L93 Difference]: Finished difference Result 117 states and 161 transitions. [2022-04-28 10:08:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 161 transitions. [2022-04-28 10:08:38,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:38,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:38,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-28 10:08:38,334 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-28 10:08:38,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:38,335 INFO L93 Difference]: Finished difference Result 117 states and 161 transitions. [2022-04-28 10:08:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 161 transitions. [2022-04-28 10:08:38,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:38,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:38,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:38,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call 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:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 141 transitions. [2022-04-28 10:08:38,337 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 141 transitions. Word has length 24 [2022-04-28 10:08:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:38,337 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 141 transitions. [2022-04-28 10:08:38,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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:38,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 141 transitions. [2022-04-28 10:08:38,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 141 transitions. [2022-04-28 10:08:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:08:38,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:38,537 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:38,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:38,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 10:08:38,747 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:38,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:38,748 INFO L85 PathProgramCache]: Analyzing trace with hash -495266734, now seen corresponding path program 3 times [2022-04-28 10:08:38,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:38,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1262060096] [2022-04-28 10:08:38,753 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:38,753 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:38,753 INFO L85 PathProgramCache]: Analyzing trace with hash -495266734, now seen corresponding path program 4 times [2022-04-28 10:08:38,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:38,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851444057] [2022-04-28 10:08:38,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:38,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:38,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:38,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {9321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9310#true} is VALID [2022-04-28 10:08:38,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {9310#true} assume true; {9310#true} is VALID [2022-04-28 10:08:38,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9310#true} {9310#true} #83#return; {9310#true} is VALID [2022-04-28 10:08:38,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {9310#true} call ULTIMATE.init(); {9321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:38,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {9321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9310#true} is VALID [2022-04-28 10:08:38,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {9310#true} assume true; {9310#true} is VALID [2022-04-28 10:08:38,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9310#true} {9310#true} #83#return; {9310#true} is VALID [2022-04-28 10:08:38,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {9310#true} call #t~ret15 := main(); {9310#true} is VALID [2022-04-28 10:08:38,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {9310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9315#(= main_~y~0 0)} is VALID [2022-04-28 10:08:38,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {9315#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {9316#(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; {9317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:38,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {9317#(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; {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:38,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:38,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {9319#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:38,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {9319#(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; {9320#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:38,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {9320#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-28 10:08:38,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {9311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9311#false} is VALID [2022-04-28 10:08:38,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {9311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9311#false} is VALID [2022-04-28 10:08:38,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {9311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9311#false} is VALID [2022-04-28 10:08:38,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {9311#false} assume !(~y~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-28 10:08:38,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {9311#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9311#false} is VALID [2022-04-28 10:08:38,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {9311#false} assume !(~x~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-28 10:08:38,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {9311#false} assume !(~z~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-28 10:08:38,853 INFO L272 TraceCheckUtils]: 20: Hoare triple {9311#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9311#false} is VALID [2022-04-28 10:08:38,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {9311#false} ~cond := #in~cond; {9311#false} is VALID [2022-04-28 10:08:38,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {9311#false} assume 0 == ~cond; {9311#false} is VALID [2022-04-28 10:08:38,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {9311#false} assume !false; {9311#false} is VALID [2022-04-28 10:08:38,853 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:38,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:38,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851444057] [2022-04-28 10:08:38,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851444057] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:38,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406928553] [2022-04-28 10:08:38,853 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:38,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:38,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:38,854 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:38,856 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:38,890 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:38,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:38,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:08:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:38,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:39,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {9310#true} call ULTIMATE.init(); {9310#true} is VALID [2022-04-28 10:08:39,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {9310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9310#true} is VALID [2022-04-28 10:08:39,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {9310#true} assume true; {9310#true} is VALID [2022-04-28 10:08:39,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9310#true} {9310#true} #83#return; {9310#true} is VALID [2022-04-28 10:08:39,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {9310#true} call #t~ret15 := main(); {9310#true} is VALID [2022-04-28 10:08:39,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {9310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9315#(= main_~y~0 0)} is VALID [2022-04-28 10:08:39,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {9315#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:39,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {9316#(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; {9317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:39,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {9317#(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; {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:39,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:39,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {9318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {9355#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:39,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {9355#(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; {9359#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:39,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {9359#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-28 10:08:39,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {9311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9311#false} is VALID [2022-04-28 10:08:39,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {9311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9311#false} is VALID [2022-04-28 10:08:39,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {9311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9311#false} is VALID [2022-04-28 10:08:39,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {9311#false} assume !(~y~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-28 10:08:39,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {9311#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9311#false} is VALID [2022-04-28 10:08:39,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {9311#false} assume !(~x~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-28 10:08:39,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {9311#false} assume !(~z~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-28 10:08:39,008 INFO L272 TraceCheckUtils]: 20: Hoare triple {9311#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9311#false} is VALID [2022-04-28 10:08:39,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {9311#false} ~cond := #in~cond; {9311#false} is VALID [2022-04-28 10:08:39,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {9311#false} assume 0 == ~cond; {9311#false} is VALID [2022-04-28 10:08:39,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {9311#false} assume !false; {9311#false} is VALID [2022-04-28 10:08:39,009 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:39,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:39,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {9311#false} assume !false; {9311#false} is VALID [2022-04-28 10:08:39,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {9311#false} assume 0 == ~cond; {9311#false} is VALID [2022-04-28 10:08:39,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {9311#false} ~cond := #in~cond; {9311#false} is VALID [2022-04-28 10:08:39,114 INFO L272 TraceCheckUtils]: 20: Hoare triple {9311#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9311#false} is VALID [2022-04-28 10:08:39,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {9311#false} assume !(~z~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-28 10:08:39,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {9311#false} assume !(~x~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-28 10:08:39,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {9311#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9311#false} is VALID [2022-04-28 10:08:39,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {9311#false} assume !(~y~0 % 4294967296 > 0); {9311#false} is VALID [2022-04-28 10:08:39,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {9311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9311#false} is VALID [2022-04-28 10:08:39,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {9423#(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; {9311#false} is VALID [2022-04-28 10:08:39,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {9427#(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; {9423#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:39,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {9431#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {9427#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:39,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {9435#(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; {9431#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:08:39,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {9310#true} ~z~0 := ~y~0; {9435#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:08:39,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {9310#true} assume !(~x~0 % 4294967296 > 0); {9310#true} is VALID [2022-04-28 10:08:39,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {9310#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9310#true} is VALID [2022-04-28 10:08:39,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {9310#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9310#true} is VALID [2022-04-28 10:08:39,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {9310#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9310#true} is VALID [2022-04-28 10:08:39,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {9310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9310#true} is VALID [2022-04-28 10:08:39,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {9310#true} call #t~ret15 := main(); {9310#true} is VALID [2022-04-28 10:08:39,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9310#true} {9310#true} #83#return; {9310#true} is VALID [2022-04-28 10:08:39,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {9310#true} assume true; {9310#true} is VALID [2022-04-28 10:08:39,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {9310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9310#true} is VALID [2022-04-28 10:08:39,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {9310#true} call ULTIMATE.init(); {9310#true} is VALID [2022-04-28 10:08:39,119 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:39,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406928553] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:39,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:39,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15 [2022-04-28 10:08:39,120 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:39,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1262060096] [2022-04-28 10:08:39,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1262060096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:39,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:39,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:08:39,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027792457] [2022-04-28 10:08:39,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:39,120 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:39,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:39,120 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:39,144 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:39,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:08:39,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:39,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:08:39,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:08:39,145 INFO L87 Difference]: Start difference. First operand 104 states and 141 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:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:39,964 INFO L93 Difference]: Finished difference Result 146 states and 194 transitions. [2022-04-28 10:08:39,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:08:39,964 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:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:39,965 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:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2022-04-28 10:08:39,965 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:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2022-04-28 10:08:39,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 71 transitions. [2022-04-28 10:08:40,029 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:08:40,031 INFO L225 Difference]: With dead ends: 146 [2022-04-28 10:08:40,031 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 10:08:40,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 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:40,032 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 47 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:40,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 58 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:08:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 10:08:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 104. [2022-04-28 10:08:40,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:40,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 104 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call 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:40,270 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 104 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call 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:40,270 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 104 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call 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:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:40,272 INFO L93 Difference]: Finished difference Result 134 states and 180 transitions. [2022-04-28 10:08:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 180 transitions. [2022-04-28 10:08:40,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:40,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:40,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 134 states. [2022-04-28 10:08:40,273 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 134 states. [2022-04-28 10:08:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:40,277 INFO L93 Difference]: Finished difference Result 134 states and 180 transitions. [2022-04-28 10:08:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 180 transitions. [2022-04-28 10:08:40,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:40,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:40,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:40,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call 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:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 140 transitions. [2022-04-28 10:08:40,279 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 140 transitions. Word has length 24 [2022-04-28 10:08:40,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:40,279 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 140 transitions. [2022-04-28 10:08:40,279 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:40,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 140 transitions. [2022-04-28 10:08:40,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 140 transitions. [2022-04-28 10:08:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:08:40,480 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:40,480 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:40,496 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:40,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:40,683 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:40,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:40,684 INFO L85 PathProgramCache]: Analyzing trace with hash 483669890, now seen corresponding path program 15 times [2022-04-28 10:08:40,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:40,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1380045889] [2022-04-28 10:08:40,686 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:40,686 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:40,686 INFO L85 PathProgramCache]: Analyzing trace with hash 483669890, now seen corresponding path program 16 times [2022-04-28 10:08:40,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:40,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821803707] [2022-04-28 10:08:40,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:40,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:40,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:40,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {10268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10253#true} is VALID [2022-04-28 10:08:40,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {10253#true} assume true; {10253#true} is VALID [2022-04-28 10:08:40,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10253#true} {10253#true} #83#return; {10253#true} is VALID [2022-04-28 10:08:40,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {10253#true} call ULTIMATE.init(); {10268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:40,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {10268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10253#true} is VALID [2022-04-28 10:08:40,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {10253#true} assume true; {10253#true} is VALID [2022-04-28 10:08:40,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10253#true} {10253#true} #83#return; {10253#true} is VALID [2022-04-28 10:08:40,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {10253#true} call #t~ret15 := main(); {10253#true} is VALID [2022-04-28 10:08:40,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {10253#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10258#(= main_~y~0 0)} is VALID [2022-04-28 10:08:40,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {10258#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:40,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {10259#(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; {10260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:40,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {10260#(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; {10261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:40,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {10261#(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; {10262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:40,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {10262#(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; {10263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:40,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {10263#(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; {10264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:40,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {10264#(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; {10265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:40,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {10265#(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; {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:40,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:40,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {10267#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:40,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {10267#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-28 10:08:40,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {10254#false} assume !(~y~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-28 10:08:40,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {10254#false} assume !(~x~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-28 10:08:40,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {10254#false} assume !(~z~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-28 10:08:40,850 INFO L272 TraceCheckUtils]: 20: Hoare triple {10254#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10254#false} is VALID [2022-04-28 10:08:40,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {10254#false} ~cond := #in~cond; {10254#false} is VALID [2022-04-28 10:08:40,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {10254#false} assume 0 == ~cond; {10254#false} is VALID [2022-04-28 10:08:40,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {10254#false} assume !false; {10254#false} is VALID [2022-04-28 10:08:40,851 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:40,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:40,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821803707] [2022-04-28 10:08:40,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821803707] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:40,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318540147] [2022-04-28 10:08:40,851 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:40,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:40,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:40,852 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:40,853 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:40,883 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:40,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:40,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:08:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:40,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:41,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {10253#true} call ULTIMATE.init(); {10253#true} is VALID [2022-04-28 10:08:41,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {10253#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10253#true} is VALID [2022-04-28 10:08:41,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {10253#true} assume true; {10253#true} is VALID [2022-04-28 10:08:41,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10253#true} {10253#true} #83#return; {10253#true} is VALID [2022-04-28 10:08:41,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {10253#true} call #t~ret15 := main(); {10253#true} is VALID [2022-04-28 10:08:41,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {10253#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10258#(= main_~y~0 0)} is VALID [2022-04-28 10:08:41,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {10258#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:41,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {10259#(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; {10260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:41,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {10260#(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; {10261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:41,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {10261#(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; {10262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:41,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {10262#(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; {10263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:41,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {10263#(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; {10264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:41,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {10264#(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; {10265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:41,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {10265#(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; {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:41,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:41,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {10266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {10317#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:08:41,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {10317#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-28 10:08:41,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {10254#false} assume !(~y~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-28 10:08:41,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {10254#false} assume !(~x~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-28 10:08:41,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {10254#false} assume !(~z~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-28 10:08:41,112 INFO L272 TraceCheckUtils]: 20: Hoare triple {10254#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10254#false} is VALID [2022-04-28 10:08:41,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {10254#false} ~cond := #in~cond; {10254#false} is VALID [2022-04-28 10:08:41,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {10254#false} assume 0 == ~cond; {10254#false} is VALID [2022-04-28 10:08:41,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {10254#false} assume !false; {10254#false} is VALID [2022-04-28 10:08:41,112 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:41,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:41,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {10254#false} assume !false; {10254#false} is VALID [2022-04-28 10:08:41,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {10254#false} assume 0 == ~cond; {10254#false} is VALID [2022-04-28 10:08:41,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {10254#false} ~cond := #in~cond; {10254#false} is VALID [2022-04-28 10:08:41,317 INFO L272 TraceCheckUtils]: 20: Hoare triple {10254#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10254#false} is VALID [2022-04-28 10:08:41,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {10254#false} assume !(~z~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-28 10:08:41,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {10254#false} assume !(~x~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-28 10:08:41,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {10254#false} assume !(~y~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-28 10:08:41,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {10363#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10254#false} is VALID [2022-04-28 10:08:41,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {10367#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {10363#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:41,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {10367#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {10367#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:41,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {10374#(< 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; {10367#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:41,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {10378#(< 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; {10374#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:41,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {10382#(< 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; {10378#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:41,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {10386#(< 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; {10382#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:41,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {10390#(< 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; {10386#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:41,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {10394#(< 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; {10390#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:41,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {10398#(< 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; {10394#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:41,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {10402#(< 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; {10398#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:41,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {10253#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10402#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:08:41,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {10253#true} call #t~ret15 := main(); {10253#true} is VALID [2022-04-28 10:08:41,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10253#true} {10253#true} #83#return; {10253#true} is VALID [2022-04-28 10:08:41,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {10253#true} assume true; {10253#true} is VALID [2022-04-28 10:08:41,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {10253#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10253#true} is VALID [2022-04-28 10:08:41,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {10253#true} call ULTIMATE.init(); {10253#true} is VALID [2022-04-28 10:08:41,323 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:41,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318540147] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:41,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:41,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:08:41,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:41,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1380045889] [2022-04-28 10:08:41,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1380045889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:41,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:41,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:08:41,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742662484] [2022-04-28 10:08:41,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:41,324 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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:41,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:41,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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:41,338 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:41,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:08:41,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:41,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:08:41,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:08:41,339 INFO L87 Difference]: Start difference. First operand 104 states and 140 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:43,589 INFO L93 Difference]: Finished difference Result 215 states and 315 transitions. [2022-04-28 10:08:43,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:08:43,589 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2022-04-28 10:08:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2022-04-28 10:08:43,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 133 transitions. [2022-04-28 10:08:43,702 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:43,705 INFO L225 Difference]: With dead ends: 215 [2022-04-28 10:08:43,705 INFO L226 Difference]: Without dead ends: 195 [2022-04-28 10:08:43,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:08:43,706 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 108 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:43,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 117 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:08:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-04-28 10:08:43,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 113. [2022-04-28 10:08:43,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:43,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand has 113 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call 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,996 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand has 113 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call 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,996 INFO L87 Difference]: Start difference. First operand 195 states. Second operand has 113 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call 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,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:43,999 INFO L93 Difference]: Finished difference Result 195 states and 260 transitions. [2022-04-28 10:08:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 260 transitions. [2022-04-28 10:08:44,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:44,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:44,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 3 states have call successors, (3), 3 states 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:08:44,001 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 3 states have call successors, (3), 3 states 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:08:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:44,004 INFO L93 Difference]: Finished difference Result 195 states and 260 transitions. [2022-04-28 10:08:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 260 transitions. [2022-04-28 10:08:44,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:44,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:44,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:44,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call 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,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 153 transitions. [2022-04-28 10:08:44,006 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 153 transitions. Word has length 24 [2022-04-28 10:08:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:44,006 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 153 transitions. [2022-04-28 10:08:44,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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:44,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 153 transitions. [2022-04-28 10:08:44,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:44,238 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 153 transitions. [2022-04-28 10:08:44,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:08:44,238 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:44,238 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:44,257 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:44,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:44,439 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:44,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:44,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1115860192, now seen corresponding path program 5 times [2022-04-28 10:08:44,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:44,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [942093086] [2022-04-28 10:08:44,441 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:44,442 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:44,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1115860192, now seen corresponding path program 6 times [2022-04-28 10:08:44,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:44,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583504487] [2022-04-28 10:08:44,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:44,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:44,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:44,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {11503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11489#true} is VALID [2022-04-28 10:08:44,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {11489#true} assume true; {11489#true} is VALID [2022-04-28 10:08:44,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11489#true} {11489#true} #83#return; {11489#true} is VALID [2022-04-28 10:08:44,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {11489#true} call ULTIMATE.init(); {11503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:44,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {11503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11489#true} is VALID [2022-04-28 10:08:44,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {11489#true} assume true; {11489#true} is VALID [2022-04-28 10:08:44,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11489#true} {11489#true} #83#return; {11489#true} is VALID [2022-04-28 10:08:44,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {11489#true} call #t~ret15 := main(); {11489#true} is VALID [2022-04-28 10:08:44,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {11489#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11494#(= main_~y~0 0)} is VALID [2022-04-28 10:08:44,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {11494#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11495#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:44,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {11495#(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; {11496#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:44,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {11496#(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; {11497#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:44,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {11497#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11497#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:44,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {11497#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {11498#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:44,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {11498#(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; {11499#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:44,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {11499#(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; {11500#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:44,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {11500#(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; {11501#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:44,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {11501#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11501#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:44,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {11501#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11500#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:44,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {11500#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11499#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:44,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {11499#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11502#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:44,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {11502#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {11502#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:44,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {11502#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {11502#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:44,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {11502#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {11490#false} is VALID [2022-04-28 10:08:44,592 INFO L272 TraceCheckUtils]: 21: Hoare triple {11490#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11490#false} is VALID [2022-04-28 10:08:44,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {11490#false} ~cond := #in~cond; {11490#false} is VALID [2022-04-28 10:08:44,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {11490#false} assume 0 == ~cond; {11490#false} is VALID [2022-04-28 10:08:44,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {11490#false} assume !false; {11490#false} is VALID [2022-04-28 10:08:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:44,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:44,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583504487] [2022-04-28 10:08:44,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583504487] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:44,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821090051] [2022-04-28 10:08:44,593 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:44,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:44,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:44,594 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:44,594 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:44,637 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:08:44,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:44,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:08:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:44,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:44,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {11489#true} call ULTIMATE.init(); {11489#true} is VALID [2022-04-28 10:08:44,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {11489#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11489#true} is VALID [2022-04-28 10:08:44,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {11489#true} assume true; {11489#true} is VALID [2022-04-28 10:08:44,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11489#true} {11489#true} #83#return; {11489#true} is VALID [2022-04-28 10:08:44,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {11489#true} call #t~ret15 := main(); {11489#true} is VALID [2022-04-28 10:08:44,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {11489#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11489#true} is VALID [2022-04-28 10:08:44,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {11489#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:44,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11529#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:44,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {11529#(< 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; {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:08:44,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:08:44,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:08:44,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11529#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:44,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {11529#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:44,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:44,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:44,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:44,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:44,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:44,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:44,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11490#false} is VALID [2022-04-28 10:08:44,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {11490#false} assume !(~z~0 % 4294967296 > 0); {11490#false} is VALID [2022-04-28 10:08:44,757 INFO L272 TraceCheckUtils]: 21: Hoare triple {11490#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11490#false} is VALID [2022-04-28 10:08:44,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {11490#false} ~cond := #in~cond; {11490#false} is VALID [2022-04-28 10:08:44,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {11490#false} assume 0 == ~cond; {11490#false} is VALID [2022-04-28 10:08:44,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {11490#false} assume !false; {11490#false} is VALID [2022-04-28 10:08:44,758 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:44,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:44,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {11490#false} assume !false; {11490#false} is VALID [2022-04-28 10:08:44,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {11490#false} assume 0 == ~cond; {11490#false} is VALID [2022-04-28 10:08:44,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {11490#false} ~cond := #in~cond; {11490#false} is VALID [2022-04-28 10:08:44,829 INFO L272 TraceCheckUtils]: 21: Hoare triple {11490#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11490#false} is VALID [2022-04-28 10:08:44,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {11490#false} assume !(~z~0 % 4294967296 > 0); {11490#false} is VALID [2022-04-28 10:08:44,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11490#false} is VALID [2022-04-28 10:08:44,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:44,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:44,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:44,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:44,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {11549#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:44,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11549#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:08:44,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {11529#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:44,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11529#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:44,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:08:44,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:08:44,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {11529#(< 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; {11533#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:08:44,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11529#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:08:44,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {11489#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11525#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:08:44,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {11489#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11489#true} is VALID [2022-04-28 10:08:44,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {11489#true} call #t~ret15 := main(); {11489#true} is VALID [2022-04-28 10:08:44,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11489#true} {11489#true} #83#return; {11489#true} is VALID [2022-04-28 10:08:44,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {11489#true} assume true; {11489#true} is VALID [2022-04-28 10:08:44,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {11489#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11489#true} is VALID [2022-04-28 10:08:44,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {11489#true} call ULTIMATE.init(); {11489#true} is VALID [2022-04-28 10:08:44,836 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:44,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821090051] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:44,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:44,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-28 10:08:44,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:44,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [942093086] [2022-04-28 10:08:44,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [942093086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:44,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:44,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:08:44,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444308764] [2022-04-28 10:08:44,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:44,837 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:08:44,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:44,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:08:44,853 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:08:44,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:08:44,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:44,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:08:44,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:08:44,854 INFO L87 Difference]: Start difference. First operand 113 states and 153 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:08:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:46,607 INFO L93 Difference]: Finished difference Result 174 states and 243 transitions. [2022-04-28 10:08:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:08:46,607 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:08:46,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:08:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 120 transitions. [2022-04-28 10:08:46,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:08:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 120 transitions. [2022-04-28 10:08:46,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 120 transitions. [2022-04-28 10:08:46,720 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,723 INFO L225 Difference]: With dead ends: 174 [2022-04-28 10:08:46,723 INFO L226 Difference]: Without dead ends: 156 [2022-04-28 10:08:46,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:08:46,724 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 57 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:46,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 70 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:08:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-28 10:08:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 119. [2022-04-28 10:08:47,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:47,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 119 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call 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,037 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 119 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call 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,037 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 119 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call 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,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:47,039 INFO L93 Difference]: Finished difference Result 156 states and 201 transitions. [2022-04-28 10:08:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 201 transitions. [2022-04-28 10:08:47,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:47,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:47,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 156 states. [2022-04-28 10:08:47,039 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 156 states. [2022-04-28 10:08:47,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:47,041 INFO L93 Difference]: Finished difference Result 156 states and 201 transitions. [2022-04-28 10:08:47,041 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 201 transitions. [2022-04-28 10:08:47,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:47,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:47,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:47,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call 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,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 158 transitions. [2022-04-28 10:08:47,044 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 158 transitions. Word has length 25 [2022-04-28 10:08:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:47,044 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 158 transitions. [2022-04-28 10:08:47,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:08:47,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 158 transitions. [2022-04-28 10:08:47,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 158 transitions. [2022-04-28 10:08:47,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:08:47,287 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:47,287 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:47,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:47,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:47,488 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:47,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:47,489 INFO L85 PathProgramCache]: Analyzing trace with hash 254955407, now seen corresponding path program 17 times [2022-04-28 10:08:47,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:47,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1562489800] [2022-04-28 10:08:47,491 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:47,491 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:47,491 INFO L85 PathProgramCache]: Analyzing trace with hash 254955407, now seen corresponding path program 18 times [2022-04-28 10:08:47,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:47,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496090490] [2022-04-28 10:08:47,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:47,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:47,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:47,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {12619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12603#true} is VALID [2022-04-28 10:08:47,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {12603#true} assume true; {12603#true} is VALID [2022-04-28 10:08:47,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12603#true} {12603#true} #83#return; {12603#true} is VALID [2022-04-28 10:08:47,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {12603#true} call ULTIMATE.init(); {12619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:47,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {12619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12603#true} is VALID [2022-04-28 10:08:47,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {12603#true} assume true; {12603#true} is VALID [2022-04-28 10:08:47,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12603#true} {12603#true} #83#return; {12603#true} is VALID [2022-04-28 10:08:47,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {12603#true} call #t~ret15 := main(); {12603#true} is VALID [2022-04-28 10:08:47,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {12603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12608#(= main_~y~0 0)} is VALID [2022-04-28 10:08:47,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {12608#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:47,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {12609#(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; {12610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:47,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {12610#(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; {12611#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:47,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {12611#(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; {12612#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:47,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {12612#(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; {12613#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:47,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {12613#(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; {12614#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:47,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {12614#(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; {12615#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:47,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {12615#(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; {12616#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:47,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {12616#(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; {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:47,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:47,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {12618#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:47,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {12618#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-28 10:08:47,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {12604#false} assume !(~y~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-28 10:08:47,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {12604#false} assume !(~x~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-28 10:08:47,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {12604#false} assume !(~z~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-28 10:08:47,653 INFO L272 TraceCheckUtils]: 21: Hoare triple {12604#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12604#false} is VALID [2022-04-28 10:08:47,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {12604#false} ~cond := #in~cond; {12604#false} is VALID [2022-04-28 10:08:47,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {12604#false} assume 0 == ~cond; {12604#false} is VALID [2022-04-28 10:08:47,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {12604#false} assume !false; {12604#false} is VALID [2022-04-28 10:08:47,653 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:47,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:47,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496090490] [2022-04-28 10:08:47,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496090490] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:47,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954391763] [2022-04-28 10:08:47,653 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:47,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:47,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:47,654 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:47,655 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:47,702 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:08:47,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:47,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:08:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:47,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:47,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {12603#true} call ULTIMATE.init(); {12603#true} is VALID [2022-04-28 10:08:47,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {12603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12603#true} is VALID [2022-04-28 10:08:47,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {12603#true} assume true; {12603#true} is VALID [2022-04-28 10:08:47,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12603#true} {12603#true} #83#return; {12603#true} is VALID [2022-04-28 10:08:47,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {12603#true} call #t~ret15 := main(); {12603#true} is VALID [2022-04-28 10:08:47,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {12603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12608#(= main_~y~0 0)} is VALID [2022-04-28 10:08:47,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {12608#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:47,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {12609#(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; {12610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:47,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {12610#(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; {12611#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:47,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {12611#(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; {12612#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:47,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {12612#(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; {12613#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:47,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {12613#(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; {12614#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:47,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {12614#(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; {12615#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:47,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {12615#(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; {12616#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:47,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {12616#(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; {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:47,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:47,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {12617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {12671#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:47,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {12671#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-28 10:08:47,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {12604#false} assume !(~y~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-28 10:08:47,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {12604#false} assume !(~x~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-28 10:08:47,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {12604#false} assume !(~z~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-28 10:08:47,931 INFO L272 TraceCheckUtils]: 21: Hoare triple {12604#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12604#false} is VALID [2022-04-28 10:08:47,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {12604#false} ~cond := #in~cond; {12604#false} is VALID [2022-04-28 10:08:47,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {12604#false} assume 0 == ~cond; {12604#false} is VALID [2022-04-28 10:08:47,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {12604#false} assume !false; {12604#false} is VALID [2022-04-28 10:08:47,931 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:47,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:48,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {12604#false} assume !false; {12604#false} is VALID [2022-04-28 10:08:48,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {12604#false} assume 0 == ~cond; {12604#false} is VALID [2022-04-28 10:08:48,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {12604#false} ~cond := #in~cond; {12604#false} is VALID [2022-04-28 10:08:48,179 INFO L272 TraceCheckUtils]: 21: Hoare triple {12604#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12604#false} is VALID [2022-04-28 10:08:48,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {12604#false} assume !(~z~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-28 10:08:48,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {12604#false} assume !(~x~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-28 10:08:48,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {12604#false} assume !(~y~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-28 10:08:48,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {12717#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12604#false} is VALID [2022-04-28 10:08:48,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {12721#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {12717#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:48,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {12721#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {12721#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:48,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {12728#(< 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; {12721#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:48,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {12732#(< 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; {12728#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:48,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {12736#(< 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; {12732#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:48,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {12740#(< 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; {12736#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:48,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {12744#(< 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; {12740#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:48,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {12748#(< 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; {12744#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:48,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {12752#(< 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; {12748#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:48,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {12756#(< 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; {12752#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:48,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {12760#(< 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; {12756#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:08:48,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {12603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12760#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:08:48,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {12603#true} call #t~ret15 := main(); {12603#true} is VALID [2022-04-28 10:08:48,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12603#true} {12603#true} #83#return; {12603#true} is VALID [2022-04-28 10:08:48,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {12603#true} assume true; {12603#true} is VALID [2022-04-28 10:08:48,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {12603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12603#true} is VALID [2022-04-28 10:08:48,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {12603#true} call ULTIMATE.init(); {12603#true} is VALID [2022-04-28 10:08:48,186 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:48,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954391763] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:48,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:48,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:08:48,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:48,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1562489800] [2022-04-28 10:08:48,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1562489800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:48,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:48,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:08:48,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133929004] [2022-04-28 10:08:48,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:48,187 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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:08:48,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:48,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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:08:48,204 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:08:48,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:08:48,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:48,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:08:48,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:08:48,205 INFO L87 Difference]: Start difference. First operand 119 states and 158 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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:08:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:51,223 INFO L93 Difference]: Finished difference Result 266 states and 385 transitions. [2022-04-28 10:08:51,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:08:51,223 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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:08:51,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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:08:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 145 transitions. [2022-04-28 10:08:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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:08:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 145 transitions. [2022-04-28 10:08:51,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 145 transitions. [2022-04-28 10:08:51,339 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:08:51,342 INFO L225 Difference]: With dead ends: 266 [2022-04-28 10:08:51,342 INFO L226 Difference]: Without dead ends: 246 [2022-04-28 10:08:51,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:08:51,343 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 123 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:51,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 129 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:08:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-04-28 10:08:51,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 128. [2022-04-28 10:08:51,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:51,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call 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,670 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call 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,671 INFO L87 Difference]: Start difference. First operand 246 states. Second operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call 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,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:51,674 INFO L93 Difference]: Finished difference Result 246 states and 327 transitions. [2022-04-28 10:08:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 327 transitions. [2022-04-28 10:08:51,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:51,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:51,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 246 states. [2022-04-28 10:08:51,675 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 246 states. [2022-04-28 10:08:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:51,678 INFO L93 Difference]: Finished difference Result 246 states and 327 transitions. [2022-04-28 10:08:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 327 transitions. [2022-04-28 10:08:51,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:51,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:51,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:51,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call 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,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 171 transitions. [2022-04-28 10:08:51,681 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 171 transitions. Word has length 25 [2022-04-28 10:08:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:51,681 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 171 transitions. [2022-04-28 10:08:51,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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:08:51,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 171 transitions. [2022-04-28 10:08:51,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 171 transitions. [2022-04-28 10:08:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:08:51,938 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:51,938 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:51,955 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:52,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:52,139 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:52,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:52,142 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 3 times [2022-04-28 10:08:52,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:52,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1613282562] [2022-04-28 10:08:52,149 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:52,149 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:52,149 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 4 times [2022-04-28 10:08:52,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:52,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744087065] [2022-04-28 10:08:52,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:52,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:52,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:52,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {14097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14083#true} is VALID [2022-04-28 10:08:52,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {14083#true} assume true; {14083#true} is VALID [2022-04-28 10:08:52,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14083#true} {14083#true} #83#return; {14083#true} is VALID [2022-04-28 10:08:52,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {14083#true} call ULTIMATE.init(); {14097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:52,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {14097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14083#true} is VALID [2022-04-28 10:08:52,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {14083#true} assume true; {14083#true} is VALID [2022-04-28 10:08:52,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14083#true} {14083#true} #83#return; {14083#true} is VALID [2022-04-28 10:08:52,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {14083#true} call #t~ret15 := main(); {14083#true} is VALID [2022-04-28 10:08:52,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {14083#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:52,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14089#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-28 10:08:52,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {14089#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:08:52,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-28 10:08:52,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} ~z~0 := ~y~0; {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-28 10:08:52,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14092#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-28 10:08:52,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {14092#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:08:52,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} assume !(~z~0 % 4294967296 > 0); {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:08:52,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:08:52,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:08:52,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} assume !(~y~0 % 4294967296 > 0); {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:08:52,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {14093#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14092#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-28 10:08:52,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {14092#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-28 10:08:52,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-28 10:08:52,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {14091#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14092#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-28 10:08:52,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {14092#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:52,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:52,422 INFO L272 TraceCheckUtils]: 22: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14095#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:08:52,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {14095#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {14096#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:08:52,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {14096#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14084#false} is VALID [2022-04-28 10:08:52,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {14084#false} assume !false; {14084#false} is VALID [2022-04-28 10:08:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:08:52,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:52,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744087065] [2022-04-28 10:08:52,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744087065] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:52,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779005355] [2022-04-28 10:08:52,424 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:52,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:52,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:52,425 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:52,425 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:52,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:52,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:52,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:08:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:52,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:52,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {14083#true} call ULTIMATE.init(); {14083#true} is VALID [2022-04-28 10:08:52,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {14083#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14083#true} is VALID [2022-04-28 10:08:52,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {14083#true} assume true; {14083#true} is VALID [2022-04-28 10:08:52,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14083#true} {14083#true} #83#return; {14083#true} is VALID [2022-04-28 10:08:52,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {14083#true} call #t~ret15 := main(); {14083#true} is VALID [2022-04-28 10:08:52,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {14083#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:52,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14119#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 10:08:52,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {14119#(= (+ main_~x~0 1) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:08:52,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:08:52,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} ~z~0 := ~y~0; {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:08:52,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14119#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 10:08:52,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {14119#(= (+ main_~x~0 1) main_~n~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:52,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:52,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:52,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:52,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:52,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14119#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 10:08:52,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {14119#(= (+ main_~x~0 1) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:08:52,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:08:52,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {14090#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14119#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 10:08:52,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {14119#(= (+ main_~x~0 1) main_~n~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:52,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:08:52,624 INFO L272 TraceCheckUtils]: 22: Hoare triple {14088#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14168#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:52,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {14168#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14172#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:52,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {14172#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14084#false} is VALID [2022-04-28 10:08:52,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {14084#false} assume !false; {14084#false} is VALID [2022-04-28 10:08:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:08:52,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:52,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {14084#false} assume !false; {14084#false} is VALID [2022-04-28 10:08:52,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {14172#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14084#false} is VALID [2022-04-28 10:08:52,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {14168#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14172#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:52,917 INFO L272 TraceCheckUtils]: 22: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14168#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:52,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:52,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:52,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:52,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:52,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:52,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:52,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:52,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:52,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:52,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:52,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:52,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:52,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} ~z~0 := ~y~0; {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:52,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:52,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14198#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:52,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14194#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:52,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {14083#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14094#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:08:52,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {14083#true} call #t~ret15 := main(); {14083#true} is VALID [2022-04-28 10:08:52,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14083#true} {14083#true} #83#return; {14083#true} is VALID [2022-04-28 10:08:52,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {14083#true} assume true; {14083#true} is VALID [2022-04-28 10:08:52,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {14083#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14083#true} is VALID [2022-04-28 10:08:52,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {14083#true} call ULTIMATE.init(); {14083#true} is VALID [2022-04-28 10:08:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:08:52,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779005355] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:52,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:52,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2022-04-28 10:08:52,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:52,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1613282562] [2022-04-28 10:08:52,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1613282562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:52,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:52,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:08:52,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381242914] [2022-04-28 10:08:52,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:52,930 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 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 26 [2022-04-28 10:08:52,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:52,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 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:08:52,955 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:08:52,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:08:52,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:52,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:08:52,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:08:52,955 INFO L87 Difference]: Start difference. First operand 128 states and 171 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 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:08:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:53,801 INFO L93 Difference]: Finished difference Result 143 states and 186 transitions. [2022-04-28 10:08:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:08:53,801 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 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 26 [2022-04-28 10:08:53,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 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:08:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2022-04-28 10:08:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 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:08:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2022-04-28 10:08:53,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 49 transitions. [2022-04-28 10:08:53,856 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:08:53,857 INFO L225 Difference]: With dead ends: 143 [2022-04-28 10:08:53,857 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 10:08:53,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:08:53,858 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:53,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 51 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:08:53,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 10:08:54,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-28 10:08:54,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:54,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 113 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call 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:54,164 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 113 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call 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:54,164 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 113 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call 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:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:54,166 INFO L93 Difference]: Finished difference Result 118 states and 159 transitions. [2022-04-28 10:08:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 159 transitions. [2022-04-28 10:08:54,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:54,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:54,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 113 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 118 states. [2022-04-28 10:08:54,166 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 113 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 118 states. [2022-04-28 10:08:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:54,168 INFO L93 Difference]: Finished difference Result 118 states and 159 transitions. [2022-04-28 10:08:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 159 transitions. [2022-04-28 10:08:54,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:54,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:54,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:54,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 113 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call 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:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 159 transitions. [2022-04-28 10:08:54,170 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 159 transitions. Word has length 26 [2022-04-28 10:08:54,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:54,171 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 159 transitions. [2022-04-28 10:08:54,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 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:08:54,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 159 transitions. [2022-04-28 10:08:54,444 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:08:54,445 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 159 transitions. [2022-04-28 10:08:54,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:08:54,445 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:54,445 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:54,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:54,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:54,646 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:54,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:54,646 INFO L85 PathProgramCache]: Analyzing trace with hash -32897246, now seen corresponding path program 5 times [2022-04-28 10:08:54,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:54,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1899628850] [2022-04-28 10:08:54,648 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:54,648 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:54,648 INFO L85 PathProgramCache]: Analyzing trace with hash -32897246, now seen corresponding path program 6 times [2022-04-28 10:08:54,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:54,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040205234] [2022-04-28 10:08:54,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:54,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:54,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:54,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {15044#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15032#true} is VALID [2022-04-28 10:08:54,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {15032#true} assume true; {15032#true} is VALID [2022-04-28 10:08:54,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15032#true} {15032#true} #83#return; {15032#true} is VALID [2022-04-28 10:08:54,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {15032#true} call ULTIMATE.init(); {15044#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:54,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {15044#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15032#true} is VALID [2022-04-28 10:08:54,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {15032#true} assume true; {15032#true} is VALID [2022-04-28 10:08:54,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15032#true} {15032#true} #83#return; {15032#true} is VALID [2022-04-28 10:08:54,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {15032#true} call #t~ret15 := main(); {15032#true} is VALID [2022-04-28 10:08:54,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {15032#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15037#(= main_~y~0 0)} is VALID [2022-04-28 10:08:54,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {15037#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15038#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:54,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {15038#(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; {15039#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:54,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {15039#(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; {15040#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:54,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {15040#(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; {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:54,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:54,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {15042#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:08:54,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {15042#(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; {15043#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:54,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {15043#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-28 10:08:54,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-28 10:08:54,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-28 10:08:54,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-28 10:08:54,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-28 10:08:54,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {15033#false} assume !(~y~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-28 10:08:54,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {15033#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15033#false} is VALID [2022-04-28 10:08:54,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {15033#false} assume !(~x~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-28 10:08:54,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {15033#false} assume !(~z~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-28 10:08:54,773 INFO L272 TraceCheckUtils]: 22: Hoare triple {15033#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15033#false} is VALID [2022-04-28 10:08:54,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {15033#false} ~cond := #in~cond; {15033#false} is VALID [2022-04-28 10:08:54,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {15033#false} assume 0 == ~cond; {15033#false} is VALID [2022-04-28 10:08:54,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {15033#false} assume !false; {15033#false} is VALID [2022-04-28 10:08:54,773 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:08:54,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:54,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040205234] [2022-04-28 10:08:54,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040205234] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:54,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792533235] [2022-04-28 10:08:54,774 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:54,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:54,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:54,775 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:54,779 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:54,817 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:08:54,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:54,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:08:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:54,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:54,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {15032#true} call ULTIMATE.init(); {15032#true} is VALID [2022-04-28 10:08:54,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {15032#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15032#true} is VALID [2022-04-28 10:08:54,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {15032#true} assume true; {15032#true} is VALID [2022-04-28 10:08:54,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15032#true} {15032#true} #83#return; {15032#true} is VALID [2022-04-28 10:08:54,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {15032#true} call #t~ret15 := main(); {15032#true} is VALID [2022-04-28 10:08:54,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {15032#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15037#(= main_~y~0 0)} is VALID [2022-04-28 10:08:54,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {15037#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15038#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:54,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {15038#(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; {15039#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:54,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {15039#(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; {15040#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:54,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {15040#(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; {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:54,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:54,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {15041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {15081#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:54,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {15081#(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; {15085#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:54,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {15085#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-28 10:08:54,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-28 10:08:54,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-28 10:08:54,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-28 10:08:54,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-28 10:08:54,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {15033#false} assume !(~y~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-28 10:08:54,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {15033#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15033#false} is VALID [2022-04-28 10:08:54,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {15033#false} assume !(~x~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-28 10:08:54,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {15033#false} assume !(~z~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-28 10:08:54,961 INFO L272 TraceCheckUtils]: 22: Hoare triple {15033#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15033#false} is VALID [2022-04-28 10:08:54,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {15033#false} ~cond := #in~cond; {15033#false} is VALID [2022-04-28 10:08:54,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {15033#false} assume 0 == ~cond; {15033#false} is VALID [2022-04-28 10:08:54,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {15033#false} assume !false; {15033#false} is VALID [2022-04-28 10:08:54,962 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:08:54,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:55,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {15033#false} assume !false; {15033#false} is VALID [2022-04-28 10:08:55,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {15033#false} assume 0 == ~cond; {15033#false} is VALID [2022-04-28 10:08:55,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {15033#false} ~cond := #in~cond; {15033#false} is VALID [2022-04-28 10:08:55,089 INFO L272 TraceCheckUtils]: 22: Hoare triple {15033#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15033#false} is VALID [2022-04-28 10:08:55,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {15033#false} assume !(~z~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-28 10:08:55,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {15033#false} assume !(~x~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-28 10:08:55,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {15033#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15033#false} is VALID [2022-04-28 10:08:55,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {15033#false} assume !(~y~0 % 4294967296 > 0); {15033#false} is VALID [2022-04-28 10:08:55,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-28 10:08:55,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {15033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15033#false} is VALID [2022-04-28 10:08:55,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {15155#(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; {15033#false} is VALID [2022-04-28 10:08:55,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {15159#(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; {15155#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:55,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {15163#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {15159#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:55,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {15167#(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; {15163#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:08:55,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {15032#true} ~z~0 := ~y~0; {15167#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:08:55,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {15032#true} assume !(~x~0 % 4294967296 > 0); {15032#true} is VALID [2022-04-28 10:08:55,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {15032#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15032#true} is VALID [2022-04-28 10:08:55,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {15032#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15032#true} is VALID [2022-04-28 10:08:55,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {15032#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15032#true} is VALID [2022-04-28 10:08:55,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {15032#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15032#true} is VALID [2022-04-28 10:08:55,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {15032#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15032#true} is VALID [2022-04-28 10:08:55,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {15032#true} call #t~ret15 := main(); {15032#true} is VALID [2022-04-28 10:08:55,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15032#true} {15032#true} #83#return; {15032#true} is VALID [2022-04-28 10:08:55,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {15032#true} assume true; {15032#true} is VALID [2022-04-28 10:08:55,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {15032#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15032#true} is VALID [2022-04-28 10:08:55,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {15032#true} call ULTIMATE.init(); {15032#true} is VALID [2022-04-28 10:08:55,093 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:08:55,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792533235] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:55,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:55,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 16 [2022-04-28 10:08:55,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:55,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1899628850] [2022-04-28 10:08:55,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1899628850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:55,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:55,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:08:55,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391283606] [2022-04-28 10:08:55,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:55,094 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 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:08:55,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:55,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call 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,109 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:55,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:08:55,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:55,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:08:55,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:08:55,110 INFO L87 Difference]: Start difference. First operand 118 states and 159 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call 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,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:56,412 INFO L93 Difference]: Finished difference Result 183 states and 240 transitions. [2022-04-28 10:08:56,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:08:56,412 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 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:08:56,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:56,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call 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,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2022-04-28 10:08:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call 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,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2022-04-28 10:08:56,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 78 transitions. [2022-04-28 10:08:56,468 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:08:56,470 INFO L225 Difference]: With dead ends: 183 [2022-04-28 10:08:56,470 INFO L226 Difference]: Without dead ends: 170 [2022-04-28 10:08:56,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 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:08:56,471 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 51 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:56,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 72 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:08:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-04-28 10:08:56,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 118. [2022-04-28 10:08:56,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:56,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 118 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call 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,739 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 118 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call 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,739 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 118 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call 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,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:56,741 INFO L93 Difference]: Finished difference Result 170 states and 225 transitions. [2022-04-28 10:08:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 225 transitions. [2022-04-28 10:08:56,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:56,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:56,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 170 states. [2022-04-28 10:08:56,742 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 170 states. [2022-04-28 10:08:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:56,744 INFO L93 Difference]: Finished difference Result 170 states and 225 transitions. [2022-04-28 10:08:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 225 transitions. [2022-04-28 10:08:56,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:56,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:56,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:56,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call 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,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 158 transitions. [2022-04-28 10:08:56,745 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 158 transitions. Word has length 26 [2022-04-28 10:08:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:56,745 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 158 transitions. [2022-04-28 10:08:56,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call 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,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 158 transitions. [2022-04-28 10:08:56,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 158 transitions. [2022-04-28 10:08:56,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:08:56,991 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:56,991 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:57,007 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:57,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:57,208 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:57,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:57,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1754741026, now seen corresponding path program 19 times [2022-04-28 10:08:57,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:57,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [260643295] [2022-04-28 10:08:57,210 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:57,210 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1754741026, now seen corresponding path program 20 times [2022-04-28 10:08:57,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:57,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180166695] [2022-04-28 10:08:57,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:57,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:57,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:57,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {16181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16164#true} is VALID [2022-04-28 10:08:57,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {16164#true} assume true; {16164#true} is VALID [2022-04-28 10:08:57,379 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16164#true} {16164#true} #83#return; {16164#true} is VALID [2022-04-28 10:08:57,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {16164#true} call ULTIMATE.init(); {16181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:57,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {16181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16164#true} is VALID [2022-04-28 10:08:57,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {16164#true} assume true; {16164#true} is VALID [2022-04-28 10:08:57,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16164#true} {16164#true} #83#return; {16164#true} is VALID [2022-04-28 10:08:57,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {16164#true} call #t~ret15 := main(); {16164#true} is VALID [2022-04-28 10:08:57,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {16164#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16169#(= main_~y~0 0)} is VALID [2022-04-28 10:08:57,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {16169#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16170#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:57,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {16170#(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; {16171#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:57,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {16171#(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; {16172#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:57,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {16172#(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; {16173#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:57,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {16173#(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; {16174#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:57,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {16174#(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; {16175#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:57,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {16175#(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; {16176#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:57,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {16176#(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; {16177#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:57,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {16177#(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; {16178#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:57,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {16178#(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; {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:57,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:57,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {16180#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:57,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {16180#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-28 10:08:57,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {16165#false} assume !(~y~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-28 10:08:57,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {16165#false} assume !(~x~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-28 10:08:57,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {16165#false} assume !(~z~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-28 10:08:57,399 INFO L272 TraceCheckUtils]: 22: Hoare triple {16165#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16165#false} is VALID [2022-04-28 10:08:57,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {16165#false} ~cond := #in~cond; {16165#false} is VALID [2022-04-28 10:08:57,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {16165#false} assume 0 == ~cond; {16165#false} is VALID [2022-04-28 10:08:57,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {16165#false} assume !false; {16165#false} is VALID [2022-04-28 10:08:57,400 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:08:57,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:57,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180166695] [2022-04-28 10:08:57,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180166695] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:57,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034717657] [2022-04-28 10:08:57,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:57,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:57,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:57,401 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:57,402 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:57,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:57,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:57,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:08:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:57,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:57,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {16164#true} call ULTIMATE.init(); {16164#true} is VALID [2022-04-28 10:08:57,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {16164#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16164#true} is VALID [2022-04-28 10:08:57,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {16164#true} assume true; {16164#true} is VALID [2022-04-28 10:08:57,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16164#true} {16164#true} #83#return; {16164#true} is VALID [2022-04-28 10:08:57,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {16164#true} call #t~ret15 := main(); {16164#true} is VALID [2022-04-28 10:08:57,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {16164#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16169#(= main_~y~0 0)} is VALID [2022-04-28 10:08:57,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {16169#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16170#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:57,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {16170#(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; {16171#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:57,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {16171#(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; {16172#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:57,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {16172#(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; {16173#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:57,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {16173#(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; {16174#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:57,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {16174#(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; {16175#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:57,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {16175#(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; {16176#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:57,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {16176#(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; {16177#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:57,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {16177#(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; {16178#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:57,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {16178#(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; {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:57,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:57,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {16179#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {16236#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:08:57,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {16236#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-28 10:08:57,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {16165#false} assume !(~y~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-28 10:08:57,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {16165#false} assume !(~x~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-28 10:08:57,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {16165#false} assume !(~z~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-28 10:08:57,716 INFO L272 TraceCheckUtils]: 22: Hoare triple {16165#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16165#false} is VALID [2022-04-28 10:08:57,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {16165#false} ~cond := #in~cond; {16165#false} is VALID [2022-04-28 10:08:57,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {16165#false} assume 0 == ~cond; {16165#false} is VALID [2022-04-28 10:08:57,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {16165#false} assume !false; {16165#false} is VALID [2022-04-28 10:08:57,716 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:08:57,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:57,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {16165#false} assume !false; {16165#false} is VALID [2022-04-28 10:08:57,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {16165#false} assume 0 == ~cond; {16165#false} is VALID [2022-04-28 10:08:57,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {16165#false} ~cond := #in~cond; {16165#false} is VALID [2022-04-28 10:08:57,995 INFO L272 TraceCheckUtils]: 22: Hoare triple {16165#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16165#false} is VALID [2022-04-28 10:08:57,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {16165#false} assume !(~z~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-28 10:08:57,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {16165#false} assume !(~x~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-28 10:08:57,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {16165#false} assume !(~y~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-28 10:08:57,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {16282#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {16165#false} is VALID [2022-04-28 10:08:57,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {16286#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {16282#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:57,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {16286#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16286#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:57,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {16293#(< 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; {16286#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:57,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {16297#(< 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; {16293#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:57,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {16301#(< 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; {16297#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:57,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {16305#(< 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; {16301#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:57,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {16309#(< 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; {16305#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:58,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {16313#(< 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; {16309#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:58,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {16317#(< 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; {16313#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:58,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {16321#(< 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; {16317#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:58,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {16325#(< 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; {16321#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:08:58,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {16329#(< 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; {16325#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:08:58,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {16164#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16329#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:08:58,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {16164#true} call #t~ret15 := main(); {16164#true} is VALID [2022-04-28 10:08:58,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16164#true} {16164#true} #83#return; {16164#true} is VALID [2022-04-28 10:08:58,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {16164#true} assume true; {16164#true} is VALID [2022-04-28 10:08:58,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {16164#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16164#true} is VALID [2022-04-28 10:08:58,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {16164#true} call ULTIMATE.init(); {16164#true} is VALID [2022-04-28 10:08:58,004 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:08:58,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034717657] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:58,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:58,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:08:58,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:58,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [260643295] [2022-04-28 10:08:58,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [260643295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:58,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:58,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:08:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565029839] [2022-04-28 10:08:58,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:58,005 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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:08:58,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:58,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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:08:58,021 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:08:58,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:08:58,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:58,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:08:58,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:08:58,022 INFO L87 Difference]: Start difference. First operand 118 states and 158 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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:01,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:01,297 INFO L93 Difference]: Finished difference Result 268 states and 386 transitions. [2022-04-28 10:09:01,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:09:01,297 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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:01,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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:01,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 153 transitions. [2022-04-28 10:09:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 153 transitions. [2022-04-28 10:09:01,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 153 transitions. [2022-04-28 10:09:01,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:01,429 INFO L225 Difference]: With dead ends: 268 [2022-04-28 10:09:01,429 INFO L226 Difference]: Without dead ends: 248 [2022-04-28 10:09:01,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:09:01,430 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 121 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:01,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 138 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:09:01,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-04-28 10:09:01,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 127. [2022-04-28 10:09:01,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:01,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 127 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 122 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call 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:01,734 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 127 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 122 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call 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:01,734 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 127 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 122 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call 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:01,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:01,737 INFO L93 Difference]: Finished difference Result 248 states and 325 transitions. [2022-04-28 10:09:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 325 transitions. [2022-04-28 10:09:01,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:01,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:01,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 122 states have internal predecessors, (167), 3 states have call successors, (3), 3 states 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:01,738 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 122 states have internal predecessors, (167), 3 states have call successors, (3), 3 states 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:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:01,741 INFO L93 Difference]: Finished difference Result 248 states and 325 transitions. [2022-04-28 10:09:01,741 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 325 transitions. [2022-04-28 10:09:01,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:01,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:01,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:01,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:01,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 122 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call 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:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 171 transitions. [2022-04-28 10:09:01,743 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 171 transitions. Word has length 26 [2022-04-28 10:09:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:01,743 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 171 transitions. [2022-04-28 10:09:01,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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:01,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 171 transitions. [2022-04-28 10:09:02,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 171 transitions. [2022-04-28 10:09:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:09:02,007 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:02,007 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:02,024 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:09:02,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 10:09:02,208 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:02,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:02,208 INFO L85 PathProgramCache]: Analyzing trace with hash 992117264, now seen corresponding path program 7 times [2022-04-28 10:09:02,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:02,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1882953335] [2022-04-28 10:09:02,210 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:02,211 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:02,211 INFO L85 PathProgramCache]: Analyzing trace with hash 992117264, now seen corresponding path program 8 times [2022-04-28 10:09:02,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:02,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123052212] [2022-04-28 10:09:02,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:02,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:02,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:02,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {17674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17660#true} is VALID [2022-04-28 10:09:02,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {17660#true} assume true; {17660#true} is VALID [2022-04-28 10:09:02,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17660#true} {17660#true} #83#return; {17660#true} is VALID [2022-04-28 10:09:02,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {17660#true} call ULTIMATE.init(); {17674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:02,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {17674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17660#true} is VALID [2022-04-28 10:09:02,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {17660#true} assume true; {17660#true} is VALID [2022-04-28 10:09:02,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17660#true} {17660#true} #83#return; {17660#true} is VALID [2022-04-28 10:09:02,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {17660#true} call #t~ret15 := main(); {17660#true} is VALID [2022-04-28 10:09:02,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {17660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17665#(= main_~y~0 0)} is VALID [2022-04-28 10:09:02,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {17665#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17666#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:02,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {17666#(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; {17667#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:02,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {17667#(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; {17668#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:02,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {17668#(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; {17669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:02,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {17669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:02,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {17669#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {17670#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:02,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {17670#(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; {17671#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:02,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {17671#(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; {17672#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:02,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {17672#(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; {17673#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:02,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {17673#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-28 10:09:02,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {17661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17661#false} is VALID [2022-04-28 10:09:02,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {17661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17661#false} is VALID [2022-04-28 10:09:02,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {17661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17661#false} is VALID [2022-04-28 10:09:02,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {17661#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17661#false} is VALID [2022-04-28 10:09:02,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {17661#false} assume !(~y~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-28 10:09:02,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {17661#false} assume !(~x~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-28 10:09:02,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {17661#false} assume !(~z~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-28 10:09:02,359 INFO L272 TraceCheckUtils]: 23: Hoare triple {17661#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17661#false} is VALID [2022-04-28 10:09:02,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {17661#false} ~cond := #in~cond; {17661#false} is VALID [2022-04-28 10:09:02,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {17661#false} assume 0 == ~cond; {17661#false} is VALID [2022-04-28 10:09:02,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {17661#false} assume !false; {17661#false} is VALID [2022-04-28 10:09:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:09:02,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:02,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123052212] [2022-04-28 10:09:02,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123052212] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:02,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456321] [2022-04-28 10:09:02,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:02,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:02,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:02,361 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:09:02,361 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:09:02,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:02,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:02,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:09:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:02,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:02,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {17660#true} call ULTIMATE.init(); {17660#true} is VALID [2022-04-28 10:09:02,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {17660#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17660#true} is VALID [2022-04-28 10:09:02,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {17660#true} assume true; {17660#true} is VALID [2022-04-28 10:09:02,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17660#true} {17660#true} #83#return; {17660#true} is VALID [2022-04-28 10:09:02,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {17660#true} call #t~ret15 := main(); {17660#true} is VALID [2022-04-28 10:09:02,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {17660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17660#true} is VALID [2022-04-28 10:09:02,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {17660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17660#true} is VALID [2022-04-28 10:09:02,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {17660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:02,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17703#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:02,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {17703#(< 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; {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:02,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:02,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:02,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17703#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:02,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {17703#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:02,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-28 10:09:02,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {17661#false} assume !(~z~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-28 10:09:02,520 INFO L272 TraceCheckUtils]: 23: Hoare triple {17661#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17661#false} is VALID [2022-04-28 10:09:02,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {17661#false} ~cond := #in~cond; {17661#false} is VALID [2022-04-28 10:09:02,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {17661#false} assume 0 == ~cond; {17661#false} is VALID [2022-04-28 10:09:02,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {17661#false} assume !false; {17661#false} is VALID [2022-04-28 10:09:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:09:02,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:02,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {17661#false} assume !false; {17661#false} is VALID [2022-04-28 10:09:02,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {17661#false} assume 0 == ~cond; {17661#false} is VALID [2022-04-28 10:09:02,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {17661#false} ~cond := #in~cond; {17661#false} is VALID [2022-04-28 10:09:02,597 INFO L272 TraceCheckUtils]: 23: Hoare triple {17661#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17661#false} is VALID [2022-04-28 10:09:02,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {17661#false} assume !(~z~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-28 10:09:02,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {17661#false} is VALID [2022-04-28 10:09:02,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {17723#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17723#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:02,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {17703#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:02,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17703#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:02,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:02,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:02,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {17703#(< 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; {17707#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:02,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17703#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:02,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {17660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17699#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:02,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {17660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17660#true} is VALID [2022-04-28 10:09:02,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {17660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17660#true} is VALID [2022-04-28 10:09:02,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {17660#true} call #t~ret15 := main(); {17660#true} is VALID [2022-04-28 10:09:02,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17660#true} {17660#true} #83#return; {17660#true} is VALID [2022-04-28 10:09:02,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {17660#true} assume true; {17660#true} is VALID [2022-04-28 10:09:02,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {17660#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17660#true} is VALID [2022-04-28 10:09:02,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {17660#true} call ULTIMATE.init(); {17660#true} is VALID [2022-04-28 10:09:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:09:02,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456321] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:02,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:02,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-28 10:09:02,604 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:02,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1882953335] [2022-04-28 10:09:02,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1882953335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:02,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:02,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:09:02,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025795695] [2022-04-28 10:09:02,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:02,605 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 27 [2022-04-28 10:09:02,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:02,605 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:02,628 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:02,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:09:02,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:02,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:09:02,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:09:02,629 INFO L87 Difference]: Start difference. First operand 127 states and 171 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:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:04,059 INFO L93 Difference]: Finished difference Result 192 states and 253 transitions. [2022-04-28 10:09:04,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:09:04,059 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 27 [2022-04-28 10:09:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:04,059 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:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 82 transitions. [2022-04-28 10:09:04,060 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:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 82 transitions. [2022-04-28 10:09:04,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 82 transitions. [2022-04-28 10:09:04,119 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:09:04,121 INFO L225 Difference]: With dead ends: 192 [2022-04-28 10:09:04,121 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 10:09:04,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:09:04,122 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 50 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:04,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 72 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:09:04,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 10:09:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 128. [2022-04-28 10:09:04,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:04,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call 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,422 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call 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,422 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call 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,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:04,424 INFO L93 Difference]: Finished difference Result 173 states and 231 transitions. [2022-04-28 10:09:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 231 transitions. [2022-04-28 10:09:04,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:04,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:04,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-28 10:09:04,425 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-28 10:09:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:04,426 INFO L93 Difference]: Finished difference Result 173 states and 231 transitions. [2022-04-28 10:09:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 231 transitions. [2022-04-28 10:09:04,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:04,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:04,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:04,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call 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 L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 171 transitions. [2022-04-28 10:09:04,428 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 171 transitions. Word has length 27 [2022-04-28 10:09:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:04,428 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 171 transitions. [2022-04-28 10:09:04,428 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:04,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 171 transitions. [2022-04-28 10:09:04,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:04,688 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 171 transitions. [2022-04-28 10:09:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:09:04,689 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:04,689 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:04,705 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:04,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 10:09:04,889 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:04,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:04,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1003454959, now seen corresponding path program 21 times [2022-04-28 10:09:04,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:04,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772020819] [2022-04-28 10:09:04,892 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:04,892 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:04,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1003454959, now seen corresponding path program 22 times [2022-04-28 10:09:04,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:04,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784632202] [2022-04-28 10:09:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:04,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:05,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:05,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {18868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18850#true} is VALID [2022-04-28 10:09:05,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {18850#true} assume true; {18850#true} is VALID [2022-04-28 10:09:05,140 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18850#true} {18850#true} #83#return; {18850#true} is VALID [2022-04-28 10:09:05,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {18850#true} call ULTIMATE.init(); {18868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:05,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {18868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18850#true} is VALID [2022-04-28 10:09:05,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {18850#true} assume true; {18850#true} is VALID [2022-04-28 10:09:05,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18850#true} {18850#true} #83#return; {18850#true} is VALID [2022-04-28 10:09:05,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {18850#true} call #t~ret15 := main(); {18850#true} is VALID [2022-04-28 10:09:05,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {18850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18855#(= main_~y~0 0)} is VALID [2022-04-28 10:09:05,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {18855#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:05,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {18856#(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; {18857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:05,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {18857#(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; {18858#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:05,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {18858#(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; {18859#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:05,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {18859#(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; {18860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:05,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {18860#(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; {18861#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:05,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {18861#(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; {18862#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:05,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {18862#(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; {18863#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:05,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {18863#(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; {18864#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:05,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {18864#(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; {18865#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:05,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {18865#(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; {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:05,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:05,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {18867#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:05,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {18867#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-28 10:09:05,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {18851#false} assume !(~y~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-28 10:09:05,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {18851#false} assume !(~x~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-28 10:09:05,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {18851#false} assume !(~z~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-28 10:09:05,148 INFO L272 TraceCheckUtils]: 23: Hoare triple {18851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18851#false} is VALID [2022-04-28 10:09:05,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {18851#false} ~cond := #in~cond; {18851#false} is VALID [2022-04-28 10:09:05,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {18851#false} assume 0 == ~cond; {18851#false} is VALID [2022-04-28 10:09:05,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {18851#false} assume !false; {18851#false} is VALID [2022-04-28 10:09:05,148 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:05,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:05,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784632202] [2022-04-28 10:09:05,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784632202] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:05,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716526164] [2022-04-28 10:09:05,148 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:05,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:05,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:05,149 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:05,150 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:05,183 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:05,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:05,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:09:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:05,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:05,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {18850#true} call ULTIMATE.init(); {18850#true} is VALID [2022-04-28 10:09:05,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {18850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18850#true} is VALID [2022-04-28 10:09:05,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {18850#true} assume true; {18850#true} is VALID [2022-04-28 10:09:05,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18850#true} {18850#true} #83#return; {18850#true} is VALID [2022-04-28 10:09:05,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {18850#true} call #t~ret15 := main(); {18850#true} is VALID [2022-04-28 10:09:05,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {18850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18855#(= main_~y~0 0)} is VALID [2022-04-28 10:09:05,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {18855#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:05,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {18856#(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; {18857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:05,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {18857#(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; {18858#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:05,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {18858#(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; {18859#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:05,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {18859#(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; {18860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:05,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {18860#(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; {18861#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:05,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {18861#(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; {18862#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:05,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {18862#(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; {18863#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:05,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {18863#(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; {18864#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:05,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {18864#(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; {18865#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:05,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {18865#(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; {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:05,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:05,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {18866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {18926#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:05,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {18926#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-28 10:09:05,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {18851#false} assume !(~y~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-28 10:09:05,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {18851#false} assume !(~x~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-28 10:09:05,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {18851#false} assume !(~z~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-28 10:09:05,445 INFO L272 TraceCheckUtils]: 23: Hoare triple {18851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18851#false} is VALID [2022-04-28 10:09:05,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {18851#false} ~cond := #in~cond; {18851#false} is VALID [2022-04-28 10:09:05,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {18851#false} assume 0 == ~cond; {18851#false} is VALID [2022-04-28 10:09:05,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {18851#false} assume !false; {18851#false} is VALID [2022-04-28 10:09:05,445 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:05,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:05,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {18851#false} assume !false; {18851#false} is VALID [2022-04-28 10:09:05,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {18851#false} assume 0 == ~cond; {18851#false} is VALID [2022-04-28 10:09:05,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {18851#false} ~cond := #in~cond; {18851#false} is VALID [2022-04-28 10:09:05,776 INFO L272 TraceCheckUtils]: 23: Hoare triple {18851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18851#false} is VALID [2022-04-28 10:09:05,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {18851#false} assume !(~z~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-28 10:09:05,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {18851#false} assume !(~x~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-28 10:09:05,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {18851#false} assume !(~y~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-28 10:09:05,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {18972#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18851#false} is VALID [2022-04-28 10:09:05,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {18976#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {18972#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:05,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {18976#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {18976#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:05,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {18983#(< 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; {18976#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:05,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {18987#(< 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; {18983#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:05,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {18991#(< 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; {18987#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:05,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {18995#(< 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; {18991#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:05,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {18999#(< 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; {18995#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:05,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {19003#(< 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; {18999#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:05,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {19007#(< 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; {19003#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:05,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {19011#(< 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; {19007#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:05,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {19015#(< 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; {19011#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:05,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {19019#(< 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; {19015#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:05,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {19023#(< 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; {19019#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:05,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {18850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19023#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:09:05,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {18850#true} call #t~ret15 := main(); {18850#true} is VALID [2022-04-28 10:09:05,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18850#true} {18850#true} #83#return; {18850#true} is VALID [2022-04-28 10:09:05,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {18850#true} assume true; {18850#true} is VALID [2022-04-28 10:09:05,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {18850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18850#true} is VALID [2022-04-28 10:09:05,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {18850#true} call ULTIMATE.init(); {18850#true} is VALID [2022-04-28 10:09:05,784 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:05,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716526164] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:05,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:05,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:09:05,785 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:05,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772020819] [2022-04-28 10:09:05,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772020819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:05,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:05,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:09:05,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397999465] [2022-04-28 10:09:05,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:05,785 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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:05,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:05,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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:05,800 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:05,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:09:05,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:05,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:09:05,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:09:05,801 INFO L87 Difference]: Start difference. First operand 128 states and 171 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:09,673 INFO L93 Difference]: Finished difference Result 289 states and 416 transitions. [2022-04-28 10:09:09,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:09:09,673 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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:09,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 165 transitions. [2022-04-28 10:09:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 165 transitions. [2022-04-28 10:09:09,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 165 transitions. [2022-04-28 10:09:09,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:09,823 INFO L225 Difference]: With dead ends: 289 [2022-04-28 10:09:09,823 INFO L226 Difference]: Without dead ends: 269 [2022-04-28 10:09:09,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:09:09,824 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 135 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:09,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 150 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:09:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-04-28 10:09:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 137. [2022-04-28 10:09:10,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:10,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call 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:10,151 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call 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:10,151 INFO L87 Difference]: Start difference. First operand 269 states. Second operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call 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:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:10,154 INFO L93 Difference]: Finished difference Result 269 states and 352 transitions. [2022-04-28 10:09:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 352 transitions. [2022-04-28 10:09:10,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:10,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:10,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 269 states. [2022-04-28 10:09:10,155 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 269 states. [2022-04-28 10:09:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:10,158 INFO L93 Difference]: Finished difference Result 269 states and 352 transitions. [2022-04-28 10:09:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 352 transitions. [2022-04-28 10:09:10,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:10,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:10,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:10,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call 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:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 184 transitions. [2022-04-28 10:09:10,160 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 184 transitions. Word has length 27 [2022-04-28 10:09:10,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:10,160 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 184 transitions. [2022-04-28 10:09:10,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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:10,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 184 transitions. [2022-04-28 10:09:10,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 184 transitions. [2022-04-28 10:09:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:09:10,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:10,467 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:10,484 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:10,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 10:09:10,668 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:10,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:10,668 INFO L85 PathProgramCache]: Analyzing trace with hash 349794051, now seen corresponding path program 5 times [2022-04-28 10:09:10,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:10,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1494051963] [2022-04-28 10:09:10,670 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:10,670 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:10,670 INFO L85 PathProgramCache]: Analyzing trace with hash 349794051, now seen corresponding path program 6 times [2022-04-28 10:09:10,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:10,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62821458] [2022-04-28 10:09:10,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:10,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:10,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:10,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {20471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20460#true} is VALID [2022-04-28 10:09:10,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {20460#true} assume true; {20460#true} is VALID [2022-04-28 10:09:10,771 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20460#true} {20460#true} #83#return; {20460#true} is VALID [2022-04-28 10:09:10,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {20460#true} call ULTIMATE.init(); {20471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:10,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {20471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20460#true} is VALID [2022-04-28 10:09:10,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {20460#true} assume true; {20460#true} is VALID [2022-04-28 10:09:10,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20460#true} {20460#true} #83#return; {20460#true} is VALID [2022-04-28 10:09:10,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {20460#true} call #t~ret15 := main(); {20460#true} is VALID [2022-04-28 10:09:10,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {20460#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20460#true} is VALID [2022-04-28 10:09:10,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {20460#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20465#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:10,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {20465#(<= 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; {20466#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:09:10,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {20466#(<= 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; {20467#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:10,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {20467#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {20467#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:10,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {20467#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {20467#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:10,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {20467#(<= (* 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; {20468#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:10,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {20468#(<= (+ (* (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; {20469#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:10,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {20469#(<= (+ 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; {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:10,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:10,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {20470#(<= (+ 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; {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:10,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {20470#(<= (+ 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; {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:10,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {20470#(<= (+ 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; {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:10,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:10,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {20470#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {20461#false} is VALID [2022-04-28 10:09:10,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-28 10:09:10,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-28 10:09:10,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-28 10:09:10,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {20461#false} assume !(~z~0 % 4294967296 > 0); {20461#false} is VALID [2022-04-28 10:09:10,782 INFO L272 TraceCheckUtils]: 24: Hoare triple {20461#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20461#false} is VALID [2022-04-28 10:09:10,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {20461#false} ~cond := #in~cond; {20461#false} is VALID [2022-04-28 10:09:10,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {20461#false} assume 0 == ~cond; {20461#false} is VALID [2022-04-28 10:09:10,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {20461#false} assume !false; {20461#false} is VALID [2022-04-28 10:09:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:10,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:10,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62821458] [2022-04-28 10:09:10,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62821458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:10,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009929743] [2022-04-28 10:09:10,783 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:10,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:10,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:10,784 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:10,801 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:10,836 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:09:10,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:10,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:09:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:10,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:11,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {20460#true} call ULTIMATE.init(); {20460#true} is VALID [2022-04-28 10:09:11,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {20460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20460#true} is VALID [2022-04-28 10:09:11,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {20460#true} assume true; {20460#true} is VALID [2022-04-28 10:09:11,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20460#true} {20460#true} #83#return; {20460#true} is VALID [2022-04-28 10:09:11,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {20460#true} call #t~ret15 := main(); {20460#true} is VALID [2022-04-28 10:09:11,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {20460#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20460#true} is VALID [2022-04-28 10:09:11,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {20460#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20465#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:11,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {20465#(<= 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; {20496#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:11,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {20496#(<= 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; {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {20500#(<= 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; {20496#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:11,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {20496#(<= 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; {20465#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:11,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {20465#(<= 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; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {20516#(<= 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; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {20516#(<= 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; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {20516#(<= 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; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20461#false} is VALID [2022-04-28 10:09:11,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-28 10:09:11,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-28 10:09:11,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-28 10:09:11,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {20461#false} assume !(~z~0 % 4294967296 > 0); {20461#false} is VALID [2022-04-28 10:09:11,116 INFO L272 TraceCheckUtils]: 24: Hoare triple {20461#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20461#false} is VALID [2022-04-28 10:09:11,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {20461#false} ~cond := #in~cond; {20461#false} is VALID [2022-04-28 10:09:11,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {20461#false} assume 0 == ~cond; {20461#false} is VALID [2022-04-28 10:09:11,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {20461#false} assume !false; {20461#false} is VALID [2022-04-28 10:09:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:11,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:11,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {20461#false} assume !false; {20461#false} is VALID [2022-04-28 10:09:11,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {20461#false} assume 0 == ~cond; {20461#false} is VALID [2022-04-28 10:09:11,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {20461#false} ~cond := #in~cond; {20461#false} is VALID [2022-04-28 10:09:11,223 INFO L272 TraceCheckUtils]: 24: Hoare triple {20461#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20461#false} is VALID [2022-04-28 10:09:11,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {20461#false} assume !(~z~0 % 4294967296 > 0); {20461#false} is VALID [2022-04-28 10:09:11,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-28 10:09:11,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-28 10:09:11,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {20461#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20461#false} is VALID [2022-04-28 10:09:11,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20461#false} is VALID [2022-04-28 10:09:11,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {20516#(<= 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; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {20516#(<= 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; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {20516#(<= 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; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {20465#(<= 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; {20516#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {20496#(<= 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; {20465#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:11,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {20500#(<= 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; {20496#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:11,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {20496#(<= 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; {20500#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:11,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {20465#(<= 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; {20496#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:11,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {20460#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20465#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:11,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {20460#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20460#true} is VALID [2022-04-28 10:09:11,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {20460#true} call #t~ret15 := main(); {20460#true} is VALID [2022-04-28 10:09:11,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20460#true} {20460#true} #83#return; {20460#true} is VALID [2022-04-28 10:09:11,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {20460#true} assume true; {20460#true} is VALID [2022-04-28 10:09:11,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {20460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20460#true} is VALID [2022-04-28 10:09:11,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {20460#true} call ULTIMATE.init(); {20460#true} is VALID [2022-04-28 10:09:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:11,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009929743] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:11,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:11,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-04-28 10:09:11,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:11,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1494051963] [2022-04-28 10:09:11,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1494051963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:11,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:11,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:09:11,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675881111] [2022-04-28 10:09:11,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:11,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:11,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:11,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:11,251 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:11,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:09:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:11,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:09:11,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:09:11,252 INFO L87 Difference]: Start difference. First operand 137 states and 184 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:12,277 INFO L93 Difference]: Finished difference Result 193 states and 269 transitions. [2022-04-28 10:09:12,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:09:12,277 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-28 10:09:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-28 10:09:12,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2022-04-28 10:09:12,341 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:09:12,342 INFO L225 Difference]: With dead ends: 193 [2022-04-28 10:09:12,342 INFO L226 Difference]: Without dead ends: 183 [2022-04-28 10:09:12,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 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:09:12,343 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 64 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:12,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:12,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-28 10:09:12,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 164. [2022-04-28 10:09:12,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:12,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 164 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 159 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call 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:12,807 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 164 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 159 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call 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:12,807 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 164 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 159 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call 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:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:12,809 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2022-04-28 10:09:12,809 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 250 transitions. [2022-04-28 10:09:12,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:12,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:12,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 159 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 183 states. [2022-04-28 10:09:12,809 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 159 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 183 states. [2022-04-28 10:09:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:12,811 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2022-04-28 10:09:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 250 transitions. [2022-04-28 10:09:12,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:12,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:12,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:12,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 159 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call 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:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 221 transitions. [2022-04-28 10:09:12,814 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 221 transitions. Word has length 28 [2022-04-28 10:09:12,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:12,814 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 221 transitions. [2022-04-28 10:09:12,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:12,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 221 transitions. [2022-04-28 10:09:13,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 221 transitions. [2022-04-28 10:09:13,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:09:13,238 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:13,238 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:13,257 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:13,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:13,439 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:13,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:13,439 INFO L85 PathProgramCache]: Analyzing trace with hash 401313666, now seen corresponding path program 9 times [2022-04-28 10:09:13,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:13,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [91076361] [2022-04-28 10:09:13,441 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:13,441 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:13,441 INFO L85 PathProgramCache]: Analyzing trace with hash 401313666, now seen corresponding path program 10 times [2022-04-28 10:09:13,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:13,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229437567] [2022-04-28 10:09:13,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:13,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:13,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:13,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {21750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21734#true} is VALID [2022-04-28 10:09:13,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {21734#true} assume true; {21734#true} is VALID [2022-04-28 10:09:13,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21734#true} {21734#true} #83#return; {21734#true} is VALID [2022-04-28 10:09:13,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {21734#true} call ULTIMATE.init(); {21750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:13,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {21750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21734#true} is VALID [2022-04-28 10:09:13,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {21734#true} assume true; {21734#true} is VALID [2022-04-28 10:09:13,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21734#true} {21734#true} #83#return; {21734#true} is VALID [2022-04-28 10:09:13,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {21734#true} call #t~ret15 := main(); {21734#true} is VALID [2022-04-28 10:09:13,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {21734#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21739#(= main_~y~0 0)} is VALID [2022-04-28 10:09:13,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {21739#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21740#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:13,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {21740#(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; {21741#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:13,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {21741#(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; {21742#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:13,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {21742#(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; {21743#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:13,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {21743#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {21743#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:13,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {21743#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {21744#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:13,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {21744#(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; {21745#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:13,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {21745#(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; {21746#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:13,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {21746#(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; {21747#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:13,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {21747#(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; {21748#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:13,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {21748#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {21748#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:13,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {21748#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21747#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:13,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {21747#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21746#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:13,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {21746#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21745#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:13,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {21745#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21749#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:13,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {21749#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {21749#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:13,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {21749#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {21749#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:13,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {21749#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {21735#false} is VALID [2022-04-28 10:09:13,635 INFO L272 TraceCheckUtils]: 24: Hoare triple {21735#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21735#false} is VALID [2022-04-28 10:09:13,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {21735#false} ~cond := #in~cond; {21735#false} is VALID [2022-04-28 10:09:13,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {21735#false} assume 0 == ~cond; {21735#false} is VALID [2022-04-28 10:09:13,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {21735#false} assume !false; {21735#false} is VALID [2022-04-28 10:09:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:13,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:13,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229437567] [2022-04-28 10:09:13,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229437567] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:13,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123404595] [2022-04-28 10:09:13,636 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:13,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:13,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:13,638 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:13,638 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:13,671 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:13,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:13,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 10:09:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:13,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:13,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {21734#true} call ULTIMATE.init(); {21734#true} is VALID [2022-04-28 10:09:13,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {21734#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21734#true} is VALID [2022-04-28 10:09:13,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {21734#true} assume true; {21734#true} is VALID [2022-04-28 10:09:13,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21734#true} {21734#true} #83#return; {21734#true} is VALID [2022-04-28 10:09:13,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {21734#true} call #t~ret15 := main(); {21734#true} is VALID [2022-04-28 10:09:13,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {21734#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21734#true} is VALID [2022-04-28 10:09:13,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {21734#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:13,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21776#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:13,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {21776#(< 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; {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:13,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:13,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:13,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:13,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:13,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21776#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:13,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {21776#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:13,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:13,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:13,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:13,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:13,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:13,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:13,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:13,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {21735#false} is VALID [2022-04-28 10:09:13,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {21735#false} assume !(~z~0 % 4294967296 > 0); {21735#false} is VALID [2022-04-28 10:09:13,865 INFO L272 TraceCheckUtils]: 24: Hoare triple {21735#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21735#false} is VALID [2022-04-28 10:09:13,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {21735#false} ~cond := #in~cond; {21735#false} is VALID [2022-04-28 10:09:13,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {21735#false} assume 0 == ~cond; {21735#false} is VALID [2022-04-28 10:09:13,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {21735#false} assume !false; {21735#false} is VALID [2022-04-28 10:09:13,866 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:13,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:13,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {21735#false} assume !false; {21735#false} is VALID [2022-04-28 10:09:13,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {21735#false} assume 0 == ~cond; {21735#false} is VALID [2022-04-28 10:09:13,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {21735#false} ~cond := #in~cond; {21735#false} is VALID [2022-04-28 10:09:13,960 INFO L272 TraceCheckUtils]: 24: Hoare triple {21735#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21735#false} is VALID [2022-04-28 10:09:13,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {21735#false} assume !(~z~0 % 4294967296 > 0); {21735#false} is VALID [2022-04-28 10:09:13,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {21735#false} is VALID [2022-04-28 10:09:13,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:13,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:13,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:13,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:13,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:13,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {21803#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:13,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21803#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:13,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {21776#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:13,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21776#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:13,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:13,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:13,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:13,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21784#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:13,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {21776#(< 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; {21780#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:13,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21776#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:13,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {21734#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21772#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:13,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {21734#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21734#true} is VALID [2022-04-28 10:09:13,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {21734#true} call #t~ret15 := main(); {21734#true} is VALID [2022-04-28 10:09:13,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21734#true} {21734#true} #83#return; {21734#true} is VALID [2022-04-28 10:09:13,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {21734#true} assume true; {21734#true} is VALID [2022-04-28 10:09:13,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {21734#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21734#true} is VALID [2022-04-28 10:09:13,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {21734#true} call ULTIMATE.init(); {21734#true} is VALID [2022-04-28 10:09:13,968 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:13,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123404595] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:13,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:13,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-28 10:09:13,968 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:13,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [91076361] [2022-04-28 10:09:13,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [91076361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:13,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:13,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:09:13,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049681304] [2022-04-28 10:09:13,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:13,969 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:13,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:13,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:13,989 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:13,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:09:13,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:13,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:09:13,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:09:13,990 INFO L87 Difference]: Start difference. First operand 164 states and 221 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,809 INFO L93 Difference]: Finished difference Result 235 states and 332 transitions. [2022-04-28 10:09:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 10:09:16,809 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:16,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 148 transitions. [2022-04-28 10:09:16,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 148 transitions. [2022-04-28 10:09:16,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 148 transitions. [2022-04-28 10:09:16,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:16,939 INFO L225 Difference]: With dead ends: 235 [2022-04-28 10:09:16,939 INFO L226 Difference]: Without dead ends: 222 [2022-04-28 10:09:16,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=2605, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:09:16,940 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 60 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:16,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 77 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:09:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-28 10:09:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 171. [2022-04-28 10:09:17,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:17,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 171 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call 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,461 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 171 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call 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,461 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 171 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call 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,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:17,464 INFO L93 Difference]: Finished difference Result 222 states and 286 transitions. [2022-04-28 10:09:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 286 transitions. [2022-04-28 10:09:17,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:17,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:17,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-28 10:09:17,465 INFO L87 Difference]: Start difference. First operand has 171 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-28 10:09:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:17,467 INFO L93 Difference]: Finished difference Result 222 states and 286 transitions. [2022-04-28 10:09:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 286 transitions. [2022-04-28 10:09:17,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:17,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:17,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:17,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call 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,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 228 transitions. [2022-04-28 10:09:17,470 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 228 transitions. Word has length 28 [2022-04-28 10:09:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:17,470 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 228 transitions. [2022-04-28 10:09:17,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:17,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 228 transitions. [2022-04-28 10:09:17,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 228 transitions. [2022-04-28 10:09:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:09:17,901 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:17,901 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:17,917 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:18,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 10:09:18,114 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:18,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:18,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1899162222, now seen corresponding path program 7 times [2022-04-28 10:09:18,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:18,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [868963207] [2022-04-28 10:09:18,118 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:18,118 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1899162222, now seen corresponding path program 8 times [2022-04-28 10:09:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:18,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038005343] [2022-04-28 10:09:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:18,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:18,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:18,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {23262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23249#true} is VALID [2022-04-28 10:09:18,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {23249#true} assume true; {23249#true} is VALID [2022-04-28 10:09:18,231 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23249#true} {23249#true} #83#return; {23249#true} is VALID [2022-04-28 10:09:18,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {23249#true} call ULTIMATE.init(); {23262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:18,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {23262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23249#true} is VALID [2022-04-28 10:09:18,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {23249#true} assume true; {23249#true} is VALID [2022-04-28 10:09:18,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23249#true} {23249#true} #83#return; {23249#true} is VALID [2022-04-28 10:09:18,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {23249#true} call #t~ret15 := main(); {23249#true} is VALID [2022-04-28 10:09:18,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {23249#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23254#(= main_~y~0 0)} is VALID [2022-04-28 10:09:18,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {23254#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23255#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:18,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {23255#(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; {23256#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:18,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {23256#(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; {23257#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:18,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {23257#(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; {23258#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:18,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {23258#(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; {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:18,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:18,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {23260#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:18,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {23260#(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; {23261#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:18,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {23261#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-28 10:09:18,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-28 10:09:18,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-28 10:09:18,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-28 10:09:18,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-28 10:09:18,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-28 10:09:18,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {23250#false} assume !(~y~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-28 10:09:18,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {23250#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23250#false} is VALID [2022-04-28 10:09:18,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {23250#false} assume !(~x~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-28 10:09:18,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {23250#false} assume !(~z~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-28 10:09:18,237 INFO L272 TraceCheckUtils]: 24: Hoare triple {23250#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23250#false} is VALID [2022-04-28 10:09:18,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {23250#false} ~cond := #in~cond; {23250#false} is VALID [2022-04-28 10:09:18,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {23250#false} assume 0 == ~cond; {23250#false} is VALID [2022-04-28 10:09:18,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {23250#false} assume !false; {23250#false} is VALID [2022-04-28 10:09:18,238 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:18,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:18,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038005343] [2022-04-28 10:09:18,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038005343] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:18,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216188193] [2022-04-28 10:09:18,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:18,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:18,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:18,239 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:18,240 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:18,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:18,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:18,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:09:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:18,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:18,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {23249#true} call ULTIMATE.init(); {23249#true} is VALID [2022-04-28 10:09:18,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {23249#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23249#true} is VALID [2022-04-28 10:09:18,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {23249#true} assume true; {23249#true} is VALID [2022-04-28 10:09:18,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23249#true} {23249#true} #83#return; {23249#true} is VALID [2022-04-28 10:09:18,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {23249#true} call #t~ret15 := main(); {23249#true} is VALID [2022-04-28 10:09:18,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {23249#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23254#(= main_~y~0 0)} is VALID [2022-04-28 10:09:18,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {23254#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23255#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:18,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {23255#(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; {23256#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:18,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {23256#(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; {23257#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:18,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {23257#(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; {23258#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:18,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {23258#(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; {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:18,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:18,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {23259#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {23260#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:18,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {23260#(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; {23305#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:18,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {23305#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-28 10:09:18,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-28 10:09:18,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-28 10:09:18,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-28 10:09:18,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-28 10:09:18,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-28 10:09:18,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {23250#false} assume !(~y~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-28 10:09:18,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {23250#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23250#false} is VALID [2022-04-28 10:09:18,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {23250#false} assume !(~x~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-28 10:09:18,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {23250#false} assume !(~z~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-28 10:09:18,478 INFO L272 TraceCheckUtils]: 24: Hoare triple {23250#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23250#false} is VALID [2022-04-28 10:09:18,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {23250#false} ~cond := #in~cond; {23250#false} is VALID [2022-04-28 10:09:18,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {23250#false} assume 0 == ~cond; {23250#false} is VALID [2022-04-28 10:09:18,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {23250#false} assume !false; {23250#false} is VALID [2022-04-28 10:09:18,478 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:18,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:18,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {23250#false} assume !false; {23250#false} is VALID [2022-04-28 10:09:18,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {23250#false} assume 0 == ~cond; {23250#false} is VALID [2022-04-28 10:09:18,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {23250#false} ~cond := #in~cond; {23250#false} is VALID [2022-04-28 10:09:18,635 INFO L272 TraceCheckUtils]: 24: Hoare triple {23250#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23250#false} is VALID [2022-04-28 10:09:18,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {23250#false} assume !(~z~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-28 10:09:18,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {23250#false} assume !(~x~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-28 10:09:18,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {23250#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23250#false} is VALID [2022-04-28 10:09:18,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {23250#false} assume !(~y~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-28 10:09:18,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-28 10:09:18,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-28 10:09:18,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-28 10:09:18,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-28 10:09:18,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {23250#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23250#false} is VALID [2022-04-28 10:09:18,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {23387#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {23250#false} is VALID [2022-04-28 10:09:18,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {23391#(< 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; {23387#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:18,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {23395#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {23391#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:18,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {23395#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {23395#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:18,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {23402#(< 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; {23395#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:18,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {23406#(< 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; {23402#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:18,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {23410#(< 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; {23406#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:18,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {23414#(< 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; {23410#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:18,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {23418#(< 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; {23414#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:18,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {23249#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23418#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:18,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {23249#true} call #t~ret15 := main(); {23249#true} is VALID [2022-04-28 10:09:18,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23249#true} {23249#true} #83#return; {23249#true} is VALID [2022-04-28 10:09:18,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {23249#true} assume true; {23249#true} is VALID [2022-04-28 10:09:18,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {23249#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23249#true} is VALID [2022-04-28 10:09:18,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {23249#true} call ULTIMATE.init(); {23249#true} is VALID [2022-04-28 10:09:18,641 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:18,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216188193] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:18,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:18,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:09:18,641 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:18,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [868963207] [2022-04-28 10:09:18,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [868963207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:18,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:18,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:09:18,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704166282] [2022-04-28 10:09:18,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:18,642 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 28 [2022-04-28 10:09:18,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:18,642 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:18,659 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:18,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:09:18,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:18,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:09:18,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:09:18,661 INFO L87 Difference]: Start difference. First operand 171 states and 228 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:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:20,887 INFO L93 Difference]: Finished difference Result 265 states and 344 transitions. [2022-04-28 10:09:20,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:09:20,887 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 28 [2022-04-28 10:09:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:20,888 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:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2022-04-28 10:09:20,888 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:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2022-04-28 10:09:20,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 89 transitions. [2022-04-28 10:09:20,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:20,957 INFO L225 Difference]: With dead ends: 265 [2022-04-28 10:09:20,957 INFO L226 Difference]: Without dead ends: 251 [2022-04-28 10:09:20,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:09:20,958 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 62 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:20,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 84 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:09:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-04-28 10:09:21,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 171. [2022-04-28 10:09:21,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:21,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 171 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 166 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call 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,496 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 171 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 166 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call 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,496 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 171 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 166 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call 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,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:21,499 INFO L93 Difference]: Finished difference Result 251 states and 328 transitions. [2022-04-28 10:09:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 328 transitions. [2022-04-28 10:09:21,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:21,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:21,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 166 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 251 states. [2022-04-28 10:09:21,500 INFO L87 Difference]: Start difference. First operand has 171 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 166 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 251 states. [2022-04-28 10:09:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:21,510 INFO L93 Difference]: Finished difference Result 251 states and 328 transitions. [2022-04-28 10:09:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 328 transitions. [2022-04-28 10:09:21,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:21,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:21,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:21,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 166 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call 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,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 227 transitions. [2022-04-28 10:09:21,513 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 227 transitions. Word has length 28 [2022-04-28 10:09:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:21,513 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 227 transitions. [2022-04-28 10:09:21,513 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:21,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 227 transitions. [2022-04-28 10:09:21,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2022-04-28 10:09:21,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:09:21,972 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:21,972 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:21,991 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:22,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:22,173 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:22,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:22,173 INFO L85 PathProgramCache]: Analyzing trace with hash -811576638, now seen corresponding path program 23 times [2022-04-28 10:09:22,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:22,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1048791606] [2022-04-28 10:09:22,176 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:22,176 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:22,176 INFO L85 PathProgramCache]: Analyzing trace with hash -811576638, now seen corresponding path program 24 times [2022-04-28 10:09:22,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:22,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962689625] [2022-04-28 10:09:22,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:22,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:22,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:22,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {24850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24831#true} is VALID [2022-04-28 10:09:22,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {24831#true} assume true; {24831#true} is VALID [2022-04-28 10:09:22,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24831#true} {24831#true} #83#return; {24831#true} is VALID [2022-04-28 10:09:22,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {24831#true} call ULTIMATE.init(); {24850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:22,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {24850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24831#true} is VALID [2022-04-28 10:09:22,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {24831#true} assume true; {24831#true} is VALID [2022-04-28 10:09:22,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24831#true} {24831#true} #83#return; {24831#true} is VALID [2022-04-28 10:09:22,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {24831#true} call #t~ret15 := main(); {24831#true} is VALID [2022-04-28 10:09:22,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {24831#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24836#(= main_~y~0 0)} is VALID [2022-04-28 10:09:22,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {24836#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24837#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:22,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {24837#(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; {24838#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:22,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {24838#(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; {24839#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:22,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {24839#(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; {24840#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:22,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {24840#(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; {24841#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:22,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {24841#(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; {24842#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:22,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {24842#(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; {24843#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:22,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {24843#(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; {24844#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:22,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {24844#(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; {24845#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:22,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {24845#(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; {24846#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:22,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {24846#(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; {24847#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:22,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {24847#(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; {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:22,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:22,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {24849#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-28 10:09:22,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {24849#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-28 10:09:22,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {24832#false} assume !(~y~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-28 10:09:22,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {24832#false} assume !(~x~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-28 10:09:22,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {24832#false} assume !(~z~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-28 10:09:22,433 INFO L272 TraceCheckUtils]: 24: Hoare triple {24832#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24832#false} is VALID [2022-04-28 10:09:22,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {24832#false} ~cond := #in~cond; {24832#false} is VALID [2022-04-28 10:09:22,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {24832#false} assume 0 == ~cond; {24832#false} is VALID [2022-04-28 10:09:22,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {24832#false} assume !false; {24832#false} is VALID [2022-04-28 10:09:22,433 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:22,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:22,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962689625] [2022-04-28 10:09:22,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962689625] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:22,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296846437] [2022-04-28 10:09:22,434 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:22,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:22,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:22,435 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:22,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:22,514 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:09:22,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:22,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:09:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:22,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:22,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {24831#true} call ULTIMATE.init(); {24831#true} is VALID [2022-04-28 10:09:22,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {24831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24831#true} is VALID [2022-04-28 10:09:22,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {24831#true} assume true; {24831#true} is VALID [2022-04-28 10:09:22,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24831#true} {24831#true} #83#return; {24831#true} is VALID [2022-04-28 10:09:22,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {24831#true} call #t~ret15 := main(); {24831#true} is VALID [2022-04-28 10:09:22,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {24831#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24836#(= main_~y~0 0)} is VALID [2022-04-28 10:09:22,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {24836#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24837#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:22,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {24837#(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; {24838#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:22,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {24838#(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; {24839#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:22,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {24839#(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; {24840#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:22,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {24840#(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; {24841#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:22,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {24841#(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; {24842#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:22,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {24842#(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; {24843#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:22,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {24843#(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; {24844#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:22,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {24844#(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; {24845#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:22,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {24845#(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; {24846#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:22,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {24846#(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; {24847#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:22,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {24847#(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; {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:22,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:22,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {24848#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {24911#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:09:22,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {24911#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-28 10:09:22,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {24832#false} assume !(~y~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-28 10:09:22,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {24832#false} assume !(~x~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-28 10:09:22,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {24832#false} assume !(~z~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-28 10:09:22,782 INFO L272 TraceCheckUtils]: 24: Hoare triple {24832#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24832#false} is VALID [2022-04-28 10:09:22,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {24832#false} ~cond := #in~cond; {24832#false} is VALID [2022-04-28 10:09:22,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {24832#false} assume 0 == ~cond; {24832#false} is VALID [2022-04-28 10:09:22,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {24832#false} assume !false; {24832#false} is VALID [2022-04-28 10:09:22,782 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:22,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:23,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {24832#false} assume !false; {24832#false} is VALID [2022-04-28 10:09:23,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {24832#false} assume 0 == ~cond; {24832#false} is VALID [2022-04-28 10:09:23,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {24832#false} ~cond := #in~cond; {24832#false} is VALID [2022-04-28 10:09:23,148 INFO L272 TraceCheckUtils]: 24: Hoare triple {24832#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24832#false} is VALID [2022-04-28 10:09:23,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {24832#false} assume !(~z~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-28 10:09:23,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {24832#false} assume !(~x~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-28 10:09:23,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {24832#false} assume !(~y~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-28 10:09:23,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {24957#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {24832#false} is VALID [2022-04-28 10:09:23,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {24961#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {24957#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:23,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {24961#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {24961#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:23,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {24968#(< 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; {24961#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:23,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {24972#(< 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; {24968#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:23,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {24976#(< 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; {24972#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:23,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {24980#(< 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; {24976#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:23,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {24984#(< 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; {24980#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:23,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {24988#(< 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; {24984#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:23,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {24992#(< 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; {24988#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:23,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {24996#(< 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; {24992#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:23,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {25000#(< 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; {24996#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:23,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {25004#(< 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; {25000#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:23,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {25008#(< 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; {25004#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:23,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {25012#(< 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; {25008#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:09:23,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {24831#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25012#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:09:23,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {24831#true} call #t~ret15 := main(); {24831#true} is VALID [2022-04-28 10:09:23,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24831#true} {24831#true} #83#return; {24831#true} is VALID [2022-04-28 10:09:23,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {24831#true} assume true; {24831#true} is VALID [2022-04-28 10:09:23,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {24831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24831#true} is VALID [2022-04-28 10:09:23,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {24831#true} call ULTIMATE.init(); {24831#true} is VALID [2022-04-28 10:09:23,157 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:23,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296846437] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:23,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:23,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:09:23,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:23,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1048791606] [2022-04-28 10:09:23,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1048791606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:23,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:23,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:09:23,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977335916] [2022-04-28 10:09:23,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:23,158 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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:23,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:23,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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:23,174 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:23,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:09:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:23,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:09:23,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:09:23,175 INFO L87 Difference]: Start difference. First operand 171 states and 227 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:28,476 INFO L93 Difference]: Finished difference Result 386 states and 557 transitions. [2022-04-28 10:09:28,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:09:28,476 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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:28,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:28,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-28 10:09:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-28 10:09:28,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-28 10:09:28,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:28,637 INFO L225 Difference]: With dead ends: 386 [2022-04-28 10:09:28,637 INFO L226 Difference]: Without dead ends: 363 [2022-04-28 10:09:28,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=472, Invalid=1598, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:09:28,638 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 145 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:28,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 164 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 10:09:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-28 10:09:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 182. [2022-04-28 10:09:29,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:29,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 182 states, 177 states have (on average 1.3502824858757063) internal successors, (239), 177 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call 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:29,238 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 182 states, 177 states have (on average 1.3502824858757063) internal successors, (239), 177 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call 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:29,238 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 182 states, 177 states have (on average 1.3502824858757063) internal successors, (239), 177 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call 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:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:29,243 INFO L93 Difference]: Finished difference Result 363 states and 473 transitions. [2022-04-28 10:09:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 473 transitions. [2022-04-28 10:09:29,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:29,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:29,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 177 states have (on average 1.3502824858757063) internal successors, (239), 177 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 363 states. [2022-04-28 10:09:29,246 INFO L87 Difference]: Start difference. First operand has 182 states, 177 states have (on average 1.3502824858757063) internal successors, (239), 177 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 363 states. [2022-04-28 10:09:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:29,251 INFO L93 Difference]: Finished difference Result 363 states and 473 transitions. [2022-04-28 10:09:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 473 transitions. [2022-04-28 10:09:29,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:29,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:29,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:29,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 177 states have (on average 1.3502824858757063) internal successors, (239), 177 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call 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:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 243 transitions. [2022-04-28 10:09:29,253 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 243 transitions. Word has length 28 [2022-04-28 10:09:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:29,254 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 243 transitions. [2022-04-28 10:09:29,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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:29,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 243 transitions. [2022-04-28 10:09:29,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 243 transitions. [2022-04-28 10:09:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:09:29,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:29,823 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:29,840 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:30,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-28 10:09:30,033 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:30,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:30,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1242981297, now seen corresponding path program 25 times [2022-04-28 10:09:30,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:30,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1050812675] [2022-04-28 10:09:30,036 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:30,036 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:30,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1242981297, now seen corresponding path program 26 times [2022-04-28 10:09:30,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:30,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646793718] [2022-04-28 10:09:30,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:30,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:30,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:30,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {26943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26923#true} is VALID [2022-04-28 10:09:30,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {26923#true} assume true; {26923#true} is VALID [2022-04-28 10:09:30,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26923#true} {26923#true} #83#return; {26923#true} is VALID [2022-04-28 10:09:30,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {26923#true} call ULTIMATE.init(); {26943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:30,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {26943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26923#true} is VALID [2022-04-28 10:09:30,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {26923#true} assume true; {26923#true} is VALID [2022-04-28 10:09:30,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26923#true} {26923#true} #83#return; {26923#true} is VALID [2022-04-28 10:09:30,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {26923#true} call #t~ret15 := main(); {26923#true} is VALID [2022-04-28 10:09:30,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {26923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26928#(= main_~y~0 0)} is VALID [2022-04-28 10:09:30,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {26928#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26929#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:30,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {26929#(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; {26930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:30,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {26930#(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; {26931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:30,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {26931#(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; {26932#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:30,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {26932#(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; {26933#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:30,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {26933#(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; {26934#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:30,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {26934#(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; {26935#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:30,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {26935#(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; {26936#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:30,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {26936#(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; {26937#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:30,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {26937#(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; {26938#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:30,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {26938#(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; {26939#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:30,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {26939#(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; {26940#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:30,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {26940#(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; {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:30,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:30,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {26942#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:30,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {26942#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-28 10:09:30,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {26924#false} assume !(~y~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-28 10:09:30,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {26924#false} assume !(~x~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-28 10:09:30,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {26924#false} assume !(~z~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-28 10:09:30,276 INFO L272 TraceCheckUtils]: 25: Hoare triple {26924#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26924#false} is VALID [2022-04-28 10:09:30,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {26924#false} ~cond := #in~cond; {26924#false} is VALID [2022-04-28 10:09:30,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {26924#false} assume 0 == ~cond; {26924#false} is VALID [2022-04-28 10:09:30,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {26924#false} assume !false; {26924#false} is VALID [2022-04-28 10:09:30,276 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:30,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:30,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646793718] [2022-04-28 10:09:30,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646793718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:30,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596917724] [2022-04-28 10:09:30,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:30,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:30,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:30,278 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:30,279 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:30,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:30,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:30,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:09:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:30,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:30,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {26923#true} call ULTIMATE.init(); {26923#true} is VALID [2022-04-28 10:09:30,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {26923#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26923#true} is VALID [2022-04-28 10:09:30,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {26923#true} assume true; {26923#true} is VALID [2022-04-28 10:09:30,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26923#true} {26923#true} #83#return; {26923#true} is VALID [2022-04-28 10:09:30,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {26923#true} call #t~ret15 := main(); {26923#true} is VALID [2022-04-28 10:09:30,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {26923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26928#(= main_~y~0 0)} is VALID [2022-04-28 10:09:30,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {26928#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26929#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:30,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {26929#(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; {26930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:30,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {26930#(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; {26931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:30,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {26931#(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; {26932#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:30,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {26932#(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; {26933#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:30,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {26933#(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; {26934#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:30,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {26934#(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; {26935#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:30,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {26935#(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; {26936#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:30,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {26936#(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; {26937#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:30,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {26937#(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; {26938#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:30,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {26938#(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; {26939#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:30,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {26939#(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; {26940#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:30,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {26940#(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; {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:30,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:30,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {26941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {27007#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:09:30,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {27007#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-28 10:09:30,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {26924#false} assume !(~y~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-28 10:09:30,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {26924#false} assume !(~x~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-28 10:09:30,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {26924#false} assume !(~z~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-28 10:09:30,583 INFO L272 TraceCheckUtils]: 25: Hoare triple {26924#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26924#false} is VALID [2022-04-28 10:09:30,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {26924#false} ~cond := #in~cond; {26924#false} is VALID [2022-04-28 10:09:30,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {26924#false} assume 0 == ~cond; {26924#false} is VALID [2022-04-28 10:09:30,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {26924#false} assume !false; {26924#false} is VALID [2022-04-28 10:09:30,583 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:30,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:30,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {26924#false} assume !false; {26924#false} is VALID [2022-04-28 10:09:30,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {26924#false} assume 0 == ~cond; {26924#false} is VALID [2022-04-28 10:09:30,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {26924#false} ~cond := #in~cond; {26924#false} is VALID [2022-04-28 10:09:30,994 INFO L272 TraceCheckUtils]: 25: Hoare triple {26924#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26924#false} is VALID [2022-04-28 10:09:30,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {26924#false} assume !(~z~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-28 10:09:30,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {26924#false} assume !(~x~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-28 10:09:30,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {26924#false} assume !(~y~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-28 10:09:30,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {27053#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {26924#false} is VALID [2022-04-28 10:09:30,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {27057#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {27053#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:30,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {27057#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {27057#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:30,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {27064#(< 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; {27057#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:30,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {27068#(< 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; {27064#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:30,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {27072#(< 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; {27068#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:30,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {27076#(< 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; {27072#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:30,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {27080#(< 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; {27076#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:31,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {27084#(< 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; {27080#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:31,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {27088#(< 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; {27084#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:31,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {27092#(< 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; {27088#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:31,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {27096#(< 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; {27092#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:31,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {27100#(< 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; {27096#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:31,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {27104#(< 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; {27100#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:31,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {27108#(< 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; {27104#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:09:31,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {27112#(< 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; {27108#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:09:31,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {26923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27112#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:09:31,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {26923#true} call #t~ret15 := main(); {26923#true} is VALID [2022-04-28 10:09:31,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26923#true} {26923#true} #83#return; {26923#true} is VALID [2022-04-28 10:09:31,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {26923#true} assume true; {26923#true} is VALID [2022-04-28 10:09:31,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {26923#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26923#true} is VALID [2022-04-28 10:09:31,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {26923#true} call ULTIMATE.init(); {26923#true} is VALID [2022-04-28 10:09:31,005 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:31,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596917724] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:31,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:31,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:09:31,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:31,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1050812675] [2022-04-28 10:09:31,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1050812675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:31,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:31,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:09:31,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004066574] [2022-04-28 10:09:31,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:31,006 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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:31,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:31,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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:31,035 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:31,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:09:31,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:31,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:09:31,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:09:31,037 INFO L87 Difference]: Start difference. First operand 182 states and 243 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:36,922 INFO L93 Difference]: Finished difference Result 411 states and 595 transitions. [2022-04-28 10:09:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:09:36,923 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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:36,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 189 transitions. [2022-04-28 10:09:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 189 transitions. [2022-04-28 10:09:36,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 189 transitions. [2022-04-28 10:09:37,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:37,074 INFO L225 Difference]: With dead ends: 411 [2022-04-28 10:09:37,074 INFO L226 Difference]: Without dead ends: 388 [2022-04-28 10:09:37,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=535, Invalid=1817, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:09:37,075 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 162 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:37,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 174 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 10:09:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-04-28 10:09:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 193. [2022-04-28 10:09:37,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:37,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 388 states. Second operand has 193 states, 188 states have (on average 1.3563829787234043) internal successors, (255), 188 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call 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,642 INFO L74 IsIncluded]: Start isIncluded. First operand 388 states. Second operand has 193 states, 188 states have (on average 1.3563829787234043) internal successors, (255), 188 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call 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,642 INFO L87 Difference]: Start difference. First operand 388 states. Second operand has 193 states, 188 states have (on average 1.3563829787234043) internal successors, (255), 188 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call 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,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:37,648 INFO L93 Difference]: Finished difference Result 388 states and 507 transitions. [2022-04-28 10:09:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 507 transitions. [2022-04-28 10:09:37,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:37,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:37,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 188 states have (on average 1.3563829787234043) internal successors, (255), 188 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 388 states. [2022-04-28 10:09:37,649 INFO L87 Difference]: Start difference. First operand has 193 states, 188 states have (on average 1.3563829787234043) internal successors, (255), 188 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 388 states. [2022-04-28 10:09:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:37,655 INFO L93 Difference]: Finished difference Result 388 states and 507 transitions. [2022-04-28 10:09:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 507 transitions. [2022-04-28 10:09:37,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:37,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:37,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:37,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.3563829787234043) internal successors, (255), 188 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call 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,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 259 transitions. [2022-04-28 10:09:37,658 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 259 transitions. Word has length 29 [2022-04-28 10:09:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:37,658 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 259 transitions. [2022-04-28 10:09:37,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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:37,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 259 transitions. [2022-04-28 10:09:38,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 259 transitions. [2022-04-28 10:09:38,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:09:38,468 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:38,468 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:38,487 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:38,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:38,669 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:38,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1500556532, now seen corresponding path program 9 times [2022-04-28 10:09:38,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:38,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1142364521] [2022-04-28 10:09:38,673 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:38,673 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:38,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1500556532, now seen corresponding path program 10 times [2022-04-28 10:09:38,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:38,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157910037] [2022-04-28 10:09:38,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:38,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:38,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:38,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {29161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29147#true} is VALID [2022-04-28 10:09:38,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {29147#true} assume true; {29147#true} is VALID [2022-04-28 10:09:38,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29147#true} {29147#true} #83#return; {29147#true} is VALID [2022-04-28 10:09:38,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {29147#true} call ULTIMATE.init(); {29161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:38,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {29161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29147#true} is VALID [2022-04-28 10:09:38,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {29147#true} assume true; {29147#true} is VALID [2022-04-28 10:09:38,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29147#true} {29147#true} #83#return; {29147#true} is VALID [2022-04-28 10:09:38,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {29147#true} call #t~ret15 := main(); {29147#true} is VALID [2022-04-28 10:09:38,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {29147#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29152#(= main_~y~0 0)} is VALID [2022-04-28 10:09:38,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {29152#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29153#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:38,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {29153#(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; {29154#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:38,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {29154#(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; {29155#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:38,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {29155#(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; {29156#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:38,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {29156#(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; {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:38,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:38,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {29158#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:38,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {29158#(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; {29159#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:38,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {29159#(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; {29160#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:38,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {29160#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-28 10:09:38,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-28 10:09:38,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-28 10:09:38,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-28 10:09:38,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-28 10:09:38,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-28 10:09:38,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {29148#false} assume !(~y~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-28 10:09:38,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {29148#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29148#false} is VALID [2022-04-28 10:09:38,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {29148#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29148#false} is VALID [2022-04-28 10:09:38,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {29148#false} assume !(~x~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-28 10:09:38,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {29148#false} assume !(~z~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-28 10:09:38,836 INFO L272 TraceCheckUtils]: 26: Hoare triple {29148#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29148#false} is VALID [2022-04-28 10:09:38,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {29148#false} ~cond := #in~cond; {29148#false} is VALID [2022-04-28 10:09:38,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {29148#false} assume 0 == ~cond; {29148#false} is VALID [2022-04-28 10:09:38,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {29148#false} assume !false; {29148#false} is VALID [2022-04-28 10:09:38,837 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:38,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:38,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157910037] [2022-04-28 10:09:38,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157910037] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:38,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135425277] [2022-04-28 10:09:38,837 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:38,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:38,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:38,838 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:38,839 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:38,877 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:38,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:38,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:09:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:38,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:39,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {29147#true} call ULTIMATE.init(); {29147#true} is VALID [2022-04-28 10:09:39,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {29147#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29147#true} is VALID [2022-04-28 10:09:39,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {29147#true} assume true; {29147#true} is VALID [2022-04-28 10:09:39,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29147#true} {29147#true} #83#return; {29147#true} is VALID [2022-04-28 10:09:39,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {29147#true} call #t~ret15 := main(); {29147#true} is VALID [2022-04-28 10:09:39,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {29147#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29152#(= main_~y~0 0)} is VALID [2022-04-28 10:09:39,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {29152#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29153#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:39,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {29153#(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; {29154#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:39,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {29154#(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; {29155#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:39,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {29155#(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; {29156#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:39,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {29156#(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; {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:39,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:39,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {29157#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {29201#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:39,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {29201#(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; {29205#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:39,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {29205#(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; {29209#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:39,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {29209#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-28 10:09:39,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-28 10:09:39,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-28 10:09:39,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-28 10:09:39,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-28 10:09:39,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-28 10:09:39,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {29148#false} assume !(~y~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-28 10:09:39,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {29148#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29148#false} is VALID [2022-04-28 10:09:39,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {29148#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29148#false} is VALID [2022-04-28 10:09:39,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {29148#false} assume !(~x~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-28 10:09:39,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {29148#false} assume !(~z~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-28 10:09:39,091 INFO L272 TraceCheckUtils]: 26: Hoare triple {29148#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29148#false} is VALID [2022-04-28 10:09:39,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {29148#false} ~cond := #in~cond; {29148#false} is VALID [2022-04-28 10:09:39,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {29148#false} assume 0 == ~cond; {29148#false} is VALID [2022-04-28 10:09:39,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {29148#false} assume !false; {29148#false} is VALID [2022-04-28 10:09:39,092 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:39,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:39,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {29148#false} assume !false; {29148#false} is VALID [2022-04-28 10:09:39,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {29148#false} assume 0 == ~cond; {29148#false} is VALID [2022-04-28 10:09:39,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {29148#false} ~cond := #in~cond; {29148#false} is VALID [2022-04-28 10:09:39,304 INFO L272 TraceCheckUtils]: 26: Hoare triple {29148#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29148#false} is VALID [2022-04-28 10:09:39,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {29148#false} assume !(~z~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-28 10:09:39,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {29148#false} assume !(~x~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-28 10:09:39,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {29148#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29148#false} is VALID [2022-04-28 10:09:39,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {29148#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29148#false} is VALID [2022-04-28 10:09:39,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {29148#false} assume !(~y~0 % 4294967296 > 0); {29148#false} is VALID [2022-04-28 10:09:39,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-28 10:09:39,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {29148#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29148#false} is VALID [2022-04-28 10:09:39,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {29288#(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; {29148#false} is VALID [2022-04-28 10:09:39,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {29292#(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; {29288#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:39,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {29296#(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; {29292#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:39,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {29300#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {29296#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:09:39,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {29304#(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; {29300#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:09:39,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {29308#(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; {29304#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:39,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {29147#true} ~z~0 := ~y~0; {29308#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:09:39,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {29147#true} assume !(~x~0 % 4294967296 > 0); {29147#true} is VALID [2022-04-28 10:09:39,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {29147#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29147#true} is VALID [2022-04-28 10:09:39,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {29147#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29147#true} is VALID [2022-04-28 10:09:39,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {29147#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29147#true} is VALID [2022-04-28 10:09:39,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {29147#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29147#true} is VALID [2022-04-28 10:09:39,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {29147#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29147#true} is VALID [2022-04-28 10:09:39,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {29147#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29147#true} is VALID [2022-04-28 10:09:39,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {29147#true} call #t~ret15 := main(); {29147#true} is VALID [2022-04-28 10:09:39,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29147#true} {29147#true} #83#return; {29147#true} is VALID [2022-04-28 10:09:39,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {29147#true} assume true; {29147#true} is VALID [2022-04-28 10:09:39,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {29147#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29147#true} is VALID [2022-04-28 10:09:39,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {29147#true} call ULTIMATE.init(); {29147#true} is VALID [2022-04-28 10:09:39,312 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:39,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135425277] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:39,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:39,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 21 [2022-04-28 10:09:39,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:39,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1142364521] [2022-04-28 10:09:39,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1142364521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:39,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:39,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:09:39,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102813669] [2022-04-28 10:09:39,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:39,313 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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 30 [2022-04-28 10:09:39,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:39,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:39,331 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:39,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:09:39,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:39,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:09:39,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:09:39,331 INFO L87 Difference]: Start difference. First operand 193 states and 259 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:41,637 INFO L93 Difference]: Finished difference Result 280 states and 368 transitions. [2022-04-28 10:09:41,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:09:41,637 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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 30 [2022-04-28 10:09:41,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2022-04-28 10:09:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2022-04-28 10:09:41,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 92 transitions. [2022-04-28 10:09:41,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:41,707 INFO L225 Difference]: With dead ends: 280 [2022-04-28 10:09:41,707 INFO L226 Difference]: Without dead ends: 265 [2022-04-28 10:09:41,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:09:41,708 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 68 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:41,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 76 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:09:41,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-04-28 10:09:42,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 193. [2022-04-28 10:09:42,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:42,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 265 states. Second operand has 193 states, 188 states have (on average 1.351063829787234) internal successors, (254), 188 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call 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,295 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand has 193 states, 188 states have (on average 1.351063829787234) internal successors, (254), 188 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call 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,295 INFO L87 Difference]: Start difference. First operand 265 states. Second operand has 193 states, 188 states have (on average 1.351063829787234) internal successors, (254), 188 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call 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,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:42,299 INFO L93 Difference]: Finished difference Result 265 states and 351 transitions. [2022-04-28 10:09:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 351 transitions. [2022-04-28 10:09:42,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:42,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:42,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 188 states have (on average 1.351063829787234) internal successors, (254), 188 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 265 states. [2022-04-28 10:09:42,300 INFO L87 Difference]: Start difference. First operand has 193 states, 188 states have (on average 1.351063829787234) internal successors, (254), 188 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 265 states. [2022-04-28 10:09:42,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:42,304 INFO L93 Difference]: Finished difference Result 265 states and 351 transitions. [2022-04-28 10:09:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 351 transitions. [2022-04-28 10:09:42,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:42,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:42,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:42,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.351063829787234) internal successors, (254), 188 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call 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,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 258 transitions. [2022-04-28 10:09:42,307 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 258 transitions. Word has length 30 [2022-04-28 10:09:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:42,307 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 258 transitions. [2022-04-28 10:09:42,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:42,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 258 transitions. [2022-04-28 10:09:42,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 258 transitions. [2022-04-28 10:09:42,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:09:42,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:42,931 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:42,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:43,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:43,132 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:43,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:43,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1042510132, now seen corresponding path program 11 times [2022-04-28 10:09:43,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:43,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1929879750] [2022-04-28 10:09:43,135 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:43,135 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:43,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1042510132, now seen corresponding path program 12 times [2022-04-28 10:09:43,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:43,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175583889] [2022-04-28 10:09:43,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:43,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:43,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:43,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {30866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30850#true} is VALID [2022-04-28 10:09:43,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {30850#true} assume true; {30850#true} is VALID [2022-04-28 10:09:43,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30850#true} {30850#true} #83#return; {30850#true} is VALID [2022-04-28 10:09:43,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {30850#true} call ULTIMATE.init(); {30866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:43,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {30866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30850#true} is VALID [2022-04-28 10:09:43,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {30850#true} assume true; {30850#true} is VALID [2022-04-28 10:09:43,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30850#true} {30850#true} #83#return; {30850#true} is VALID [2022-04-28 10:09:43,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {30850#true} call #t~ret15 := main(); {30850#true} is VALID [2022-04-28 10:09:43,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {30850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30855#(= main_~y~0 0)} is VALID [2022-04-28 10:09:43,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {30855#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:43,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {30856#(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; {30857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:43,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {30857#(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; {30858#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:43,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {30858#(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; {30859#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:43,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {30859#(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; {30860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:43,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {30860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {30860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:43,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {30860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {30861#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:43,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {30861#(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; {30862#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:43,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {30862#(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; {30863#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:43,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {30863#(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; {30864#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:43,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {30864#(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; {30865#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:43,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {30865#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-28 10:09:43,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {30851#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30851#false} is VALID [2022-04-28 10:09:43,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {30851#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30851#false} is VALID [2022-04-28 10:09:43,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {30851#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30851#false} is VALID [2022-04-28 10:09:43,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {30851#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30851#false} is VALID [2022-04-28 10:09:43,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {30851#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30851#false} is VALID [2022-04-28 10:09:43,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {30851#false} assume !(~y~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-28 10:09:43,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {30851#false} assume !(~x~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-28 10:09:43,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {30851#false} assume !(~z~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-28 10:09:43,319 INFO L272 TraceCheckUtils]: 26: Hoare triple {30851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30851#false} is VALID [2022-04-28 10:09:43,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {30851#false} ~cond := #in~cond; {30851#false} is VALID [2022-04-28 10:09:43,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {30851#false} assume 0 == ~cond; {30851#false} is VALID [2022-04-28 10:09:43,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {30851#false} assume !false; {30851#false} is VALID [2022-04-28 10:09:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:09:43,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:43,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175583889] [2022-04-28 10:09:43,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175583889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:43,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102143658] [2022-04-28 10:09:43,320 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:43,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:43,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:43,321 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:43,322 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:43,370 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:09:43,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:43,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:09:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:43,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:43,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {30850#true} call ULTIMATE.init(); {30850#true} is VALID [2022-04-28 10:09:43,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {30850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30850#true} is VALID [2022-04-28 10:09:43,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {30850#true} assume true; {30850#true} is VALID [2022-04-28 10:09:43,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30850#true} {30850#true} #83#return; {30850#true} is VALID [2022-04-28 10:09:43,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {30850#true} call #t~ret15 := main(); {30850#true} is VALID [2022-04-28 10:09:43,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {30850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30850#true} is VALID [2022-04-28 10:09:43,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {30850#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30850#true} is VALID [2022-04-28 10:09:43,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {30850#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:43,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30895#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:43,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {30895#(< 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; {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:43,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:43,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:43,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:43,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:43,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30895#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:43,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {30895#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:43,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-28 10:09:43,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {30851#false} assume !(~z~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-28 10:09:43,558 INFO L272 TraceCheckUtils]: 26: Hoare triple {30851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30851#false} is VALID [2022-04-28 10:09:43,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {30851#false} ~cond := #in~cond; {30851#false} is VALID [2022-04-28 10:09:43,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {30851#false} assume 0 == ~cond; {30851#false} is VALID [2022-04-28 10:09:43,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {30851#false} assume !false; {30851#false} is VALID [2022-04-28 10:09:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:09:43,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:43,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {30851#false} assume !false; {30851#false} is VALID [2022-04-28 10:09:43,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {30851#false} assume 0 == ~cond; {30851#false} is VALID [2022-04-28 10:09:43,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {30851#false} ~cond := #in~cond; {30851#false} is VALID [2022-04-28 10:09:43,661 INFO L272 TraceCheckUtils]: 26: Hoare triple {30851#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30851#false} is VALID [2022-04-28 10:09:43,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {30851#false} assume !(~z~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-28 10:09:43,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {30851#false} is VALID [2022-04-28 10:09:43,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {30922#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30922#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:43,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {30895#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:43,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30895#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:43,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:43,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:43,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:43,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30903#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:43,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {30895#(< 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; {30899#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:43,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30895#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:43,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {30850#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30891#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:43,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {30850#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30850#true} is VALID [2022-04-28 10:09:43,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {30850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30850#true} is VALID [2022-04-28 10:09:43,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {30850#true} call #t~ret15 := main(); {30850#true} is VALID [2022-04-28 10:09:43,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30850#true} {30850#true} #83#return; {30850#true} is VALID [2022-04-28 10:09:43,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {30850#true} assume true; {30850#true} is VALID [2022-04-28 10:09:43,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {30850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30850#true} is VALID [2022-04-28 10:09:43,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {30850#true} call ULTIMATE.init(); {30850#true} is VALID [2022-04-28 10:09:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:09:43,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102143658] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:43,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:43,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-28 10:09:43,674 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:43,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1929879750] [2022-04-28 10:09:43,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1929879750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:43,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:43,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:09:43,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62889586] [2022-04-28 10:09:43,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:43,675 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 30 [2022-04-28 10:09:43,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:43,675 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:09:43,694 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:43,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:09:43,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:43,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:09:43,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:09:43,695 INFO L87 Difference]: Start difference. First operand 193 states and 258 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:09:46,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:46,554 INFO L93 Difference]: Finished difference Result 279 states and 367 transitions. [2022-04-28 10:09:46,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:09:46,554 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 30 [2022-04-28 10:09:46,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:46,555 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:09:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 97 transitions. [2022-04-28 10:09:46,556 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:09:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 97 transitions. [2022-04-28 10:09:46,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 97 transitions. [2022-04-28 10:09:46,635 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:46,639 INFO L225 Difference]: With dead ends: 279 [2022-04-28 10:09:46,640 INFO L226 Difference]: Without dead ends: 257 [2022-04-28 10:09:46,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=1179, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:09:46,640 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 63 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:46,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 83 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:09:46,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-28 10:09:47,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 194. [2022-04-28 10:09:47,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:47,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 194 states, 189 states have (on average 1.343915343915344) internal successors, (254), 189 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call 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,285 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 194 states, 189 states have (on average 1.343915343915344) internal successors, (254), 189 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call 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,285 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 194 states, 189 states have (on average 1.343915343915344) internal successors, (254), 189 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call 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,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:47,289 INFO L93 Difference]: Finished difference Result 257 states and 342 transitions. [2022-04-28 10:09:47,289 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 342 transitions. [2022-04-28 10:09:47,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:47,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:47,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 189 states have (on average 1.343915343915344) internal successors, (254), 189 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-28 10:09:47,290 INFO L87 Difference]: Start difference. First operand has 194 states, 189 states have (on average 1.343915343915344) internal successors, (254), 189 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-28 10:09:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:47,293 INFO L93 Difference]: Finished difference Result 257 states and 342 transitions. [2022-04-28 10:09:47,293 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 342 transitions. [2022-04-28 10:09:47,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:47,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:47,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:47,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 189 states have (on average 1.343915343915344) internal successors, (254), 189 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call 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,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 258 transitions. [2022-04-28 10:09:47,297 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 258 transitions. Word has length 30 [2022-04-28 10:09:47,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:47,297 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 258 transitions. [2022-04-28 10:09:47,297 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:09:47,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 258 transitions. [2022-04-28 10:09:47,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 258 transitions. [2022-04-28 10:09:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:09:47,808 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:47,808 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:47,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-28 10:09:48,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:48,011 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:48,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:48,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1702554722, now seen corresponding path program 11 times [2022-04-28 10:09:48,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:48,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [867642852] [2022-04-28 10:09:48,014 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:48,014 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1702554722, now seen corresponding path program 12 times [2022-04-28 10:09:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:48,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235949319] [2022-04-28 10:09:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:48,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:48,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {32561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32547#true} is VALID [2022-04-28 10:09:48,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {32547#true} assume true; {32547#true} is VALID [2022-04-28 10:09:48,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32547#true} {32547#true} #83#return; {32547#true} is VALID [2022-04-28 10:09:48,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {32547#true} call ULTIMATE.init(); {32561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:48,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {32561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32547#true} is VALID [2022-04-28 10:09:48,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {32547#true} assume true; {32547#true} is VALID [2022-04-28 10:09:48,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32547#true} {32547#true} #83#return; {32547#true} is VALID [2022-04-28 10:09:48,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {32547#true} call #t~ret15 := main(); {32547#true} is VALID [2022-04-28 10:09:48,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {32547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32552#(= main_~y~0 0)} is VALID [2022-04-28 10:09:48,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {32552#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32553#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:48,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {32553#(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; {32554#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:48,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {32554#(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; {32555#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:48,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {32555#(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; {32556#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:48,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {32556#(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; {32557#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:48,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {32557#(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; {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:48,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:48,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32559#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:48,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {32559#(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; {32560#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:48,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {32560#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-28 10:09:48,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {32548#false} assume !(~y~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-28 10:09:48,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {32548#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32548#false} is VALID [2022-04-28 10:09:48,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {32548#false} assume !(~x~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-28 10:09:48,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {32548#false} assume !(~z~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-28 10:09:48,185 INFO L272 TraceCheckUtils]: 26: Hoare triple {32548#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32548#false} is VALID [2022-04-28 10:09:48,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {32548#false} ~cond := #in~cond; {32548#false} is VALID [2022-04-28 10:09:48,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {32548#false} assume 0 == ~cond; {32548#false} is VALID [2022-04-28 10:09:48,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {32548#false} assume !false; {32548#false} is VALID [2022-04-28 10:09:48,185 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:48,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:48,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235949319] [2022-04-28 10:09:48,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235949319] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:48,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291287117] [2022-04-28 10:09:48,186 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:48,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:48,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:48,187 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:48,189 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:48,251 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:09:48,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:48,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:09:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:48,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:48,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {32547#true} call ULTIMATE.init(); {32547#true} is VALID [2022-04-28 10:09:48,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {32547#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32547#true} is VALID [2022-04-28 10:09:48,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {32547#true} assume true; {32547#true} is VALID [2022-04-28 10:09:48,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32547#true} {32547#true} #83#return; {32547#true} is VALID [2022-04-28 10:09:48,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {32547#true} call #t~ret15 := main(); {32547#true} is VALID [2022-04-28 10:09:48,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {32547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32552#(= main_~y~0 0)} is VALID [2022-04-28 10:09:48,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {32552#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32553#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:48,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {32553#(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; {32554#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:48,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {32554#(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; {32555#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:48,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {32555#(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; {32556#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:48,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {32556#(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; {32557#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:48,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {32557#(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; {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:48,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:48,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {32558#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32559#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:48,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {32559#(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; {32607#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:48,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {32607#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-28 10:09:48,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {32548#false} assume !(~y~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-28 10:09:48,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {32548#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32548#false} is VALID [2022-04-28 10:09:48,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {32548#false} assume !(~x~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-28 10:09:48,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {32548#false} assume !(~z~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-28 10:09:48,492 INFO L272 TraceCheckUtils]: 26: Hoare triple {32548#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32548#false} is VALID [2022-04-28 10:09:48,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {32548#false} ~cond := #in~cond; {32548#false} is VALID [2022-04-28 10:09:48,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {32548#false} assume 0 == ~cond; {32548#false} is VALID [2022-04-28 10:09:48,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {32548#false} assume !false; {32548#false} is VALID [2022-04-28 10:09:48,492 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:48,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:48,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {32548#false} assume !false; {32548#false} is VALID [2022-04-28 10:09:48,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {32548#false} assume 0 == ~cond; {32548#false} is VALID [2022-04-28 10:09:48,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {32548#false} ~cond := #in~cond; {32548#false} is VALID [2022-04-28 10:09:48,685 INFO L272 TraceCheckUtils]: 26: Hoare triple {32548#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32548#false} is VALID [2022-04-28 10:09:48,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {32548#false} assume !(~z~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-28 10:09:48,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {32548#false} assume !(~x~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-28 10:09:48,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {32548#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32548#false} is VALID [2022-04-28 10:09:48,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {32548#false} assume !(~y~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-28 10:09:48,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {32548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32548#false} is VALID [2022-04-28 10:09:48,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {32695#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32548#false} is VALID [2022-04-28 10:09:48,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {32699#(< 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; {32695#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:48,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {32703#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {32699#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:48,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {32703#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {32703#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:48,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {32710#(< 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; {32703#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:48,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {32714#(< 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; {32710#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:48,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {32718#(< 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; {32714#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:48,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {32722#(< 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; {32718#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:48,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {32726#(< 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; {32722#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:48,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {32730#(< 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; {32726#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:48,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {32547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32730#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:48,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {32547#true} call #t~ret15 := main(); {32547#true} is VALID [2022-04-28 10:09:48,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32547#true} {32547#true} #83#return; {32547#true} is VALID [2022-04-28 10:09:48,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {32547#true} assume true; {32547#true} is VALID [2022-04-28 10:09:48,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {32547#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32547#true} is VALID [2022-04-28 10:09:48,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {32547#true} call ULTIMATE.init(); {32547#true} is VALID [2022-04-28 10:09:48,694 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:48,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291287117] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:48,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:48,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:09:48,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:48,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [867642852] [2022-04-28 10:09:48,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [867642852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:48,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:48,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:09:48,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21691362] [2022-04-28 10:09:48,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:48,695 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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 30 [2022-04-28 10:09:48,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:48,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:48,712 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:48,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:09:48,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:48,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:09:48,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:09:48,713 INFO L87 Difference]: Start difference. First operand 194 states and 258 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:51,402 INFO L93 Difference]: Finished difference Result 302 states and 392 transitions. [2022-04-28 10:09:51,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:09:51,402 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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 30 [2022-04-28 10:09:51,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 100 transitions. [2022-04-28 10:09:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 100 transitions. [2022-04-28 10:09:51,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 100 transitions. [2022-04-28 10:09:51,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:51,482 INFO L225 Difference]: With dead ends: 302 [2022-04-28 10:09:51,482 INFO L226 Difference]: Without dead ends: 287 [2022-04-28 10:09:51,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 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:51,483 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 80 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:51,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 91 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:09:51,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-28 10:09:52,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 194. [2022-04-28 10:09:52,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:52,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 194 states, 189 states have (on average 1.3386243386243386) internal successors, (253), 189 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call 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:52,064 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 194 states, 189 states have (on average 1.3386243386243386) internal successors, (253), 189 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call 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:52,064 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 194 states, 189 states have (on average 1.3386243386243386) internal successors, (253), 189 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call 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:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:52,067 INFO L93 Difference]: Finished difference Result 287 states and 375 transitions. [2022-04-28 10:09:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 375 transitions. [2022-04-28 10:09:52,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:52,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:52,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 189 states have (on average 1.3386243386243386) internal successors, (253), 189 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 287 states. [2022-04-28 10:09:52,068 INFO L87 Difference]: Start difference. First operand has 194 states, 189 states have (on average 1.3386243386243386) internal successors, (253), 189 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 287 states. [2022-04-28 10:09:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:52,072 INFO L93 Difference]: Finished difference Result 287 states and 375 transitions. [2022-04-28 10:09:52,072 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 375 transitions. [2022-04-28 10:09:52,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:52,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:52,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:52,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 189 states have (on average 1.3386243386243386) internal successors, (253), 189 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call 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:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 257 transitions. [2022-04-28 10:09:52,075 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 257 transitions. Word has length 30 [2022-04-28 10:09:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:52,075 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 257 transitions. [2022-04-28 10:09:52,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:52,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 257 transitions. [2022-04-28 10:09:52,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 257 transitions. [2022-04-28 10:09:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:09:52,642 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:52,642 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:52,664 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:52,843 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,SelfDestructingSolverStorable34 [2022-04-28 10:09:52,843 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:52,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:52,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1731623838, now seen corresponding path program 27 times [2022-04-28 10:09:52,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:52,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1044576449] [2022-04-28 10:09:52,846 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:52,846 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:52,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1731623838, now seen corresponding path program 28 times [2022-04-28 10:09:52,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:52,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697216362] [2022-04-28 10:09:52,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:52,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:53,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:53,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {34358#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34337#true} is VALID [2022-04-28 10:09:53,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {34337#true} assume true; {34337#true} is VALID [2022-04-28 10:09:53,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34337#true} {34337#true} #83#return; {34337#true} is VALID [2022-04-28 10:09:53,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {34337#true} call ULTIMATE.init(); {34358#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:53,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {34358#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34337#true} is VALID [2022-04-28 10:09:53,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {34337#true} assume true; {34337#true} is VALID [2022-04-28 10:09:53,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34337#true} {34337#true} #83#return; {34337#true} is VALID [2022-04-28 10:09:53,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {34337#true} call #t~ret15 := main(); {34337#true} is VALID [2022-04-28 10:09:53,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {34337#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34342#(= main_~y~0 0)} is VALID [2022-04-28 10:09:53,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {34342#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34343#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:53,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {34343#(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; {34344#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:53,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {34344#(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; {34345#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:53,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {34345#(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; {34346#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:53,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {34346#(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; {34347#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:53,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {34347#(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; {34348#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:53,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {34348#(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; {34349#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:53,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {34349#(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; {34350#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:53,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {34350#(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; {34351#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:53,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {34351#(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; {34352#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:53,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {34352#(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; {34353#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:53,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {34353#(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; {34354#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:53,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {34354#(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; {34355#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:53,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {34355#(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; {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:53,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:53,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {34357#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:53,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {34357#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-28 10:09:53,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {34338#false} assume !(~y~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-28 10:09:53,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {34338#false} assume !(~x~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-28 10:09:53,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {34338#false} assume !(~z~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-28 10:09:53,104 INFO L272 TraceCheckUtils]: 26: Hoare triple {34338#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34338#false} is VALID [2022-04-28 10:09:53,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {34338#false} ~cond := #in~cond; {34338#false} is VALID [2022-04-28 10:09:53,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {34338#false} assume 0 == ~cond; {34338#false} is VALID [2022-04-28 10:09:53,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {34338#false} assume !false; {34338#false} is VALID [2022-04-28 10:09:53,104 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:53,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:53,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697216362] [2022-04-28 10:09:53,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697216362] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:53,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239396492] [2022-04-28 10:09:53,104 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:53,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:53,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:53,105 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:53,147 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:53,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:53,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:53,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:09:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:53,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:53,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {34337#true} call ULTIMATE.init(); {34337#true} is VALID [2022-04-28 10:09:53,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {34337#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34337#true} is VALID [2022-04-28 10:09:53,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {34337#true} assume true; {34337#true} is VALID [2022-04-28 10:09:53,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34337#true} {34337#true} #83#return; {34337#true} is VALID [2022-04-28 10:09:53,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {34337#true} call #t~ret15 := main(); {34337#true} is VALID [2022-04-28 10:09:53,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {34337#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34342#(= main_~y~0 0)} is VALID [2022-04-28 10:09:53,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {34342#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34343#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:53,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {34343#(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; {34344#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:53,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {34344#(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; {34345#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:53,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {34345#(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; {34346#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:53,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {34346#(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; {34347#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:53,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {34347#(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; {34348#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:53,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {34348#(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; {34349#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:53,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {34349#(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; {34350#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:53,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {34350#(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; {34351#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:53,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {34351#(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; {34352#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:53,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {34352#(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; {34353#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:53,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {34353#(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; {34354#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:53,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {34354#(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; {34355#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:53,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {34355#(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; {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:53,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:53,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {34356#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {34425#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:09:53,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {34425#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-28 10:09:53,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {34338#false} assume !(~y~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-28 10:09:53,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {34338#false} assume !(~x~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-28 10:09:53,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {34338#false} assume !(~z~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-28 10:09:53,402 INFO L272 TraceCheckUtils]: 26: Hoare triple {34338#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34338#false} is VALID [2022-04-28 10:09:53,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {34338#false} ~cond := #in~cond; {34338#false} is VALID [2022-04-28 10:09:53,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {34338#false} assume 0 == ~cond; {34338#false} is VALID [2022-04-28 10:09:53,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {34338#false} assume !false; {34338#false} is VALID [2022-04-28 10:09:53,403 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:53,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:53,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {34338#false} assume !false; {34338#false} is VALID [2022-04-28 10:09:53,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {34338#false} assume 0 == ~cond; {34338#false} is VALID [2022-04-28 10:09:53,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {34338#false} ~cond := #in~cond; {34338#false} is VALID [2022-04-28 10:09:53,887 INFO L272 TraceCheckUtils]: 26: Hoare triple {34338#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34338#false} is VALID [2022-04-28 10:09:53,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {34338#false} assume !(~z~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-28 10:09:53,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {34338#false} assume !(~x~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-28 10:09:53,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {34338#false} assume !(~y~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-28 10:09:53,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {34471#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {34338#false} is VALID [2022-04-28 10:09:53,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {34475#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {34471#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:53,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {34475#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {34475#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:53,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {34482#(< 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; {34475#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:53,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {34486#(< 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; {34482#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:53,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {34490#(< 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; {34486#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:53,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {34494#(< 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; {34490#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:53,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {34498#(< 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; {34494#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:53,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {34502#(< 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; {34498#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:53,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {34506#(< 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; {34502#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:53,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {34510#(< 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; {34506#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:53,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {34514#(< 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; {34510#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:53,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {34518#(< 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; {34514#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:53,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {34522#(< 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; {34518#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:53,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {34526#(< 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; {34522#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:09:53,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {34530#(< 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; {34526#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:09:53,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {34534#(< 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; {34530#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:09:53,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {34337#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34534#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:09:53,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {34337#true} call #t~ret15 := main(); {34337#true} is VALID [2022-04-28 10:09:53,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34337#true} {34337#true} #83#return; {34337#true} is VALID [2022-04-28 10:09:53,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {34337#true} assume true; {34337#true} is VALID [2022-04-28 10:09:53,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {34337#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34337#true} is VALID [2022-04-28 10:09:53,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {34337#true} call ULTIMATE.init(); {34337#true} is VALID [2022-04-28 10:09:53,901 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:53,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239396492] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:53,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:53,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:09:53,901 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:53,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1044576449] [2022-04-28 10:09:53,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1044576449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:53,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:53,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:09:53,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346934165] [2022-04-28 10:09:53,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:53,902 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:09:53,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:53,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:09:53,921 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:09:53,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:09:53,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:53,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:09:53,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:09:53,922 INFO L87 Difference]: Start difference. First operand 194 states and 257 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:00,635 INFO L93 Difference]: Finished difference Result 437 states and 631 transitions. [2022-04-28 10:10:00,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:10:00,635 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:00,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 201 transitions. [2022-04-28 10:10:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 201 transitions. [2022-04-28 10:10:00,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 201 transitions. [2022-04-28 10:10:00,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:00,799 INFO L225 Difference]: With dead ends: 437 [2022-04-28 10:10:00,799 INFO L226 Difference]: Without dead ends: 414 [2022-04-28 10:10:00,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=602, Invalid=2050, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:10:00,800 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 174 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2434 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:00,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 186 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2434 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 10:10:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-04-28 10:10:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 205. [2022-04-28 10:10:01,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:01,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 414 states. Second operand has 205 states, 200 states have (on average 1.345) internal successors, (269), 200 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call 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,435 INFO L74 IsIncluded]: Start isIncluded. First operand 414 states. Second operand has 205 states, 200 states have (on average 1.345) internal successors, (269), 200 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call 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,435 INFO L87 Difference]: Start difference. First operand 414 states. Second operand has 205 states, 200 states have (on average 1.345) internal successors, (269), 200 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call 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,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:01,442 INFO L93 Difference]: Finished difference Result 414 states and 539 transitions. [2022-04-28 10:10:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 539 transitions. [2022-04-28 10:10:01,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:01,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:01,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 200 states have (on average 1.345) internal successors, (269), 200 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 414 states. [2022-04-28 10:10:01,443 INFO L87 Difference]: Start difference. First operand has 205 states, 200 states have (on average 1.345) internal successors, (269), 200 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 414 states. [2022-04-28 10:10:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:01,451 INFO L93 Difference]: Finished difference Result 414 states and 539 transitions. [2022-04-28 10:10:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 539 transitions. [2022-04-28 10:10:01,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:01,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:01,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:01,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.345) internal successors, (269), 200 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call 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,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 273 transitions. [2022-04-28 10:10:01,454 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 273 transitions. Word has length 30 [2022-04-28 10:10:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:01,454 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 273 transitions. [2022-04-28 10:10:01,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 205 states and 273 transitions. [2022-04-28 10:10:02,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 273 transitions. [2022-04-28 10:10:02,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:10:02,041 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:02,041 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:02,057 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:10:02,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 10:10:02,242 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:02,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:02,242 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 5 times [2022-04-28 10:10:02,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:02,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [442235253] [2022-04-28 10:10:02,246 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:02,246 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:02,246 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 6 times [2022-04-28 10:10:02,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:02,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922200341] [2022-04-28 10:10:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:02,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:02,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:02,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {36715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36699#true} is VALID [2022-04-28 10:10:02,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {36699#true} assume true; {36699#true} is VALID [2022-04-28 10:10:02,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36699#true} {36699#true} #83#return; {36699#true} is VALID [2022-04-28 10:10:02,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {36699#true} call ULTIMATE.init(); {36715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:02,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {36715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36699#true} is VALID [2022-04-28 10:10:02,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {36699#true} assume true; {36699#true} is VALID [2022-04-28 10:10:02,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36699#true} {36699#true} #83#return; {36699#true} is VALID [2022-04-28 10:10:02,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {36699#true} call #t~ret15 := main(); {36699#true} is VALID [2022-04-28 10:10:02,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {36699#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:10:02,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36705#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-28 10:10:02,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {36705#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36706#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} is VALID [2022-04-28 10:10:02,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {36706#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:10:02,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:10:02,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} ~z~0 := ~y~0; {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:10:02,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36709#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:10:02,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {36709#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36710#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-28 10:10:02,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {36710#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-28 10:10:02,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-28 10:10:02,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-28 10:10:02,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-28 10:10:02,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-28 10:10:02,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !(~y~0 % 4294967296 > 0); {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-28 10:10:02,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {36711#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36710#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-28 10:10:02,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {36710#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36709#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:10:02,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {36709#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:10:02,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:10:02,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {36708#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36709#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:10:02,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {36709#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36710#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-28 10:10:02,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {36710#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:10:02,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:10:02,634 INFO L272 TraceCheckUtils]: 27: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36713#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:10:02,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {36713#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {36714#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:10:02,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {36714#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {36700#false} is VALID [2022-04-28 10:10:02,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {36700#false} assume !false; {36700#false} is VALID [2022-04-28 10:10:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:10:02,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:02,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922200341] [2022-04-28 10:10:02,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922200341] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:02,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436203708] [2022-04-28 10:10:02,635 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:02,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:02,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:02,636 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:10:02,637 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:10:02,673 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:10:02,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:02,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:10:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:02,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:02,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {36699#true} call ULTIMATE.init(); {36699#true} is VALID [2022-04-28 10:10:02,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {36699#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36699#true} is VALID [2022-04-28 10:10:02,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {36699#true} assume true; {36699#true} is VALID [2022-04-28 10:10:02,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36699#true} {36699#true} #83#return; {36699#true} is VALID [2022-04-28 10:10:02,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {36699#true} call #t~ret15 := main(); {36699#true} is VALID [2022-04-28 10:10:02,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {36699#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:10:02,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-28 10:10:02,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} is VALID [2022-04-28 10:10:02,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:10:02,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:10:02,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} ~z~0 := ~y~0; {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:10:02,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} is VALID [2022-04-28 10:10:02,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-28 10:10:02,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:10:02,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:10:02,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:10:02,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:10:02,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:10:02,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:10:02,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-28 10:10:02,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} is VALID [2022-04-28 10:10:02,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:10:02,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:10:02,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {36707#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} is VALID [2022-04-28 10:10:02,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {36741#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-28 10:10:02,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {36737#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:10:02,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:10:02,891 INFO L272 TraceCheckUtils]: 27: Hoare triple {36704#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36802#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:10:02,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {36802#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36806#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:10:02,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {36806#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36700#false} is VALID [2022-04-28 10:10:02,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {36700#false} assume !false; {36700#false} is VALID [2022-04-28 10:10:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:10:02,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:03,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {36700#false} assume !false; {36700#false} is VALID [2022-04-28 10:10:03,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {36806#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36700#false} is VALID [2022-04-28 10:10:03,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {36802#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36806#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:10:03,247 INFO L272 TraceCheckUtils]: 27: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36802#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:10:03,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:10:03,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:10:03,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:03,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:03,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-28 10:10:03,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-28 10:10:03,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:03,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:03,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:10:03,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:10:03,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:10:03,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:10:03,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:10:03,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:10:03,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:03,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:03,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} ~z~0 := ~y~0; {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-28 10:10:03,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-28 10:10:03,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36836#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-28 10:10:03,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36832#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:03,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36828#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:03,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {36699#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36712#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:10:03,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {36699#true} call #t~ret15 := main(); {36699#true} is VALID [2022-04-28 10:10:03,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36699#true} {36699#true} #83#return; {36699#true} is VALID [2022-04-28 10:10:03,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {36699#true} assume true; {36699#true} is VALID [2022-04-28 10:10:03,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {36699#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36699#true} is VALID [2022-04-28 10:10:03,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {36699#true} call ULTIMATE.init(); {36699#true} is VALID [2022-04-28 10:10:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:10:03,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436203708] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:03,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:03,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2022-04-28 10:10:03,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:03,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [442235253] [2022-04-28 10:10:03,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [442235253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:03,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:03,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:10:03,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403350327] [2022-04-28 10:10:03,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:03,263 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 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 31 [2022-04-28 10:10:03,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:03,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 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:10:03,317 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:10:03,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:10:03,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:03,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:10:03,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:10:03,318 INFO L87 Difference]: Start difference. First operand 205 states and 273 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 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:10:04,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:04,826 INFO L93 Difference]: Finished difference Result 215 states and 283 transitions. [2022-04-28 10:10:04,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:10:04,826 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 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 31 [2022-04-28 10:10:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 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:10:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2022-04-28 10:10:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 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:10:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2022-04-28 10:10:04,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2022-04-28 10:10:04,894 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:04,897 INFO L225 Difference]: With dead ends: 215 [2022-04-28 10:10:04,897 INFO L226 Difference]: Without dead ends: 206 [2022-04-28 10:10:04,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:10:04,898 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:04,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 61 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:10:04,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-28 10:10:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-04-28 10:10:05,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:05,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 206 states, 201 states have (on average 1.3432835820895523) internal successors, (270), 201 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call 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,557 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 206 states, 201 states have (on average 1.3432835820895523) internal successors, (270), 201 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call 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,557 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 206 states, 201 states have (on average 1.3432835820895523) internal successors, (270), 201 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call 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,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:05,559 INFO L93 Difference]: Finished difference Result 206 states and 274 transitions. [2022-04-28 10:10:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 274 transitions. [2022-04-28 10:10:05,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:05,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:05,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 201 states have (on average 1.3432835820895523) internal successors, (270), 201 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 206 states. [2022-04-28 10:10:05,560 INFO L87 Difference]: Start difference. First operand has 206 states, 201 states have (on average 1.3432835820895523) internal successors, (270), 201 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 206 states. [2022-04-28 10:10:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:05,562 INFO L93 Difference]: Finished difference Result 206 states and 274 transitions. [2022-04-28 10:10:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 274 transitions. [2022-04-28 10:10:05,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:05,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:05,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:05,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 201 states have (on average 1.3432835820895523) internal successors, (270), 201 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call 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,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 274 transitions. [2022-04-28 10:10:05,565 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 274 transitions. Word has length 31 [2022-04-28 10:10:05,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:05,565 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 274 transitions. [2022-04-28 10:10:05,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 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:10:05,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 206 states and 274 transitions. [2022-04-28 10:10:06,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:06,232 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 274 transitions. [2022-04-28 10:10:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:10:06,232 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:06,232 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:06,249 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:10:06,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:06,433 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:06,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:06,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1558438816, now seen corresponding path program 13 times [2022-04-28 10:10:06,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:06,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1328983257] [2022-04-28 10:10:06,435 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:06,435 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:06,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1558438816, now seen corresponding path program 14 times [2022-04-28 10:10:06,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:06,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383998508] [2022-04-28 10:10:06,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:06,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:06,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:06,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {38198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38180#true} is VALID [2022-04-28 10:10:06,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {38180#true} assume true; {38180#true} is VALID [2022-04-28 10:10:06,629 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38180#true} {38180#true} #83#return; {38180#true} is VALID [2022-04-28 10:10:06,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {38180#true} call ULTIMATE.init(); {38198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:06,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {38198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38180#true} is VALID [2022-04-28 10:10:06,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {38180#true} assume true; {38180#true} is VALID [2022-04-28 10:10:06,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38180#true} {38180#true} #83#return; {38180#true} is VALID [2022-04-28 10:10:06,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {38180#true} call #t~ret15 := main(); {38180#true} is VALID [2022-04-28 10:10:06,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {38180#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38185#(= main_~y~0 0)} is VALID [2022-04-28 10:10:06,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {38185#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38186#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:06,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {38186#(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; {38187#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:06,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {38187#(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; {38188#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:06,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {38188#(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; {38189#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:06,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {38189#(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; {38190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:06,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {38190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {38190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:06,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {38190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {38191#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:06,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {38191#(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; {38192#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:06,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {38192#(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; {38193#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:10:06,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {38193#(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; {38194#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:10:06,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {38194#(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; {38195#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:10:06,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {38195#(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; {38196#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:10:06,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {38196#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {38196#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:10:06,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {38196#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38195#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:10:06,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {38195#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38194#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:10:06,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {38194#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38193#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:10:06,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {38193#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38192#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:06,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {38192#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38197#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:06,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {38197#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {38197#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:06,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {38197#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {38197#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:06,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {38197#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {38181#false} is VALID [2022-04-28 10:10:06,640 INFO L272 TraceCheckUtils]: 27: Hoare triple {38181#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38181#false} is VALID [2022-04-28 10:10:06,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {38181#false} ~cond := #in~cond; {38181#false} is VALID [2022-04-28 10:10:06,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {38181#false} assume 0 == ~cond; {38181#false} is VALID [2022-04-28 10:10:06,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {38181#false} assume !false; {38181#false} is VALID [2022-04-28 10:10:06,640 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:10:06,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:06,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383998508] [2022-04-28 10:10:06,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383998508] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:06,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563241200] [2022-04-28 10:10:06,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:06,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:06,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:06,642 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:10:06,643 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:10:06,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:06,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:06,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:10:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:06,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:06,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {38180#true} call ULTIMATE.init(); {38180#true} is VALID [2022-04-28 10:10:06,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {38180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38180#true} is VALID [2022-04-28 10:10:06,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {38180#true} assume true; {38180#true} is VALID [2022-04-28 10:10:06,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38180#true} {38180#true} #83#return; {38180#true} is VALID [2022-04-28 10:10:06,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {38180#true} call #t~ret15 := main(); {38180#true} is VALID [2022-04-28 10:10:06,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {38180#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38180#true} is VALID [2022-04-28 10:10:06,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {38180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:06,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38224#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:06,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {38224#(< 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; {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:06,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:06,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:06,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:06,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:06,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:06,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:06,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38224#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:06,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {38224#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:06,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {38181#false} is VALID [2022-04-28 10:10:06,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {38181#false} assume !(~z~0 % 4294967296 > 0); {38181#false} is VALID [2022-04-28 10:10:06,880 INFO L272 TraceCheckUtils]: 27: Hoare triple {38181#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38181#false} is VALID [2022-04-28 10:10:06,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {38181#false} ~cond := #in~cond; {38181#false} is VALID [2022-04-28 10:10:06,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {38181#false} assume 0 == ~cond; {38181#false} is VALID [2022-04-28 10:10:06,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {38181#false} assume !false; {38181#false} is VALID [2022-04-28 10:10:06,880 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:10:06,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:06,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {38181#false} assume !false; {38181#false} is VALID [2022-04-28 10:10:06,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {38181#false} assume 0 == ~cond; {38181#false} is VALID [2022-04-28 10:10:06,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {38181#false} ~cond := #in~cond; {38181#false} is VALID [2022-04-28 10:10:06,977 INFO L272 TraceCheckUtils]: 27: Hoare triple {38181#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38181#false} is VALID [2022-04-28 10:10:06,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {38181#false} assume !(~z~0 % 4294967296 > 0); {38181#false} is VALID [2022-04-28 10:10:06,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {38181#false} is VALID [2022-04-28 10:10:06,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {38258#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38258#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:06,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {38224#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:06,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38224#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:06,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:06,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:06,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:06,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:06,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38236#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:06,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38232#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:06,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {38224#(< 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; {38228#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:06,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38224#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:06,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {38180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38220#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:06,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {38180#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38180#true} is VALID [2022-04-28 10:10:06,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {38180#true} call #t~ret15 := main(); {38180#true} is VALID [2022-04-28 10:10:06,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38180#true} {38180#true} #83#return; {38180#true} is VALID [2022-04-28 10:10:06,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {38180#true} assume true; {38180#true} is VALID [2022-04-28 10:10:06,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {38180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38180#true} is VALID [2022-04-28 10:10:06,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {38180#true} call ULTIMATE.init(); {38180#true} is VALID [2022-04-28 10:10:06,987 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:10:06,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563241200] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:06,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:06,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-28 10:10:06,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:06,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1328983257] [2022-04-28 10:10:06,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1328983257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:06,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:06,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:10:06,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975086182] [2022-04-28 10:10:06,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:06,988 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 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:06,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:06,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call 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:07,010 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:07,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:10:07,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:07,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:10:07,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:10:07,011 INFO L87 Difference]: Start difference. First operand 206 states and 274 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call 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:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:12,439 INFO L93 Difference]: Finished difference Result 321 states and 448 transitions. [2022-04-28 10:10:12,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 10:10:12,439 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 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:12,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call 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:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 205 transitions. [2022-04-28 10:10:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call 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:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 205 transitions. [2022-04-28 10:10:12,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 205 transitions. [2022-04-28 10:10:12,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:12,626 INFO L225 Difference]: With dead ends: 321 [2022-04-28 10:10:12,627 INFO L226 Difference]: Without dead ends: 307 [2022-04-28 10:10:12,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=349, Invalid=4481, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:10:12,628 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 92 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:12,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 101 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:10:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-28 10:10:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 214. [2022-04-28 10:10:13,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:13,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 214 states, 209 states have (on average 1.3301435406698565) internal successors, (278), 209 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:13,330 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 214 states, 209 states have (on average 1.3301435406698565) internal successors, (278), 209 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:13,330 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 214 states, 209 states have (on average 1.3301435406698565) internal successors, (278), 209 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:13,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:13,333 INFO L93 Difference]: Finished difference Result 307 states and 389 transitions. [2022-04-28 10:10:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 389 transitions. [2022-04-28 10:10:13,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:13,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:13,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.3301435406698565) internal successors, (278), 209 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-28 10:10:13,334 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.3301435406698565) internal successors, (278), 209 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-28 10:10:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:13,338 INFO L93 Difference]: Finished difference Result 307 states and 389 transitions. [2022-04-28 10:10:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 389 transitions. [2022-04-28 10:10:13,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:13,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:13,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:13,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.3301435406698565) internal successors, (278), 209 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 282 transitions. [2022-04-28 10:10:13,345 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 282 transitions. Word has length 31 [2022-04-28 10:10:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:13,345 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 282 transitions. [2022-04-28 10:10:13,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call 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:13,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 282 transitions. [2022-04-28 10:10:14,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 282 transitions. [2022-04-28 10:10:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:10:14,108 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:14,108 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:14,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:14,308 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,SelfDestructingSolverStorable37 [2022-04-28 10:10:14,309 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:14,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:14,309 INFO L85 PathProgramCache]: Analyzing trace with hash 300326575, now seen corresponding path program 29 times [2022-04-28 10:10:14,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:14,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [746823988] [2022-04-28 10:10:14,311 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:14,311 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:14,311 INFO L85 PathProgramCache]: Analyzing trace with hash 300326575, now seen corresponding path program 30 times [2022-04-28 10:10:14,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:14,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277211426] [2022-04-28 10:10:14,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:14,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:14,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:14,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {40192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40170#true} is VALID [2022-04-28 10:10:14,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {40170#true} assume true; {40170#true} is VALID [2022-04-28 10:10:14,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40170#true} {40170#true} #83#return; {40170#true} is VALID [2022-04-28 10:10:14,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {40170#true} call ULTIMATE.init(); {40192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:14,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {40192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40170#true} is VALID [2022-04-28 10:10:14,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {40170#true} assume true; {40170#true} is VALID [2022-04-28 10:10:14,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40170#true} {40170#true} #83#return; {40170#true} is VALID [2022-04-28 10:10:14,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {40170#true} call #t~ret15 := main(); {40170#true} is VALID [2022-04-28 10:10:14,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {40170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40175#(= main_~y~0 0)} is VALID [2022-04-28 10:10:14,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {40175#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:14,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {40176#(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; {40177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:14,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {40177#(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; {40178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:14,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {40178#(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; {40179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:14,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {40179#(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; {40180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:14,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {40180#(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; {40181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:14,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {40181#(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; {40182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:14,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {40182#(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; {40183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:14,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {40183#(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; {40184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:14,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {40184#(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; {40185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:14,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {40185#(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; {40186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:14,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {40186#(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; {40187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:14,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {40187#(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; {40188#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:14,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {40188#(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; {40189#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:14,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {40189#(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; {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:14,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:14,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {40191#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-28 10:10:14,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {40191#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-28 10:10:14,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {40171#false} assume !(~y~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-28 10:10:14,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {40171#false} assume !(~x~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-28 10:10:14,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {40171#false} assume !(~z~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-28 10:10:14,598 INFO L272 TraceCheckUtils]: 27: Hoare triple {40171#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40171#false} is VALID [2022-04-28 10:10:14,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {40171#false} ~cond := #in~cond; {40171#false} is VALID [2022-04-28 10:10:14,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {40171#false} assume 0 == ~cond; {40171#false} is VALID [2022-04-28 10:10:14,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {40171#false} assume !false; {40171#false} is VALID [2022-04-28 10:10:14,598 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:14,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:14,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277211426] [2022-04-28 10:10:14,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277211426] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:14,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7645523] [2022-04-28 10:10:14,598 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:14,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:14,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:14,604 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:10:14,604 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:10:14,745 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 10:10:14,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:14,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:10:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:14,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:15,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {40170#true} call ULTIMATE.init(); {40170#true} is VALID [2022-04-28 10:10:15,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {40170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40170#true} is VALID [2022-04-28 10:10:15,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {40170#true} assume true; {40170#true} is VALID [2022-04-28 10:10:15,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40170#true} {40170#true} #83#return; {40170#true} is VALID [2022-04-28 10:10:15,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {40170#true} call #t~ret15 := main(); {40170#true} is VALID [2022-04-28 10:10:15,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {40170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40175#(= main_~y~0 0)} is VALID [2022-04-28 10:10:15,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {40175#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:15,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {40176#(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; {40177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:15,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {40177#(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; {40178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:15,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {40178#(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; {40179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:15,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {40179#(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; {40180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:15,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {40180#(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; {40181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:15,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {40181#(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; {40182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:15,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {40182#(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; {40183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:15,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {40183#(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; {40184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:15,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {40184#(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; {40185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:15,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {40185#(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; {40186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:15,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {40186#(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; {40187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:15,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {40187#(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; {40188#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:15,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {40188#(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; {40189#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:15,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {40189#(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; {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:15,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:15,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {40190#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {40262#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:10:15,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {40262#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-28 10:10:15,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {40171#false} assume !(~y~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-28 10:10:15,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {40171#false} assume !(~x~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-28 10:10:15,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {40171#false} assume !(~z~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-28 10:10:15,013 INFO L272 TraceCheckUtils]: 27: Hoare triple {40171#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40171#false} is VALID [2022-04-28 10:10:15,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {40171#false} ~cond := #in~cond; {40171#false} is VALID [2022-04-28 10:10:15,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {40171#false} assume 0 == ~cond; {40171#false} is VALID [2022-04-28 10:10:15,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {40171#false} assume !false; {40171#false} is VALID [2022-04-28 10:10:15,013 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:15,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:15,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {40171#false} assume !false; {40171#false} is VALID [2022-04-28 10:10:15,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {40171#false} assume 0 == ~cond; {40171#false} is VALID [2022-04-28 10:10:15,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {40171#false} ~cond := #in~cond; {40171#false} is VALID [2022-04-28 10:10:15,520 INFO L272 TraceCheckUtils]: 27: Hoare triple {40171#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40171#false} is VALID [2022-04-28 10:10:15,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {40171#false} assume !(~z~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-28 10:10:15,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {40171#false} assume !(~x~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-28 10:10:15,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {40171#false} assume !(~y~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-28 10:10:15,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {40308#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {40171#false} is VALID [2022-04-28 10:10:15,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {40312#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {40308#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:15,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {40312#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {40312#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:15,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {40319#(< 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; {40312#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:15,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {40323#(< 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; {40319#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:15,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {40327#(< 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; {40323#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:15,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {40331#(< 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; {40327#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:15,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {40335#(< 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; {40331#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:15,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {40339#(< 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; {40335#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:15,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {40343#(< 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; {40339#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:15,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {40347#(< 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; {40343#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:15,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {40351#(< 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; {40347#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:15,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {40355#(< 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; {40351#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:10:15,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {40359#(< 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; {40355#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:10:15,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {40363#(< 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; {40359#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:10:15,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {40367#(< 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; {40363#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:10:15,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {40371#(< 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; {40367#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:10:15,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {40375#(< 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; {40371#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:10:15,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {40170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40375#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:10:15,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {40170#true} call #t~ret15 := main(); {40170#true} is VALID [2022-04-28 10:10:15,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40170#true} {40170#true} #83#return; {40170#true} is VALID [2022-04-28 10:10:15,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {40170#true} assume true; {40170#true} is VALID [2022-04-28 10:10:15,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {40170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40170#true} is VALID [2022-04-28 10:10:15,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {40170#true} call ULTIMATE.init(); {40170#true} is VALID [2022-04-28 10:10:15,531 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:15,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7645523] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:15,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:15,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:10:15,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:15,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [746823988] [2022-04-28 10:10:15,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [746823988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:15,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:15,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:10:15,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182960827] [2022-04-28 10:10:15,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:15,532 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.35) 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:15,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:15,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.35) 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,551 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:15,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:10:15,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:15,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:10:15,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:10:15,552 INFO L87 Difference]: Start difference. First operand 214 states and 282 transitions. Second operand has 20 states, 20 states have (on average 1.35) 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:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:23,809 INFO L93 Difference]: Finished difference Result 502 states and 724 transitions. [2022-04-28 10:10:23,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:10:23,809 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.35) 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:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) 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:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 213 transitions. [2022-04-28 10:10:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) 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:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 213 transitions. [2022-04-28 10:10:23,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 213 transitions. [2022-04-28 10:10:23,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:24,010 INFO L225 Difference]: With dead ends: 502 [2022-04-28 10:10:24,010 INFO L226 Difference]: Without dead ends: 479 [2022-04-28 10:10:24,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=673, Invalid=2297, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:10:24,011 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 189 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2772 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:24,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 198 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2772 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 10:10:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-04-28 10:10:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 225. [2022-04-28 10:10:24,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:24,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 479 states. Second operand has 225 states, 220 states have (on average 1.3363636363636364) internal successors, (294), 220 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call 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,750 INFO L74 IsIncluded]: Start isIncluded. First operand 479 states. Second operand has 225 states, 220 states have (on average 1.3363636363636364) internal successors, (294), 220 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call 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,750 INFO L87 Difference]: Start difference. First operand 479 states. Second operand has 225 states, 220 states have (on average 1.3363636363636364) internal successors, (294), 220 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call 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,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:24,758 INFO L93 Difference]: Finished difference Result 479 states and 628 transitions. [2022-04-28 10:10:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 628 transitions. [2022-04-28 10:10:24,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:24,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:24,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 220 states have (on average 1.3363636363636364) internal successors, (294), 220 states have internal predecessors, (294), 3 states have call successors, (3), 3 states 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:10:24,759 INFO L87 Difference]: Start difference. First operand has 225 states, 220 states have (on average 1.3363636363636364) internal successors, (294), 220 states have internal predecessors, (294), 3 states have call successors, (3), 3 states 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:10:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:24,767 INFO L93 Difference]: Finished difference Result 479 states and 628 transitions. [2022-04-28 10:10:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 628 transitions. [2022-04-28 10:10:24,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:24,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:24,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:24,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 220 states have (on average 1.3363636363636364) internal successors, (294), 220 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call 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,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 298 transitions. [2022-04-28 10:10:24,771 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 298 transitions. Word has length 31 [2022-04-28 10:10:24,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:24,771 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 298 transitions. [2022-04-28 10:10:24,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.35) 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:24,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 225 states and 298 transitions. [2022-04-28 10:10:25,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 298 transitions. [2022-04-28 10:10:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:25,462 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:25,462 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:25,466 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:10:25,662 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,SelfDestructingSolverStorable38 [2022-04-28 10:10:25,663 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:25,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:25,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1990656643, now seen corresponding path program 7 times [2022-04-28 10:10:25,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:25,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1115505576] [2022-04-28 10:10:25,666 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:25,666 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:25,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1990656643, now seen corresponding path program 8 times [2022-04-28 10:10:25,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:25,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539002509] [2022-04-28 10:10:25,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:25,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:25,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:25,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {42851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42842#true} is VALID [2022-04-28 10:10:25,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {42842#true} assume true; {42842#true} is VALID [2022-04-28 10:10:25,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42842#true} {42842#true} #83#return; {42842#true} is VALID [2022-04-28 10:10:25,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {42842#true} call ULTIMATE.init(); {42851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:25,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {42851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42842#true} is VALID [2022-04-28 10:10:25,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {42842#true} assume true; {42842#true} is VALID [2022-04-28 10:10:25,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42842#true} {42842#true} #83#return; {42842#true} is VALID [2022-04-28 10:10:25,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {42842#true} call #t~ret15 := main(); {42842#true} is VALID [2022-04-28 10:10:25,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {42842#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42842#true} is VALID [2022-04-28 10:10:25,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-28 10:10:25,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-28 10:10:25,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-28 10:10:25,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {42842#true} assume !(~x~0 % 4294967296 > 0); {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:25,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:25,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {42847#(<= 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; {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:25,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {42848#(<= 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; {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {42849#(<= 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; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {42850#(<= 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; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {42850#(<= 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; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {42850#(<= 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; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:25,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:25,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42843#false} is VALID [2022-04-28 10:10:25,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {42843#false} assume !(~x~0 % 4294967296 > 0); {42843#false} is VALID [2022-04-28 10:10:25,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-28 10:10:25,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-28 10:10:25,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-28 10:10:25,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {42843#false} assume !(~z~0 % 4294967296 > 0); {42843#false} is VALID [2022-04-28 10:10:25,752 INFO L272 TraceCheckUtils]: 28: Hoare triple {42843#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {42843#false} is VALID [2022-04-28 10:10:25,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {42843#false} ~cond := #in~cond; {42843#false} is VALID [2022-04-28 10:10:25,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {42843#false} assume 0 == ~cond; {42843#false} is VALID [2022-04-28 10:10:25,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {42843#false} assume !false; {42843#false} is VALID [2022-04-28 10:10:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:10:25,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:25,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539002509] [2022-04-28 10:10:25,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539002509] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:25,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685224107] [2022-04-28 10:10:25,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:25,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:25,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:25,760 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:10:25,765 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:10:25,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:25,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:25,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 10:10:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:25,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:25,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {42842#true} call ULTIMATE.init(); {42842#true} is VALID [2022-04-28 10:10:25,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {42842#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42842#true} is VALID [2022-04-28 10:10:25,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {42842#true} assume true; {42842#true} is VALID [2022-04-28 10:10:25,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42842#true} {42842#true} #83#return; {42842#true} is VALID [2022-04-28 10:10:25,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {42842#true} call #t~ret15 := main(); {42842#true} is VALID [2022-04-28 10:10:25,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {42842#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42842#true} is VALID [2022-04-28 10:10:25,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-28 10:10:25,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-28 10:10:25,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-28 10:10:25,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {42842#true} assume !(~x~0 % 4294967296 > 0); {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:25,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:25,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {42847#(<= 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; {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:25,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {42848#(<= 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; {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {42849#(<= 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; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {42850#(<= 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; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {42850#(<= 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; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {42850#(<= 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; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:25,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:25,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:25,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42843#false} is VALID [2022-04-28 10:10:25,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {42843#false} assume !(~x~0 % 4294967296 > 0); {42843#false} is VALID [2022-04-28 10:10:25,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-28 10:10:25,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-28 10:10:25,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-28 10:10:25,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {42843#false} assume !(~z~0 % 4294967296 > 0); {42843#false} is VALID [2022-04-28 10:10:25,927 INFO L272 TraceCheckUtils]: 28: Hoare triple {42843#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {42843#false} is VALID [2022-04-28 10:10:25,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {42843#false} ~cond := #in~cond; {42843#false} is VALID [2022-04-28 10:10:25,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {42843#false} assume 0 == ~cond; {42843#false} is VALID [2022-04-28 10:10:25,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {42843#false} assume !false; {42843#false} is VALID [2022-04-28 10:10:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:10:25,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:26,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {42843#false} assume !false; {42843#false} is VALID [2022-04-28 10:10:26,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {42843#false} assume 0 == ~cond; {42843#false} is VALID [2022-04-28 10:10:26,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {42843#false} ~cond := #in~cond; {42843#false} is VALID [2022-04-28 10:10:26,134 INFO L272 TraceCheckUtils]: 28: Hoare triple {42843#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {42843#false} is VALID [2022-04-28 10:10:26,134 INFO L290 TraceCheckUtils]: 27: Hoare triple {42843#false} assume !(~z~0 % 4294967296 > 0); {42843#false} is VALID [2022-04-28 10:10:26,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-28 10:10:26,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-28 10:10:26,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {42843#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42843#false} is VALID [2022-04-28 10:10:26,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {42843#false} assume !(~x~0 % 4294967296 > 0); {42843#false} is VALID [2022-04-28 10:10:26,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42843#false} is VALID [2022-04-28 10:10:26,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:26,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:26,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:26,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:26,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {42850#(<= 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; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:26,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {42850#(<= 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; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:26,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {42850#(<= 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; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:26,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:26,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {42849#(<= 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; {42850#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:26,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {42848#(<= 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; {42849#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:26,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {42847#(<= 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; {42848#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:26,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:26,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {42842#true} assume !(~x~0 % 4294967296 > 0); {42847#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:26,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-28 10:10:26,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-28 10:10:26,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {42842#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42842#true} is VALID [2022-04-28 10:10:26,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {42842#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42842#true} is VALID [2022-04-28 10:10:26,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {42842#true} call #t~ret15 := main(); {42842#true} is VALID [2022-04-28 10:10:26,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42842#true} {42842#true} #83#return; {42842#true} is VALID [2022-04-28 10:10:26,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {42842#true} assume true; {42842#true} is VALID [2022-04-28 10:10:26,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {42842#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42842#true} is VALID [2022-04-28 10:10:26,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {42842#true} call ULTIMATE.init(); {42842#true} is VALID [2022-04-28 10:10:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:10:26,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685224107] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:26,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:26,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-28 10:10:26,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:26,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1115505576] [2022-04-28 10:10:26,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1115505576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:26,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:26,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:10:26,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905042457] [2022-04-28 10:10:26,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:26,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 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:26,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:26,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call 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,164 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:26,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:10:26,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:26,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:10:26,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:10:26,165 INFO L87 Difference]: Start difference. First operand 225 states and 298 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call 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:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:27,542 INFO L93 Difference]: Finished difference Result 252 states and 333 transitions. [2022-04-28 10:10:27,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:10:27,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 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:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call 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:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-28 10:10:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call 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:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-28 10:10:27,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-04-28 10:10:27,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:27,595 INFO L225 Difference]: With dead ends: 252 [2022-04-28 10:10:27,595 INFO L226 Difference]: Without dead ends: 226 [2022-04-28 10:10:27,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:10:27,595 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:27,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 57 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:10:27,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-28 10:10:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 211. [2022-04-28 10:10:28,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:28,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 211 states, 206 states have (on average 1.3495145631067962) internal successors, (278), 206 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:28,306 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 211 states, 206 states have (on average 1.3495145631067962) internal successors, (278), 206 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:28,306 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 211 states, 206 states have (on average 1.3495145631067962) internal successors, (278), 206 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:28,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:28,310 INFO L93 Difference]: Finished difference Result 226 states and 301 transitions. [2022-04-28 10:10:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 301 transitions. [2022-04-28 10:10:28,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:28,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:28,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 206 states have (on average 1.3495145631067962) internal successors, (278), 206 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-28 10:10:28,311 INFO L87 Difference]: Start difference. First operand has 211 states, 206 states have (on average 1.3495145631067962) internal successors, (278), 206 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-28 10:10:28,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:28,314 INFO L93 Difference]: Finished difference Result 226 states and 301 transitions. [2022-04-28 10:10:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 301 transitions. [2022-04-28 10:10:28,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:28,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:28,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:28,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.3495145631067962) internal successors, (278), 206 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 282 transitions. [2022-04-28 10:10:28,319 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 282 transitions. Word has length 32 [2022-04-28 10:10:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:28,319 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 282 transitions. [2022-04-28 10:10:28,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call 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,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 282 transitions. [2022-04-28 10:10:29,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:29,054 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 282 transitions. [2022-04-28 10:10:29,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:29,055 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:29,055 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:29,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-28 10:10:29,255 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,SelfDestructingSolverStorable39 [2022-04-28 10:10:29,255 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:29,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:29,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1320683330, now seen corresponding path program 7 times [2022-04-28 10:10:29,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:29,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1777478582] [2022-04-28 10:10:29,258 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:29,258 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:29,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1320683330, now seen corresponding path program 8 times [2022-04-28 10:10:29,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:29,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758355959] [2022-04-28 10:10:29,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:29,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:29,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:29,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {44442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44429#true} is VALID [2022-04-28 10:10:29,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {44429#true} assume true; {44429#true} is VALID [2022-04-28 10:10:29,381 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44429#true} {44429#true} #83#return; {44429#true} is VALID [2022-04-28 10:10:29,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {44429#true} call ULTIMATE.init(); {44442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:29,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {44442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44429#true} is VALID [2022-04-28 10:10:29,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {44429#true} assume true; {44429#true} is VALID [2022-04-28 10:10:29,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44429#true} {44429#true} #83#return; {44429#true} is VALID [2022-04-28 10:10:29,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {44429#true} call #t~ret15 := main(); {44429#true} is VALID [2022-04-28 10:10:29,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {44429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44429#true} is VALID [2022-04-28 10:10:29,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {44429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44434#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:29,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {44434#(<= 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; {44435#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:10:29,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {44435#(<= 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; {44436#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:29,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {44436#(<= 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; {44437#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:10:29,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {44437#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {44437#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:10:29,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {44437#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {44437#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:10:29,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {44437#(<= (* (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; {44438#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:10:29,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {44438#(<= (+ (* 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; {44439#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:10:29,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {44439#(<= (+ 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; {44440#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:10:29,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {44440#(<= (+ 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; {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:29,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:29,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {44441#(<= (+ 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; {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:29,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {44441#(<= (+ 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; {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:29,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {44441#(<= (+ 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; {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:29,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {44441#(<= (+ 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; {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:29,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:29,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {44441#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {44430#false} is VALID [2022-04-28 10:10:29,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-28 10:10:29,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-28 10:10:29,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-28 10:10:29,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-28 10:10:29,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {44430#false} assume !(~z~0 % 4294967296 > 0); {44430#false} is VALID [2022-04-28 10:10:29,392 INFO L272 TraceCheckUtils]: 28: Hoare triple {44430#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44430#false} is VALID [2022-04-28 10:10:29,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {44430#false} ~cond := #in~cond; {44430#false} is VALID [2022-04-28 10:10:29,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {44430#false} assume 0 == ~cond; {44430#false} is VALID [2022-04-28 10:10:29,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {44430#false} assume !false; {44430#false} is VALID [2022-04-28 10:10:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:10:29,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:29,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758355959] [2022-04-28 10:10:29,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758355959] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:29,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944151406] [2022-04-28 10:10:29,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:29,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:29,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:29,404 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:10:29,405 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:10:29,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:29,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:29,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:10:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:29,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:29,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {44429#true} call ULTIMATE.init(); {44429#true} is VALID [2022-04-28 10:10:29,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {44429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44429#true} is VALID [2022-04-28 10:10:29,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {44429#true} assume true; {44429#true} is VALID [2022-04-28 10:10:29,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44429#true} {44429#true} #83#return; {44429#true} is VALID [2022-04-28 10:10:29,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {44429#true} call #t~ret15 := main(); {44429#true} is VALID [2022-04-28 10:10:29,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {44429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44429#true} is VALID [2022-04-28 10:10:29,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {44429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44434#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:29,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {44434#(<= 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; {44467#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:10:29,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {44467#(<= 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; {44471#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {44471#(<= 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; {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:10:29,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:10:29,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:10:29,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {44475#(<= 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; {44471#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {44471#(<= 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; {44467#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:10:29,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {44467#(<= 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; {44434#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:29,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {44434#(<= 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; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {44494#(<= 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; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {44494#(<= 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; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {44494#(<= 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; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {44494#(<= 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; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {44430#false} is VALID [2022-04-28 10:10:29,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-28 10:10:29,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-28 10:10:29,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-28 10:10:29,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-28 10:10:29,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {44430#false} assume !(~z~0 % 4294967296 > 0); {44430#false} is VALID [2022-04-28 10:10:29,616 INFO L272 TraceCheckUtils]: 28: Hoare triple {44430#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44430#false} is VALID [2022-04-28 10:10:29,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {44430#false} ~cond := #in~cond; {44430#false} is VALID [2022-04-28 10:10:29,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {44430#false} assume 0 == ~cond; {44430#false} is VALID [2022-04-28 10:10:29,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {44430#false} assume !false; {44430#false} is VALID [2022-04-28 10:10:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:10:29,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:29,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {44430#false} assume !false; {44430#false} is VALID [2022-04-28 10:10:29,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {44430#false} assume 0 == ~cond; {44430#false} is VALID [2022-04-28 10:10:29,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {44430#false} ~cond := #in~cond; {44430#false} is VALID [2022-04-28 10:10:29,735 INFO L272 TraceCheckUtils]: 28: Hoare triple {44430#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44430#false} is VALID [2022-04-28 10:10:29,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {44430#false} assume !(~z~0 % 4294967296 > 0); {44430#false} is VALID [2022-04-28 10:10:29,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-28 10:10:29,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-28 10:10:29,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-28 10:10:29,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {44430#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {44430#false} is VALID [2022-04-28 10:10:29,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {44430#false} is VALID [2022-04-28 10:10:29,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {44494#(<= 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; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {44494#(<= 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; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {44494#(<= 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; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {44494#(<= 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; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {44434#(<= 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; {44494#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {44467#(<= 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; {44434#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:29,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {44471#(<= 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; {44467#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:10:29,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {44475#(<= 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; {44471#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:10:29,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:10:29,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {44471#(<= 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; {44475#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:10:29,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {44467#(<= 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; {44471#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:29,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {44434#(<= 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; {44467#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:10:29,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {44429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44434#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:29,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {44429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44429#true} is VALID [2022-04-28 10:10:29,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {44429#true} call #t~ret15 := main(); {44429#true} is VALID [2022-04-28 10:10:29,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44429#true} {44429#true} #83#return; {44429#true} is VALID [2022-04-28 10:10:29,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {44429#true} assume true; {44429#true} is VALID [2022-04-28 10:10:29,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {44429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44429#true} is VALID [2022-04-28 10:10:29,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {44429#true} call ULTIMATE.init(); {44429#true} is VALID [2022-04-28 10:10:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:10:29,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944151406] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:29,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:29,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2022-04-28 10:10:29,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:29,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1777478582] [2022-04-28 10:10:29,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1777478582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:29,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:29,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:10:29,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437545079] [2022-04-28 10:10:29,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:29,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:29,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:29,766 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:29,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:10:29,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:29,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:10:29,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:10:29,767 INFO L87 Difference]: Start difference. First operand 211 states and 282 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:31,733 INFO L93 Difference]: Finished difference Result 291 states and 404 transitions. [2022-04-28 10:10:31,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:10:31,733 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:31,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-04-28 10:10:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-04-28 10:10:31,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 82 transitions. [2022-04-28 10:10:31,834 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:10:31,837 INFO L225 Difference]: With dead ends: 291 [2022-04-28 10:10:31,838 INFO L226 Difference]: Without dead ends: 280 [2022-04-28 10:10:31,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 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:10:31,838 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 77 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:31,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 49 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:10:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-28 10:10:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 252. [2022-04-28 10:10:32,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:32,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 252 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 247 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call 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:32,816 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 252 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 247 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call 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:32,816 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 252 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 247 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call 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:32,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:32,819 INFO L93 Difference]: Finished difference Result 280 states and 381 transitions. [2022-04-28 10:10:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2022-04-28 10:10:32,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:32,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:32,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 247 states have internal predecessors, (332), 3 states have call successors, (3), 3 states 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:10:32,820 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 247 states have internal predecessors, (332), 3 states have call successors, (3), 3 states 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:10:32,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:32,823 INFO L93 Difference]: Finished difference Result 280 states and 381 transitions. [2022-04-28 10:10:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2022-04-28 10:10:32,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:32,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:32,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:32,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 247 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call 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:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 336 transitions. [2022-04-28 10:10:32,827 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 336 transitions. Word has length 32 [2022-04-28 10:10:32,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:32,827 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 336 transitions. [2022-04-28 10:10:32,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:32,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 336 transitions. [2022-04-28 10:10:33,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 336 transitions. [2022-04-28 10:10:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:33,831 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:33,831 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:33,847 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:10:34,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:34,031 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:34,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:34,032 INFO L85 PathProgramCache]: Analyzing trace with hash 904933634, now seen corresponding path program 13 times [2022-04-28 10:10:34,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:34,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1185176943] [2022-04-28 10:10:34,034 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:34,034 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:34,034 INFO L85 PathProgramCache]: Analyzing trace with hash 904933634, now seen corresponding path program 14 times [2022-04-28 10:10:34,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:34,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700421826] [2022-04-28 10:10:34,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:34,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:34,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {46315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46300#true} is VALID [2022-04-28 10:10:34,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {46300#true} assume true; {46300#true} is VALID [2022-04-28 10:10:34,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46300#true} {46300#true} #83#return; {46300#true} is VALID [2022-04-28 10:10:34,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {46300#true} call ULTIMATE.init(); {46315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:34,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {46315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46300#true} is VALID [2022-04-28 10:10:34,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {46300#true} assume true; {46300#true} is VALID [2022-04-28 10:10:34,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46300#true} {46300#true} #83#return; {46300#true} is VALID [2022-04-28 10:10:34,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {46300#true} call #t~ret15 := main(); {46300#true} is VALID [2022-04-28 10:10:34,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {46300#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46305#(= main_~y~0 0)} is VALID [2022-04-28 10:10:34,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {46305#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46306#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:34,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {46306#(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; {46307#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:34,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {46307#(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; {46308#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:34,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {46308#(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; {46309#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:34,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {46309#(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; {46310#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:34,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {46310#(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; {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:34,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:34,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {46312#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:34,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {46312#(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; {46313#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:34,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {46313#(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; {46314#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:34,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {46314#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-28 10:10:34,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {46301#false} assume !(~y~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-28 10:10:34,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {46301#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46301#false} is VALID [2022-04-28 10:10:34,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {46301#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46301#false} is VALID [2022-04-28 10:10:34,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {46301#false} assume !(~x~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-28 10:10:34,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {46301#false} assume !(~z~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-28 10:10:34,179 INFO L272 TraceCheckUtils]: 28: Hoare triple {46301#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46301#false} is VALID [2022-04-28 10:10:34,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {46301#false} ~cond := #in~cond; {46301#false} is VALID [2022-04-28 10:10:34,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {46301#false} assume 0 == ~cond; {46301#false} is VALID [2022-04-28 10:10:34,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {46301#false} assume !false; {46301#false} is VALID [2022-04-28 10:10:34,179 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:34,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:34,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700421826] [2022-04-28 10:10:34,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700421826] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:34,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139375885] [2022-04-28 10:10:34,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:34,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:34,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:34,180 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:34,181 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:34,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:34,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:34,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:10:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:34,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:34,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {46300#true} call ULTIMATE.init(); {46300#true} is VALID [2022-04-28 10:10:34,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {46300#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46300#true} is VALID [2022-04-28 10:10:34,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {46300#true} assume true; {46300#true} is VALID [2022-04-28 10:10:34,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46300#true} {46300#true} #83#return; {46300#true} is VALID [2022-04-28 10:10:34,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {46300#true} call #t~ret15 := main(); {46300#true} is VALID [2022-04-28 10:10:34,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {46300#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46305#(= main_~y~0 0)} is VALID [2022-04-28 10:10:34,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {46305#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46306#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:34,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {46306#(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; {46307#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:34,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {46307#(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; {46308#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:34,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {46308#(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; {46309#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:34,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {46309#(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; {46310#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:34,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {46310#(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; {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:34,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:34,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {46311#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {46312#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:34,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {46312#(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; {46313#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:34,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {46313#(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; {46364#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:34,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {46364#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-28 10:10:34,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {46301#false} assume !(~y~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-28 10:10:34,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {46301#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46301#false} is VALID [2022-04-28 10:10:34,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {46301#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46301#false} is VALID [2022-04-28 10:10:34,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {46301#false} assume !(~x~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-28 10:10:34,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {46301#false} assume !(~z~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-28 10:10:34,422 INFO L272 TraceCheckUtils]: 28: Hoare triple {46301#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46301#false} is VALID [2022-04-28 10:10:34,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {46301#false} ~cond := #in~cond; {46301#false} is VALID [2022-04-28 10:10:34,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {46301#false} assume 0 == ~cond; {46301#false} is VALID [2022-04-28 10:10:34,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {46301#false} assume !false; {46301#false} is VALID [2022-04-28 10:10:34,422 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:34,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:34,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {46301#false} assume !false; {46301#false} is VALID [2022-04-28 10:10:34,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {46301#false} assume 0 == ~cond; {46301#false} is VALID [2022-04-28 10:10:34,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {46301#false} ~cond := #in~cond; {46301#false} is VALID [2022-04-28 10:10:34,632 INFO L272 TraceCheckUtils]: 28: Hoare triple {46301#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46301#false} is VALID [2022-04-28 10:10:34,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {46301#false} assume !(~z~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-28 10:10:34,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {46301#false} assume !(~x~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-28 10:10:34,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {46301#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46301#false} is VALID [2022-04-28 10:10:34,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {46301#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46301#false} is VALID [2022-04-28 10:10:34,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {46301#false} assume !(~y~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-28 10:10:34,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {46301#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46301#false} is VALID [2022-04-28 10:10:34,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {46458#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {46301#false} is VALID [2022-04-28 10:10:34,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {46462#(< 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; {46458#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:34,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {46466#(< 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; {46462#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:34,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {46470#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {46466#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:34,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {46470#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {46470#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:34,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {46477#(< 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; {46470#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:34,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {46481#(< 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; {46477#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:34,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {46485#(< 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; {46481#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:34,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {46489#(< 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; {46485#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:34,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {46493#(< 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; {46489#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:34,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {46497#(< 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; {46493#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:34,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {46300#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46497#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:34,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {46300#true} call #t~ret15 := main(); {46300#true} is VALID [2022-04-28 10:10:34,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46300#true} {46300#true} #83#return; {46300#true} is VALID [2022-04-28 10:10:34,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {46300#true} assume true; {46300#true} is VALID [2022-04-28 10:10:34,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {46300#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46300#true} is VALID [2022-04-28 10:10:34,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {46300#true} call ULTIMATE.init(); {46300#true} is VALID [2022-04-28 10:10:34,646 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:34,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139375885] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:34,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:34,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:10:34,646 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:34,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1185176943] [2022-04-28 10:10:34,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1185176943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:34,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:34,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:10:34,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224395347] [2022-04-28 10:10:34,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:34,647 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 32 [2022-04-28 10:10:34,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:34,647 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:10:34,663 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:34,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:10:34,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:34,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:10:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:10:34,663 INFO L87 Difference]: Start difference. First operand 252 states and 336 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:10:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:38,170 INFO L93 Difference]: Finished difference Result 370 states and 478 transitions. [2022-04-28 10:10:38,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:10:38,170 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 32 [2022-04-28 10:10:38,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:38,171 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:10:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2022-04-28 10:10:38,171 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:10:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2022-04-28 10:10:38,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 99 transitions. [2022-04-28 10:10:38,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:38,251 INFO L225 Difference]: With dead ends: 370 [2022-04-28 10:10:38,251 INFO L226 Difference]: Without dead ends: 354 [2022-04-28 10:10:38,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:10:38,252 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 64 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:38,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 87 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:10:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-04-28 10:10:39,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 252. [2022-04-28 10:10:39,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:39,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 354 states. Second operand has 252 states, 247 states have (on average 1.3400809716599191) internal successors, (331), 247 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call 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:39,317 INFO L74 IsIncluded]: Start isIncluded. First operand 354 states. Second operand has 252 states, 247 states have (on average 1.3400809716599191) internal successors, (331), 247 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call 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:39,317 INFO L87 Difference]: Start difference. First operand 354 states. Second operand has 252 states, 247 states have (on average 1.3400809716599191) internal successors, (331), 247 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call 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:39,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:39,322 INFO L93 Difference]: Finished difference Result 354 states and 461 transitions. [2022-04-28 10:10:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 461 transitions. [2022-04-28 10:10:39,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:39,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:39,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.3400809716599191) internal successors, (331), 247 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 354 states. [2022-04-28 10:10:39,322 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.3400809716599191) internal successors, (331), 247 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 354 states. [2022-04-28 10:10:39,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:39,327 INFO L93 Difference]: Finished difference Result 354 states and 461 transitions. [2022-04-28 10:10:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 461 transitions. [2022-04-28 10:10:39,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:39,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:39,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:39,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.3400809716599191) internal successors, (331), 247 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call 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:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 335 transitions. [2022-04-28 10:10:39,330 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 335 transitions. Word has length 32 [2022-04-28 10:10:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:39,331 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 335 transitions. [2022-04-28 10:10:39,331 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:10:39,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 335 transitions. [2022-04-28 10:10:40,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 335 edges. 335 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 335 transitions. [2022-04-28 10:10:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:40,312 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:40,312 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:40,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-28 10:10:40,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:40,513 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:40,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:40,513 INFO L85 PathProgramCache]: Analyzing trace with hash 741226194, now seen corresponding path program 15 times [2022-04-28 10:10:40,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:40,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [25805968] [2022-04-28 10:10:40,515 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:40,515 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:40,515 INFO L85 PathProgramCache]: Analyzing trace with hash 741226194, now seen corresponding path program 16 times [2022-04-28 10:10:40,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:40,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632361678] [2022-04-28 10:10:40,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:40,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:40,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:40,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {48511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48496#true} is VALID [2022-04-28 10:10:40,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {48496#true} assume true; {48496#true} is VALID [2022-04-28 10:10:40,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48496#true} {48496#true} #83#return; {48496#true} is VALID [2022-04-28 10:10:40,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {48496#true} call ULTIMATE.init(); {48511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:40,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {48511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48496#true} is VALID [2022-04-28 10:10:40,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {48496#true} assume true; {48496#true} is VALID [2022-04-28 10:10:40,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48496#true} {48496#true} #83#return; {48496#true} is VALID [2022-04-28 10:10:40,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {48496#true} call #t~ret15 := main(); {48496#true} is VALID [2022-04-28 10:10:40,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {48496#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48501#(= main_~y~0 0)} is VALID [2022-04-28 10:10:40,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {48501#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48502#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:40,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {48502#(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; {48503#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:40,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {48503#(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; {48504#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:40,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {48504#(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; {48505#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:40,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {48505#(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; {48506#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:40,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {48506#(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; {48507#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:40,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {48507#(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; {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:40,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:40,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {48509#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:40,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {48509#(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; {48510#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:40,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {48510#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-28 10:10:40,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:40,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:40,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:40,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:40,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:40,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:40,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:40,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {48497#false} assume !(~y~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-28 10:10:40,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {48497#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {48497#false} is VALID [2022-04-28 10:10:40,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {48497#false} assume !(~x~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-28 10:10:40,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {48497#false} assume !(~z~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-28 10:10:40,675 INFO L272 TraceCheckUtils]: 28: Hoare triple {48497#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48497#false} is VALID [2022-04-28 10:10:40,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {48497#false} ~cond := #in~cond; {48497#false} is VALID [2022-04-28 10:10:40,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {48497#false} assume 0 == ~cond; {48497#false} is VALID [2022-04-28 10:10:40,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {48497#false} assume !false; {48497#false} is VALID [2022-04-28 10:10:40,675 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:40,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:40,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632361678] [2022-04-28 10:10:40,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632361678] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:40,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340375403] [2022-04-28 10:10:40,675 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:40,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:40,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:40,676 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:40,678 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:40,713 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:40,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:40,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:10:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:40,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:40,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {48496#true} call ULTIMATE.init(); {48496#true} is VALID [2022-04-28 10:10:40,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {48496#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48496#true} is VALID [2022-04-28 10:10:40,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {48496#true} assume true; {48496#true} is VALID [2022-04-28 10:10:40,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48496#true} {48496#true} #83#return; {48496#true} is VALID [2022-04-28 10:10:40,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {48496#true} call #t~ret15 := main(); {48496#true} is VALID [2022-04-28 10:10:40,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {48496#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48501#(= main_~y~0 0)} is VALID [2022-04-28 10:10:40,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {48501#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48502#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:40,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {48502#(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; {48503#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:40,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {48503#(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; {48504#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:40,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {48504#(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; {48505#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:40,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {48505#(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; {48506#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:40,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {48506#(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; {48507#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:40,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {48507#(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; {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:40,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:40,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {48508#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {48509#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:40,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {48509#(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; {48560#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:40,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {48560#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-28 10:10:40,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:40,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:40,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:40,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:40,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:40,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:40,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:40,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {48497#false} assume !(~y~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-28 10:10:40,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {48497#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {48497#false} is VALID [2022-04-28 10:10:40,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {48497#false} assume !(~x~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-28 10:10:40,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {48497#false} assume !(~z~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-28 10:10:40,991 INFO L272 TraceCheckUtils]: 28: Hoare triple {48497#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48497#false} is VALID [2022-04-28 10:10:40,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {48497#false} ~cond := #in~cond; {48497#false} is VALID [2022-04-28 10:10:40,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {48497#false} assume 0 == ~cond; {48497#false} is VALID [2022-04-28 10:10:40,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {48497#false} assume !false; {48497#false} is VALID [2022-04-28 10:10:40,991 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:40,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:41,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {48497#false} assume !false; {48497#false} is VALID [2022-04-28 10:10:41,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {48497#false} assume 0 == ~cond; {48497#false} is VALID [2022-04-28 10:10:41,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {48497#false} ~cond := #in~cond; {48497#false} is VALID [2022-04-28 10:10:41,211 INFO L272 TraceCheckUtils]: 28: Hoare triple {48497#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48497#false} is VALID [2022-04-28 10:10:41,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {48497#false} assume !(~z~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-28 10:10:41,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {48497#false} assume !(~x~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-28 10:10:41,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {48497#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {48497#false} is VALID [2022-04-28 10:10:41,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {48497#false} assume !(~y~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-28 10:10:41,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:41,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:41,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:41,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:41,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:41,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:41,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {48497#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48497#false} is VALID [2022-04-28 10:10:41,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {48654#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {48497#false} is VALID [2022-04-28 10:10:41,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {48658#(< 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; {48654#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:41,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {48662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {48658#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:41,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {48662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {48662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:41,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {48669#(< 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; {48662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:41,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {48673#(< 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; {48669#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:41,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {48677#(< 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; {48673#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:41,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {48681#(< 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; {48677#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:41,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {48685#(< 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; {48681#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:41,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {48689#(< 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; {48685#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:41,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {48693#(< 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; {48689#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:41,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {48496#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48693#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:41,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {48496#true} call #t~ret15 := main(); {48496#true} is VALID [2022-04-28 10:10:41,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48496#true} {48496#true} #83#return; {48496#true} is VALID [2022-04-28 10:10:41,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {48496#true} assume true; {48496#true} is VALID [2022-04-28 10:10:41,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {48496#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48496#true} is VALID [2022-04-28 10:10:41,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {48496#true} call ULTIMATE.init(); {48496#true} is VALID [2022-04-28 10:10:41,218 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:41,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340375403] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:41,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:41,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:10:41,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:41,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [25805968] [2022-04-28 10:10:41,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [25805968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:41,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:41,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:10:41,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245899304] [2022-04-28 10:10:41,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:41,218 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 32 [2022-04-28 10:10:41,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:41,219 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:10:41,235 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:41,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:10:41,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:41,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:10:41,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:10:41,235 INFO L87 Difference]: Start difference. First operand 252 states and 335 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:10:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:45,234 INFO L93 Difference]: Finished difference Result 395 states and 506 transitions. [2022-04-28 10:10:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:10:45,234 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 32 [2022-04-28 10:10:45,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:45,234 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:10:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-04-28 10:10:45,235 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:10:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-04-28 10:10:45,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 107 transitions. [2022-04-28 10:10:45,314 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:10:45,320 INFO L225 Difference]: With dead ends: 395 [2022-04-28 10:10:45,320 INFO L226 Difference]: Without dead ends: 379 [2022-04-28 10:10:45,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:10:45,320 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 78 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:45,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 100 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:10:45,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-28 10:10:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 252. [2022-04-28 10:10:46,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:46,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 252 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 247 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call 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:46,280 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 252 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 247 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call 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:46,282 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 252 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 247 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call 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:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:46,287 INFO L93 Difference]: Finished difference Result 379 states and 489 transitions. [2022-04-28 10:10:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 489 transitions. [2022-04-28 10:10:46,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:46,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:46,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 247 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-28 10:10:46,287 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 247 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-28 10:10:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:46,293 INFO L93 Difference]: Finished difference Result 379 states and 489 transitions. [2022-04-28 10:10:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 489 transitions. [2022-04-28 10:10:46,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:46,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:46,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:46,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 247 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call 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:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 334 transitions. [2022-04-28 10:10:46,297 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 334 transitions. Word has length 32 [2022-04-28 10:10:46,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:46,297 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 334 transitions. [2022-04-28 10:10:46,297 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:10:46,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 334 transitions. [2022-04-28 10:10:47,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:47,297 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 334 transitions. [2022-04-28 10:10:47,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:47,298 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:47,298 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:47,317 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:47,498 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,SelfDestructingSolverStorable42 [2022-04-28 10:10:47,498 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:47,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:47,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1133720062, now seen corresponding path program 31 times [2022-04-28 10:10:47,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:47,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [775811113] [2022-04-28 10:10:47,501 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:47,501 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:47,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1133720062, now seen corresponding path program 32 times [2022-04-28 10:10:47,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:47,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746974571] [2022-04-28 10:10:47,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:47,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:47,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:47,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {50811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {50788#true} is VALID [2022-04-28 10:10:47,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {50788#true} assume true; {50788#true} is VALID [2022-04-28 10:10:47,771 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50788#true} {50788#true} #83#return; {50788#true} is VALID [2022-04-28 10:10:47,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {50788#true} call ULTIMATE.init(); {50811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:47,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {50811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {50788#true} is VALID [2022-04-28 10:10:47,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {50788#true} assume true; {50788#true} is VALID [2022-04-28 10:10:47,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50788#true} {50788#true} #83#return; {50788#true} is VALID [2022-04-28 10:10:47,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {50788#true} call #t~ret15 := main(); {50788#true} is VALID [2022-04-28 10:10:47,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {50788#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50793#(= main_~y~0 0)} is VALID [2022-04-28 10:10:47,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {50793#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50794#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:47,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {50794#(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; {50795#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:47,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {50795#(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; {50796#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:47,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {50796#(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; {50797#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:47,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {50797#(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; {50798#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:47,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {50798#(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; {50799#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:47,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {50799#(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; {50800#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:47,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {50800#(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; {50801#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:47,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {50801#(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; {50802#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:47,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {50802#(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; {50803#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:47,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {50803#(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; {50804#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:47,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {50804#(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; {50805#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:47,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {50805#(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; {50806#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:47,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {50806#(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; {50807#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:47,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {50807#(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; {50808#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:47,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {50808#(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; {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:47,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:47,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {50810#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:47,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {50810#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-28 10:10:47,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {50789#false} assume !(~y~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-28 10:10:47,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {50789#false} assume !(~x~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-28 10:10:47,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {50789#false} assume !(~z~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-28 10:10:47,781 INFO L272 TraceCheckUtils]: 28: Hoare triple {50789#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50789#false} is VALID [2022-04-28 10:10:47,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {50789#false} ~cond := #in~cond; {50789#false} is VALID [2022-04-28 10:10:47,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {50789#false} assume 0 == ~cond; {50789#false} is VALID [2022-04-28 10:10:47,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {50789#false} assume !false; {50789#false} is VALID [2022-04-28 10:10:47,782 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:47,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:47,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746974571] [2022-04-28 10:10:47,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746974571] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:47,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581391806] [2022-04-28 10:10:47,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:47,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:47,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:47,783 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:47,784 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:47,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:47,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:47,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:10:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:47,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:48,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {50788#true} call ULTIMATE.init(); {50788#true} is VALID [2022-04-28 10:10:48,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {50788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {50788#true} is VALID [2022-04-28 10:10:48,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {50788#true} assume true; {50788#true} is VALID [2022-04-28 10:10:48,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50788#true} {50788#true} #83#return; {50788#true} is VALID [2022-04-28 10:10:48,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {50788#true} call #t~ret15 := main(); {50788#true} is VALID [2022-04-28 10:10:48,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {50788#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50793#(= main_~y~0 0)} is VALID [2022-04-28 10:10:48,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {50793#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50794#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:48,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {50794#(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; {50795#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:48,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {50795#(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; {50796#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:48,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {50796#(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; {50797#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:48,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {50797#(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; {50798#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:48,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {50798#(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; {50799#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:48,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {50799#(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; {50800#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:48,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {50800#(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; {50801#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:48,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {50801#(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; {50802#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:48,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {50802#(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; {50803#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:48,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {50803#(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; {50804#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:48,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {50804#(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; {50805#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:48,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {50805#(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; {50806#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:48,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {50806#(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; {50807#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:48,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {50807#(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; {50808#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:48,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {50808#(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; {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:48,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:48,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {50809#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {50884#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:10:48,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {50884#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-28 10:10:48,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {50789#false} assume !(~y~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-28 10:10:48,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {50789#false} assume !(~x~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-28 10:10:48,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {50789#false} assume !(~z~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-28 10:10:48,105 INFO L272 TraceCheckUtils]: 28: Hoare triple {50789#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50789#false} is VALID [2022-04-28 10:10:48,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {50789#false} ~cond := #in~cond; {50789#false} is VALID [2022-04-28 10:10:48,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {50789#false} assume 0 == ~cond; {50789#false} is VALID [2022-04-28 10:10:48,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {50789#false} assume !false; {50789#false} is VALID [2022-04-28 10:10:48,106 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:48,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:48,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {50789#false} assume !false; {50789#false} is VALID [2022-04-28 10:10:48,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {50789#false} assume 0 == ~cond; {50789#false} is VALID [2022-04-28 10:10:48,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {50789#false} ~cond := #in~cond; {50789#false} is VALID [2022-04-28 10:10:48,640 INFO L272 TraceCheckUtils]: 28: Hoare triple {50789#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50789#false} is VALID [2022-04-28 10:10:48,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {50789#false} assume !(~z~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-28 10:10:48,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {50789#false} assume !(~x~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-28 10:10:48,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {50789#false} assume !(~y~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-28 10:10:48,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {50930#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {50789#false} is VALID [2022-04-28 10:10:48,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {50934#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {50930#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:48,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {50934#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {50934#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:48,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {50941#(< 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; {50934#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:48,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {50945#(< 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; {50941#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:48,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {50949#(< 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; {50945#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:48,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {50953#(< 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; {50949#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:48,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {50957#(< 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; {50953#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:48,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {50961#(< 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; {50957#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:48,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {50965#(< 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; {50961#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:48,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {50969#(< 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; {50965#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:48,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {50973#(< 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; {50969#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:48,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {50977#(< 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; {50973#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:10:48,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {50981#(< 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; {50977#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:10:48,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {50985#(< 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; {50981#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:10:48,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {50989#(< 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; {50985#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:10:48,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {50993#(< 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; {50989#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:10:48,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {50997#(< 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; {50993#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:10:48,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {51001#(< 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; {50997#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:10:48,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {50788#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51001#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:10:48,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {50788#true} call #t~ret15 := main(); {50788#true} is VALID [2022-04-28 10:10:48,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50788#true} {50788#true} #83#return; {50788#true} is VALID [2022-04-28 10:10:48,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {50788#true} assume true; {50788#true} is VALID [2022-04-28 10:10:48,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {50788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {50788#true} is VALID [2022-04-28 10:10:48,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {50788#true} call ULTIMATE.init(); {50788#true} is VALID [2022-04-28 10:10:48,652 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:48,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581391806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:48,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:48,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:10:48,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:48,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [775811113] [2022-04-28 10:10:48,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [775811113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:48,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:48,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:10:48,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950626111] [2022-04-28 10:10:48,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:48,653 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:48,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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,671 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,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:10:48,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:48,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:10:48,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:10:48,672 INFO L87 Difference]: Start difference. First operand 252 states and 334 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:58,220 INFO L93 Difference]: Finished difference Result 573 states and 820 transitions. [2022-04-28 10:10:58,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:10:58,220 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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:58,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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:58,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 221 transitions. [2022-04-28 10:10:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 221 transitions. [2022-04-28 10:10:58,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 221 transitions. [2022-04-28 10:10:58,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:58,407 INFO L225 Difference]: With dead ends: 573 [2022-04-28 10:10:58,407 INFO L226 Difference]: Without dead ends: 541 [2022-04-28 10:10:58,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=748, Invalid=2558, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:10:58,408 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 184 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 3064 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 3158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:58,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 207 Invalid, 3158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3064 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 10:10:58,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-04-28 10:10:59,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 265. [2022-04-28 10:10:59,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:59,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 541 states. Second operand has 265 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 260 states have internal predecessors, (349), 3 states have call successors, (3), 3 states have call 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:59,480 INFO L74 IsIncluded]: Start isIncluded. First operand 541 states. Second operand has 265 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 260 states have internal predecessors, (349), 3 states have call successors, (3), 3 states have call 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:59,480 INFO L87 Difference]: Start difference. First operand 541 states. Second operand has 265 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 260 states have internal predecessors, (349), 3 states have call successors, (3), 3 states have call 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:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:59,490 INFO L93 Difference]: Finished difference Result 541 states and 693 transitions. [2022-04-28 10:10:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 693 transitions. [2022-04-28 10:10:59,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:59,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:59,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 260 states have internal predecessors, (349), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 541 states. [2022-04-28 10:10:59,491 INFO L87 Difference]: Start difference. First operand has 265 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 260 states have internal predecessors, (349), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 541 states. [2022-04-28 10:10:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:59,514 INFO L93 Difference]: Finished difference Result 541 states and 693 transitions. [2022-04-28 10:10:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 693 transitions. [2022-04-28 10:10:59,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:59,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:59,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:59,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 260 states have internal predecessors, (349), 3 states have call successors, (3), 3 states have call 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:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 353 transitions. [2022-04-28 10:10:59,518 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 353 transitions. Word has length 32 [2022-04-28 10:10:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:59,519 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 353 transitions. [2022-04-28 10:10:59,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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:59,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 265 states and 353 transitions. [2022-04-28 10:11:00,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 353 transitions. [2022-04-28 10:11:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:11:00,517 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:00,517 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:00,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-04-28 10:11:00,717 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,SelfDestructingSolverStorable43 [2022-04-28 10:11:00,717 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:00,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:00,717 INFO L85 PathProgramCache]: Analyzing trace with hash -597404912, now seen corresponding path program 15 times [2022-04-28 10:11:00,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:00,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1119363679] [2022-04-28 10:11:00,720 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:00,720 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:00,720 INFO L85 PathProgramCache]: Analyzing trace with hash -597404912, now seen corresponding path program 16 times [2022-04-28 10:11:00,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:00,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11670473] [2022-04-28 10:11:00,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:00,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:00,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:00,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {53834#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53816#true} is VALID [2022-04-28 10:11:00,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {53816#true} assume true; {53816#true} is VALID [2022-04-28 10:11:00,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53816#true} {53816#true} #83#return; {53816#true} is VALID [2022-04-28 10:11:00,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {53816#true} call ULTIMATE.init(); {53834#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:00,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {53834#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53816#true} is VALID [2022-04-28 10:11:00,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {53816#true} assume true; {53816#true} is VALID [2022-04-28 10:11:00,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53816#true} {53816#true} #83#return; {53816#true} is VALID [2022-04-28 10:11:00,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {53816#true} call #t~ret15 := main(); {53816#true} is VALID [2022-04-28 10:11:00,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {53816#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53821#(= main_~y~0 0)} is VALID [2022-04-28 10:11:00,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {53821#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53822#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:00,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {53822#(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; {53823#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:00,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {53823#(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; {53824#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:00,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {53824#(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; {53825#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:00,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {53825#(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; {53826#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:00,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {53826#(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; {53827#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:00,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {53827#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {53827#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:00,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {53827#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {53828#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:00,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {53828#(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; {53829#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:00,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {53829#(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; {53830#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:00,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {53830#(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; {53831#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:11:00,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {53831#(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; {53832#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:11:00,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {53832#(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; {53833#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:11:00,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {53833#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-28 10:11:00,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {53817#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53817#false} is VALID [2022-04-28 10:11:00,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {53817#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53817#false} is VALID [2022-04-28 10:11:00,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {53817#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53817#false} is VALID [2022-04-28 10:11:00,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {53817#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53817#false} is VALID [2022-04-28 10:11:00,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {53817#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53817#false} is VALID [2022-04-28 10:11:00,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {53817#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53817#false} is VALID [2022-04-28 10:11:00,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {53817#false} assume !(~y~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-28 10:11:00,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {53817#false} assume !(~x~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-28 10:11:00,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {53817#false} assume !(~z~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-28 10:11:00,936 INFO L272 TraceCheckUtils]: 29: Hoare triple {53817#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53817#false} is VALID [2022-04-28 10:11:00,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {53817#false} ~cond := #in~cond; {53817#false} is VALID [2022-04-28 10:11:00,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {53817#false} assume 0 == ~cond; {53817#false} is VALID [2022-04-28 10:11:00,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {53817#false} assume !false; {53817#false} is VALID [2022-04-28 10:11:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:11:00,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:00,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11670473] [2022-04-28 10:11:00,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11670473] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:00,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255514926] [2022-04-28 10:11:00,937 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:00,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:00,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:00,939 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:11:00,967 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:11:00,987 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:00,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:00,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:11:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:00,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:01,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {53816#true} call ULTIMATE.init(); {53816#true} is VALID [2022-04-28 10:11:01,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {53816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53816#true} is VALID [2022-04-28 10:11:01,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {53816#true} assume true; {53816#true} is VALID [2022-04-28 10:11:01,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53816#true} {53816#true} #83#return; {53816#true} is VALID [2022-04-28 10:11:01,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {53816#true} call #t~ret15 := main(); {53816#true} is VALID [2022-04-28 10:11:01,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {53816#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53816#true} is VALID [2022-04-28 10:11:01,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {53816#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53816#true} is VALID [2022-04-28 10:11:01,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {53816#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:01,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53863#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:01,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {53863#(< 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; {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:01,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:01,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:01,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:01,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:01,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:01,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:01,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53863#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:01,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {53863#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:01,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-28 10:11:01,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {53817#false} assume !(~z~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-28 10:11:01,210 INFO L272 TraceCheckUtils]: 29: Hoare triple {53817#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53817#false} is VALID [2022-04-28 10:11:01,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {53817#false} ~cond := #in~cond; {53817#false} is VALID [2022-04-28 10:11:01,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {53817#false} assume 0 == ~cond; {53817#false} is VALID [2022-04-28 10:11:01,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {53817#false} assume !false; {53817#false} is VALID [2022-04-28 10:11:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:11:01,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:01,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {53817#false} assume !false; {53817#false} is VALID [2022-04-28 10:11:01,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {53817#false} assume 0 == ~cond; {53817#false} is VALID [2022-04-28 10:11:01,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {53817#false} ~cond := #in~cond; {53817#false} is VALID [2022-04-28 10:11:01,326 INFO L272 TraceCheckUtils]: 29: Hoare triple {53817#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53817#false} is VALID [2022-04-28 10:11:01,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {53817#false} assume !(~z~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-28 10:11:01,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {53817#false} is VALID [2022-04-28 10:11:01,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {53897#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53897#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:01,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {53863#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:01,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53863#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:01,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:01,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:01,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:01,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:01,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53875#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:01,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53871#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:01,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {53863#(< 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; {53867#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:01,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53863#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:01,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {53816#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53859#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:01,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {53816#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53816#true} is VALID [2022-04-28 10:11:01,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {53816#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53816#true} is VALID [2022-04-28 10:11:01,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {53816#true} call #t~ret15 := main(); {53816#true} is VALID [2022-04-28 10:11:01,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53816#true} {53816#true} #83#return; {53816#true} is VALID [2022-04-28 10:11:01,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {53816#true} assume true; {53816#true} is VALID [2022-04-28 10:11:01,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {53816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53816#true} is VALID [2022-04-28 10:11:01,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {53816#true} call ULTIMATE.init(); {53816#true} is VALID [2022-04-28 10:11:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:11:01,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255514926] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:01,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:01,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-28 10:11:01,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:01,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1119363679] [2022-04-28 10:11:01,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1119363679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:01,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:01,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:11:01,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050124391] [2022-04-28 10:11:01,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:01,338 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 33 [2022-04-28 10:11:01,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:01,338 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:11:01,357 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,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:11:01,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:01,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:11:01,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:11:01,358 INFO L87 Difference]: Start difference. First operand 265 states and 353 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:11:05,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:05,259 INFO L93 Difference]: Finished difference Result 382 states and 496 transitions. [2022-04-28 10:11:05,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:11:05,260 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 33 [2022-04-28 10:11:05,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:05,260 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:11:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-28 10:11:05,261 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:11:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-28 10:11:05,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 108 transitions. [2022-04-28 10:11:05,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:05,347 INFO L225 Difference]: With dead ends: 382 [2022-04-28 10:11:05,347 INFO L226 Difference]: Without dead ends: 346 [2022-04-28 10:11:05,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=1704, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:11:05,348 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 66 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:05,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 87 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:11:05,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-04-28 10:11:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 266. [2022-04-28 10:11:06,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:06,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 346 states. Second operand has 266 states, 261 states have (on average 1.3333333333333333) internal successors, (348), 261 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:06,359 INFO L74 IsIncluded]: Start isIncluded. First operand 346 states. Second operand has 266 states, 261 states have (on average 1.3333333333333333) internal successors, (348), 261 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:06,359 INFO L87 Difference]: Start difference. First operand 346 states. Second operand has 266 states, 261 states have (on average 1.3333333333333333) internal successors, (348), 261 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:06,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:06,364 INFO L93 Difference]: Finished difference Result 346 states and 456 transitions. [2022-04-28 10:11:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 456 transitions. [2022-04-28 10:11:06,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:06,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:06,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 266 states, 261 states have (on average 1.3333333333333333) internal successors, (348), 261 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 346 states. [2022-04-28 10:11:06,364 INFO L87 Difference]: Start difference. First operand has 266 states, 261 states have (on average 1.3333333333333333) internal successors, (348), 261 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 346 states. [2022-04-28 10:11:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:06,369 INFO L93 Difference]: Finished difference Result 346 states and 456 transitions. [2022-04-28 10:11:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 456 transitions. [2022-04-28 10:11:06,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:06,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:06,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:06,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 261 states have (on average 1.3333333333333333) internal successors, (348), 261 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 352 transitions. [2022-04-28 10:11:06,373 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 352 transitions. Word has length 33 [2022-04-28 10:11:06,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:06,373 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 352 transitions. [2022-04-28 10:11:06,373 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:11:06,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 266 states and 352 transitions. [2022-04-28 10:11:07,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 352 transitions. [2022-04-28 10:11:07,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:11:07,504 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:07,504 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:07,522 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:11:07,704 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,SelfDestructingSolverStorable44 [2022-04-28 10:11:07,705 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:07,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:07,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1655474447, now seen corresponding path program 33 times [2022-04-28 10:11:07,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:07,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1258001854] [2022-04-28 10:11:07,707 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:07,707 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1655474447, now seen corresponding path program 34 times [2022-04-28 10:11:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:07,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105286517] [2022-04-28 10:11:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:07,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:08,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:08,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {56094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56070#true} is VALID [2022-04-28 10:11:08,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {56070#true} assume true; {56070#true} is VALID [2022-04-28 10:11:08,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56070#true} {56070#true} #83#return; {56070#true} is VALID [2022-04-28 10:11:08,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {56070#true} call ULTIMATE.init(); {56094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:08,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {56094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56070#true} is VALID [2022-04-28 10:11:08,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {56070#true} assume true; {56070#true} is VALID [2022-04-28 10:11:08,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56070#true} {56070#true} #83#return; {56070#true} is VALID [2022-04-28 10:11:08,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {56070#true} call #t~ret15 := main(); {56070#true} is VALID [2022-04-28 10:11:08,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {56070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56075#(= main_~y~0 0)} is VALID [2022-04-28 10:11:08,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {56075#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:08,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {56076#(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; {56077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:08,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {56077#(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; {56078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:08,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {56078#(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; {56079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:08,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {56079#(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; {56080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:08,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {56080#(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; {56081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:08,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {56081#(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; {56082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:08,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {56082#(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; {56083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:08,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {56083#(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; {56084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:08,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {56084#(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; {56085#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:08,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {56085#(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; {56086#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:08,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {56086#(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; {56087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:08,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {56087#(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; {56088#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:08,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {56088#(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; {56089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:08,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {56089#(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; {56090#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:08,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {56090#(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; {56091#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:08,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {56091#(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; {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:08,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:08,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {56093#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-28 10:11:08,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {56093#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-28 10:11:08,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {56071#false} assume !(~y~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-28 10:11:08,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {56071#false} assume !(~x~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-28 10:11:08,037 INFO L290 TraceCheckUtils]: 28: Hoare triple {56071#false} assume !(~z~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-28 10:11:08,037 INFO L272 TraceCheckUtils]: 29: Hoare triple {56071#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56071#false} is VALID [2022-04-28 10:11:08,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {56071#false} ~cond := #in~cond; {56071#false} is VALID [2022-04-28 10:11:08,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {56071#false} assume 0 == ~cond; {56071#false} is VALID [2022-04-28 10:11:08,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {56071#false} assume !false; {56071#false} is VALID [2022-04-28 10:11:08,037 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:11:08,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:08,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105286517] [2022-04-28 10:11:08,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105286517] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:08,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647665940] [2022-04-28 10:11:08,038 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:08,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:08,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:08,039 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:11:08,040 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:11:08,079 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:08,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:08,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:11:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:08,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:08,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {56070#true} call ULTIMATE.init(); {56070#true} is VALID [2022-04-28 10:11:08,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {56070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56070#true} is VALID [2022-04-28 10:11:08,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {56070#true} assume true; {56070#true} is VALID [2022-04-28 10:11:08,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56070#true} {56070#true} #83#return; {56070#true} is VALID [2022-04-28 10:11:08,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {56070#true} call #t~ret15 := main(); {56070#true} is VALID [2022-04-28 10:11:08,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {56070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56075#(= main_~y~0 0)} is VALID [2022-04-28 10:11:08,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {56075#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:08,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {56076#(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; {56077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:08,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {56077#(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; {56078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:08,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {56078#(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; {56079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:08,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {56079#(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; {56080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:08,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {56080#(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; {56081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:08,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {56081#(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; {56082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:08,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {56082#(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; {56083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:08,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {56083#(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; {56084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:08,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {56084#(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; {56085#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:08,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {56085#(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; {56086#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:08,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {56086#(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; {56087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:08,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {56087#(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; {56088#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:08,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {56088#(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; {56089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:08,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {56089#(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; {56090#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:08,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {56090#(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; {56091#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:08,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {56091#(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; {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:08,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:08,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {56092#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {56170#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-28 10:11:08,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {56170#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-28 10:11:08,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {56071#false} assume !(~y~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-28 10:11:08,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {56071#false} assume !(~x~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-28 10:11:08,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {56071#false} assume !(~z~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-28 10:11:08,434 INFO L272 TraceCheckUtils]: 29: Hoare triple {56071#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56071#false} is VALID [2022-04-28 10:11:08,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {56071#false} ~cond := #in~cond; {56071#false} is VALID [2022-04-28 10:11:08,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {56071#false} assume 0 == ~cond; {56071#false} is VALID [2022-04-28 10:11:08,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {56071#false} assume !false; {56071#false} is VALID [2022-04-28 10:11:08,434 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:11:08,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:09,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {56071#false} assume !false; {56071#false} is VALID [2022-04-28 10:11:09,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {56071#false} assume 0 == ~cond; {56071#false} is VALID [2022-04-28 10:11:09,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {56071#false} ~cond := #in~cond; {56071#false} is VALID [2022-04-28 10:11:09,072 INFO L272 TraceCheckUtils]: 29: Hoare triple {56071#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56071#false} is VALID [2022-04-28 10:11:09,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {56071#false} assume !(~z~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-28 10:11:09,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {56071#false} assume !(~x~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-28 10:11:09,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {56071#false} assume !(~y~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-28 10:11:09,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {56216#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {56071#false} is VALID [2022-04-28 10:11:09,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {56220#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {56216#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:09,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {56220#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {56220#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:09,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {56227#(< 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; {56220#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:09,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {56231#(< 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; {56227#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:09,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {56235#(< 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; {56231#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:09,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {56239#(< 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; {56235#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:09,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {56243#(< 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; {56239#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:09,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {56247#(< 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; {56243#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:09,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {56251#(< 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; {56247#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:09,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {56255#(< 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; {56251#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:09,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {56259#(< 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; {56255#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:09,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {56263#(< 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; {56259#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:09,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {56267#(< 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; {56263#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:09,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {56271#(< 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; {56267#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:11:09,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {56275#(< 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; {56271#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:11:09,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {56279#(< 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; {56275#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:11:09,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {56283#(< 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; {56279#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:11:09,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {56287#(< 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; {56283#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:11:09,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {56291#(< 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; {56287#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:11:09,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {56070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56291#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:11:09,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {56070#true} call #t~ret15 := main(); {56070#true} is VALID [2022-04-28 10:11:09,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56070#true} {56070#true} #83#return; {56070#true} is VALID [2022-04-28 10:11:09,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {56070#true} assume true; {56070#true} is VALID [2022-04-28 10:11:09,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {56070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56070#true} is VALID [2022-04-28 10:11:09,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {56070#true} call ULTIMATE.init(); {56070#true} is VALID [2022-04-28 10:11:09,104 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:11:09,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647665940] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:09,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:09,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:11:09,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:09,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1258001854] [2022-04-28 10:11:09,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1258001854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:09,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:09,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:11:09,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437060257] [2022-04-28 10:11:09,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:09,105 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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:09,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:09,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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:09,128 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:09,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:11:09,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:09,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:11:09,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:11:09,130 INFO L87 Difference]: Start difference. First operand 266 states and 352 transitions. Second operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:19,590 INFO L93 Difference]: Finished difference Result 603 states and 863 transitions. [2022-04-28 10:11:19,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:11:19,590 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 233 transitions. [2022-04-28 10:11:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 233 transitions. [2022-04-28 10:11:19,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 233 transitions. [2022-04-28 10:11:19,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:19,794 INFO L225 Difference]: With dead ends: 603 [2022-04-28 10:11:19,795 INFO L226 Difference]: Without dead ends: 571 [2022-04-28 10:11:19,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=827, Invalid=2833, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:11:19,796 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 200 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3441 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 3543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 3441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:19,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 219 Invalid, 3543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 3441 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 10:11:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-04-28 10:11:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 279. [2022-04-28 10:11:20,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:20,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand has 279 states, 274 states have (on average 1.3394160583941606) internal successors, (367), 274 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call 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:20,873 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand has 279 states, 274 states have (on average 1.3394160583941606) internal successors, (367), 274 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call 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:20,874 INFO L87 Difference]: Start difference. First operand 571 states. Second operand has 279 states, 274 states have (on average 1.3394160583941606) internal successors, (367), 274 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call 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:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:20,884 INFO L93 Difference]: Finished difference Result 571 states and 731 transitions. [2022-04-28 10:11:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 731 transitions. [2022-04-28 10:11:20,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:20,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:20,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 279 states, 274 states have (on average 1.3394160583941606) internal successors, (367), 274 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 571 states. [2022-04-28 10:11:20,885 INFO L87 Difference]: Start difference. First operand has 279 states, 274 states have (on average 1.3394160583941606) internal successors, (367), 274 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 571 states. [2022-04-28 10:11:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:20,895 INFO L93 Difference]: Finished difference Result 571 states and 731 transitions. [2022-04-28 10:11:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 731 transitions. [2022-04-28 10:11:20,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:20,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:20,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:20,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 274 states have (on average 1.3394160583941606) internal successors, (367), 274 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call 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:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 371 transitions. [2022-04-28 10:11:20,900 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 371 transitions. Word has length 33 [2022-04-28 10:11:20,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:20,900 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 371 transitions. [2022-04-28 10:11:20,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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:20,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 279 states and 371 transitions. [2022-04-28 10:11:22,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 371 transitions. [2022-04-28 10:11:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:11:22,233 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:22,234 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:22,250 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:11:22,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-28 10:11:22,448 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:22,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:22,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1633078978, now seen corresponding path program 17 times [2022-04-28 10:11:22,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:22,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1777578196] [2022-04-28 10:11:22,450 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:22,450 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:22,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1633078978, now seen corresponding path program 18 times [2022-04-28 10:11:22,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:22,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724003594] [2022-04-28 10:11:22,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:22,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:22,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:22,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {59276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59256#true} is VALID [2022-04-28 10:11:22,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {59256#true} assume true; {59256#true} is VALID [2022-04-28 10:11:22,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59256#true} {59256#true} #83#return; {59256#true} is VALID [2022-04-28 10:11:22,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {59256#true} call ULTIMATE.init(); {59276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:22,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {59276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59256#true} is VALID [2022-04-28 10:11:22,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {59256#true} assume true; {59256#true} is VALID [2022-04-28 10:11:22,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59256#true} {59256#true} #83#return; {59256#true} is VALID [2022-04-28 10:11:22,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {59256#true} call #t~ret15 := main(); {59256#true} is VALID [2022-04-28 10:11:22,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {59256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59261#(= main_~y~0 0)} is VALID [2022-04-28 10:11:22,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {59261#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:22,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {59262#(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; {59263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:22,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {59263#(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; {59264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:22,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {59264#(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; {59265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:22,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {59265#(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; {59266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:22,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {59266#(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; {59267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:22,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {59267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {59267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:22,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {59267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {59268#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:22,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {59268#(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; {59269#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:22,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {59269#(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; {59270#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:22,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {59270#(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; {59271#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:11:22,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {59271#(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; {59272#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:11:22,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {59272#(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; {59273#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:11:22,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {59273#(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; {59274#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:11:22,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {59274#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {59274#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:11:22,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {59274#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59273#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:11:22,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {59273#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59272#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:11:22,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {59272#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59271#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:11:22,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {59271#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59270#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:22,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {59270#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59269#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:22,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {59269#(and (<= main_~z~0 5) (<= 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; {59275#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:22,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {59275#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {59275#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:22,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {59275#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {59275#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:22,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {59275#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {59257#false} is VALID [2022-04-28 10:11:22,760 INFO L272 TraceCheckUtils]: 30: Hoare triple {59257#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59257#false} is VALID [2022-04-28 10:11:22,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {59257#false} ~cond := #in~cond; {59257#false} is VALID [2022-04-28 10:11:22,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {59257#false} assume 0 == ~cond; {59257#false} is VALID [2022-04-28 10:11:22,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {59257#false} assume !false; {59257#false} is VALID [2022-04-28 10:11:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:22,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:22,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724003594] [2022-04-28 10:11:22,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724003594] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:22,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245953242] [2022-04-28 10:11:22,760 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:22,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:22,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:22,762 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:11:22,768 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:11:22,859 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:11:22,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:22,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:11:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:22,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:23,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {59256#true} call ULTIMATE.init(); {59256#true} is VALID [2022-04-28 10:11:23,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {59256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59256#true} is VALID [2022-04-28 10:11:23,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {59256#true} assume true; {59256#true} is VALID [2022-04-28 10:11:23,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59256#true} {59256#true} #83#return; {59256#true} is VALID [2022-04-28 10:11:23,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {59256#true} call #t~ret15 := main(); {59256#true} is VALID [2022-04-28 10:11:23,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {59256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59256#true} is VALID [2022-04-28 10:11:23,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {59256#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:23,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:23,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {59302#(< 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; {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:23,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:23,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:23,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:11:23,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:11:23,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:11:23,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:23,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:23,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:23,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:23,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {59302#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:23,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {59257#false} is VALID [2022-04-28 10:11:23,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {59257#false} assume !(~z~0 % 4294967296 > 0); {59257#false} is VALID [2022-04-28 10:11:23,119 INFO L272 TraceCheckUtils]: 30: Hoare triple {59257#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59257#false} is VALID [2022-04-28 10:11:23,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {59257#false} ~cond := #in~cond; {59257#false} is VALID [2022-04-28 10:11:23,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {59257#false} assume 0 == ~cond; {59257#false} is VALID [2022-04-28 10:11:23,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {59257#false} assume !false; {59257#false} is VALID [2022-04-28 10:11:23,119 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:23,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:23,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {59257#false} assume !false; {59257#false} is VALID [2022-04-28 10:11:23,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {59257#false} assume 0 == ~cond; {59257#false} is VALID [2022-04-28 10:11:23,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {59257#false} ~cond := #in~cond; {59257#false} is VALID [2022-04-28 10:11:23,233 INFO L272 TraceCheckUtils]: 30: Hoare triple {59257#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59257#false} is VALID [2022-04-28 10:11:23,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {59257#false} assume !(~z~0 % 4294967296 > 0); {59257#false} is VALID [2022-04-28 10:11:23,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {59257#false} is VALID [2022-04-28 10:11:23,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {59343#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59343#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {59302#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:23,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:23,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:23,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:23,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:23,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:11:23,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:11:23,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59318#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:11:23,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59314#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:23,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59310#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:23,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {59302#(< 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; {59306#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:23,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59302#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:23,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {59256#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59298#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:23,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {59256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59256#true} is VALID [2022-04-28 10:11:23,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {59256#true} call #t~ret15 := main(); {59256#true} is VALID [2022-04-28 10:11:23,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59256#true} {59256#true} #83#return; {59256#true} is VALID [2022-04-28 10:11:23,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {59256#true} assume true; {59256#true} is VALID [2022-04-28 10:11:23,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {59256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59256#true} is VALID [2022-04-28 10:11:23,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {59256#true} call ULTIMATE.init(); {59256#true} is VALID [2022-04-28 10:11:23,245 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:23,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245953242] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:23,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:23,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-28 10:11:23,245 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:23,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1777578196] [2022-04-28 10:11:23,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1777578196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:23,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:23,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:11:23,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934544899] [2022-04-28 10:11:23,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:23,246 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 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:23,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:23,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 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:23,271 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:23,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:11:23,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:23,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:11:23,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:11:23,272 INFO L87 Difference]: Start difference. First operand 279 states and 371 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 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:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:31,658 INFO L93 Difference]: Finished difference Result 426 states and 594 transitions. [2022-04-28 10:11:31,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-28 10:11:31,658 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 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:31,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 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:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 247 transitions. [2022-04-28 10:11:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 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:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 247 transitions. [2022-04-28 10:11:31,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 247 transitions. [2022-04-28 10:11:31,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:31,871 INFO L225 Difference]: With dead ends: 426 [2022-04-28 10:11:31,871 INFO L226 Difference]: Without dead ends: 411 [2022-04-28 10:11:31,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1911 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=455, Invalid=7201, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 10:11:31,872 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 100 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:31,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 115 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 10:11:31,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-28 10:11:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 288. [2022-04-28 10:11:33,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:33,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 288 states, 283 states have (on average 1.3286219081272084) internal successors, (376), 283 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call 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:33,005 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 288 states, 283 states have (on average 1.3286219081272084) internal successors, (376), 283 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call 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:33,005 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 288 states, 283 states have (on average 1.3286219081272084) internal successors, (376), 283 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call 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:33,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:33,011 INFO L93 Difference]: Finished difference Result 411 states and 520 transitions. [2022-04-28 10:11:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 520 transitions. [2022-04-28 10:11:33,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:33,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:33,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 283 states have (on average 1.3286219081272084) internal successors, (376), 283 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 411 states. [2022-04-28 10:11:33,012 INFO L87 Difference]: Start difference. First operand has 288 states, 283 states have (on average 1.3286219081272084) internal successors, (376), 283 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 411 states. [2022-04-28 10:11:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:33,018 INFO L93 Difference]: Finished difference Result 411 states and 520 transitions. [2022-04-28 10:11:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 520 transitions. [2022-04-28 10:11:33,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:33,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:33,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:33,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 283 states have (on average 1.3286219081272084) internal successors, (376), 283 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call 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:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 380 transitions. [2022-04-28 10:11:33,022 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 380 transitions. Word has length 34 [2022-04-28 10:11:33,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:33,022 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 380 transitions. [2022-04-28 10:11:33,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 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:33,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 288 states and 380 transitions. [2022-04-28 10:11:34,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:34,158 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 380 transitions. [2022-04-28 10:11:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:11:34,158 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:34,158 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:34,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:34,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:34,359 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:34,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:34,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1620223476, now seen corresponding path program 17 times [2022-04-28 10:11:34,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:34,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1273132811] [2022-04-28 10:11:34,361 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:34,361 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:34,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1620223476, now seen corresponding path program 18 times [2022-04-28 10:11:34,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:34,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727982811] [2022-04-28 10:11:34,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:34,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:34,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:34,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {61879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61863#true} is VALID [2022-04-28 10:11:34,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {61863#true} assume true; {61863#true} is VALID [2022-04-28 10:11:34,544 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61863#true} {61863#true} #83#return; {61863#true} is VALID [2022-04-28 10:11:34,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {61863#true} call ULTIMATE.init(); {61879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:34,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {61879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61863#true} is VALID [2022-04-28 10:11:34,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {61863#true} assume true; {61863#true} is VALID [2022-04-28 10:11:34,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61863#true} {61863#true} #83#return; {61863#true} is VALID [2022-04-28 10:11:34,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {61863#true} call #t~ret15 := main(); {61863#true} is VALID [2022-04-28 10:11:34,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {61863#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61868#(= main_~y~0 0)} is VALID [2022-04-28 10:11:34,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {61868#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61869#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:34,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {61869#(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; {61870#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:34,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {61870#(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; {61871#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:34,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {61871#(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; {61872#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:34,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {61872#(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; {61873#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:34,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {61873#(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; {61874#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:34,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {61874#(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; {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:34,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:34,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {61876#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:34,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {61876#(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; {61877#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:34,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {61877#(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; {61878#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:34,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {61878#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-28 10:11:34,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:34,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:34,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:34,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:34,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:34,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:34,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:34,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {61864#false} assume !(~y~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-28 10:11:34,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {61864#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61864#false} is VALID [2022-04-28 10:11:34,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {61864#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61864#false} is VALID [2022-04-28 10:11:34,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {61864#false} assume !(~x~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-28 10:11:34,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {61864#false} assume !(~z~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-28 10:11:34,551 INFO L272 TraceCheckUtils]: 30: Hoare triple {61864#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {61864#false} is VALID [2022-04-28 10:11:34,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {61864#false} ~cond := #in~cond; {61864#false} is VALID [2022-04-28 10:11:34,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {61864#false} assume 0 == ~cond; {61864#false} is VALID [2022-04-28 10:11:34,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {61864#false} assume !false; {61864#false} is VALID [2022-04-28 10:11:34,552 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:34,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:34,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727982811] [2022-04-28 10:11:34,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727982811] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:34,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032547608] [2022-04-28 10:11:34,552 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:34,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:34,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:34,553 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:11:34,566 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:11:34,655 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:11:34,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:34,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:11:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:34,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:34,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {61863#true} call ULTIMATE.init(); {61863#true} is VALID [2022-04-28 10:11:34,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {61863#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61863#true} is VALID [2022-04-28 10:11:34,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {61863#true} assume true; {61863#true} is VALID [2022-04-28 10:11:34,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61863#true} {61863#true} #83#return; {61863#true} is VALID [2022-04-28 10:11:34,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {61863#true} call #t~ret15 := main(); {61863#true} is VALID [2022-04-28 10:11:34,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {61863#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61868#(= main_~y~0 0)} is VALID [2022-04-28 10:11:34,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {61868#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61869#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:34,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {61869#(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; {61870#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:34,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {61870#(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; {61871#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:34,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {61871#(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; {61872#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:34,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {61872#(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; {61873#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:34,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {61873#(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; {61874#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:34,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {61874#(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; {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:34,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:34,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {61875#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {61876#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:34,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {61876#(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; {61877#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:34,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {61877#(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; {61931#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {61931#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {61864#false} assume !(~y~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {61864#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {61864#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {61864#false} assume !(~x~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {61864#false} assume !(~z~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L272 TraceCheckUtils]: 30: Hoare triple {61864#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {61864#false} ~cond := #in~cond; {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {61864#false} assume 0 == ~cond; {61864#false} is VALID [2022-04-28 10:11:34,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {61864#false} assume !false; {61864#false} is VALID [2022-04-28 10:11:34,892 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:34,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:35,171 INFO L290 TraceCheckUtils]: 33: Hoare triple {61864#false} assume !false; {61864#false} is VALID [2022-04-28 10:11:35,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {61864#false} assume 0 == ~cond; {61864#false} is VALID [2022-04-28 10:11:35,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {61864#false} ~cond := #in~cond; {61864#false} is VALID [2022-04-28 10:11:35,172 INFO L272 TraceCheckUtils]: 30: Hoare triple {61864#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {61864#false} is VALID [2022-04-28 10:11:35,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {61864#false} assume !(~z~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-28 10:11:35,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {61864#false} assume !(~x~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-28 10:11:35,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {61864#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61864#false} is VALID [2022-04-28 10:11:35,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {61864#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61864#false} is VALID [2022-04-28 10:11:35,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {61864#false} assume !(~y~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-28 10:11:35,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:35,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:35,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:35,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:35,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:35,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:35,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {61864#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61864#false} is VALID [2022-04-28 10:11:35,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {62031#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {61864#false} is VALID [2022-04-28 10:11:35,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {62035#(< 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; {62031#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:35,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {62039#(< 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; {62035#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:35,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {62043#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {62039#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:35,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {62043#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {62043#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:35,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {62050#(< 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; {62043#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:35,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {62054#(< 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; {62050#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:35,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {62058#(< 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; {62054#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:35,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {62062#(< 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; {62058#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:35,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {62066#(< 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; {62062#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:35,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {62070#(< 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; {62066#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:35,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {62074#(< 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; {62070#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:35,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {61863#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62074#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:35,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {61863#true} call #t~ret15 := main(); {61863#true} is VALID [2022-04-28 10:11:35,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61863#true} {61863#true} #83#return; {61863#true} is VALID [2022-04-28 10:11:35,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {61863#true} assume true; {61863#true} is VALID [2022-04-28 10:11:35,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {61863#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61863#true} is VALID [2022-04-28 10:11:35,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {61863#true} call ULTIMATE.init(); {61863#true} is VALID [2022-04-28 10:11:35,181 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:35,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032547608] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:35,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:35,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:11:35,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:35,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1273132811] [2022-04-28 10:11:35,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1273132811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:35,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:35,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:11:35,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648819522] [2022-04-28 10:11:35,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:35,182 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 34 [2022-04-28 10:11:35,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:35,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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:35,201 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:35,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:11:35,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:35,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:11:35,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:11:35,202 INFO L87 Difference]: Start difference. First operand 288 states and 380 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:40,436 INFO L93 Difference]: Finished difference Result 437 states and 565 transitions. [2022-04-28 10:11:40,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:11:40,436 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 34 [2022-04-28 10:11:40,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2022-04-28 10:11:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2022-04-28 10:11:40,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 110 transitions. [2022-04-28 10:11:40,520 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:11:40,528 INFO L225 Difference]: With dead ends: 437 [2022-04-28 10:11:40,528 INFO L226 Difference]: Without dead ends: 420 [2022-04-28 10:11:40,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=326, Invalid=1234, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:11:40,529 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 82 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:40,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 109 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:11:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-28 10:11:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 288. [2022-04-28 10:11:41,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:41,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 420 states. Second operand has 288 states, 283 states have (on average 1.325088339222615) internal successors, (375), 283 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call 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,688 INFO L74 IsIncluded]: Start isIncluded. First operand 420 states. Second operand has 288 states, 283 states have (on average 1.325088339222615) internal successors, (375), 283 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call 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,688 INFO L87 Difference]: Start difference. First operand 420 states. Second operand has 288 states, 283 states have (on average 1.325088339222615) internal successors, (375), 283 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call 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,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:41,694 INFO L93 Difference]: Finished difference Result 420 states and 547 transitions. [2022-04-28 10:11:41,694 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 547 transitions. [2022-04-28 10:11:41,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:41,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:41,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 283 states have (on average 1.325088339222615) internal successors, (375), 283 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 420 states. [2022-04-28 10:11:41,695 INFO L87 Difference]: Start difference. First operand has 288 states, 283 states have (on average 1.325088339222615) internal successors, (375), 283 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 420 states. [2022-04-28 10:11:41,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:41,701 INFO L93 Difference]: Finished difference Result 420 states and 547 transitions. [2022-04-28 10:11:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 547 transitions. [2022-04-28 10:11:41,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:41,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:41,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:41,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 283 states have (on average 1.325088339222615) internal successors, (375), 283 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call 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,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 379 transitions. [2022-04-28 10:11:41,706 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 379 transitions. Word has length 34 [2022-04-28 10:11:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:41,706 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 379 transitions. [2022-04-28 10:11:41,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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:41,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 288 states and 379 transitions. [2022-04-28 10:11:42,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 379 transitions. [2022-04-28 10:11:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:11:42,979 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:42,980 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:42,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:43,195 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,SelfDestructingSolverStorable47 [2022-04-28 10:11:43,195 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:43,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:43,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1290423902, now seen corresponding path program 19 times [2022-04-28 10:11:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:43,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [687257160] [2022-04-28 10:11:43,198 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:43,198 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1290423902, now seen corresponding path program 20 times [2022-04-28 10:11:43,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:43,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039010749] [2022-04-28 10:11:43,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:43,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:43,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:43,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {64429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64413#true} is VALID [2022-04-28 10:11:43,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {64413#true} assume true; {64413#true} is VALID [2022-04-28 10:11:43,352 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64413#true} {64413#true} #83#return; {64413#true} is VALID [2022-04-28 10:11:43,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {64413#true} call ULTIMATE.init(); {64429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:43,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {64429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64413#true} is VALID [2022-04-28 10:11:43,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {64413#true} assume true; {64413#true} is VALID [2022-04-28 10:11:43,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64413#true} {64413#true} #83#return; {64413#true} is VALID [2022-04-28 10:11:43,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {64413#true} call #t~ret15 := main(); {64413#true} is VALID [2022-04-28 10:11:43,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {64413#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64418#(= main_~y~0 0)} is VALID [2022-04-28 10:11:43,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {64418#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64419#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:43,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {64419#(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; {64420#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:43,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {64420#(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; {64421#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:43,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {64421#(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; {64422#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:43,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {64422#(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; {64423#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:43,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {64423#(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; {64424#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:43,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {64424#(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; {64425#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:43,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {64425#(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; {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:43,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:43,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {64427#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:43,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {64427#(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; {64428#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:43,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {64428#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-28 10:11:43,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {64414#false} assume !(~y~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-28 10:11:43,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {64414#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {64414#false} is VALID [2022-04-28 10:11:43,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {64414#false} assume !(~x~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-28 10:11:43,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {64414#false} assume !(~z~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-28 10:11:43,359 INFO L272 TraceCheckUtils]: 30: Hoare triple {64414#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64414#false} is VALID [2022-04-28 10:11:43,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {64414#false} ~cond := #in~cond; {64414#false} is VALID [2022-04-28 10:11:43,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {64414#false} assume 0 == ~cond; {64414#false} is VALID [2022-04-28 10:11:43,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {64414#false} assume !false; {64414#false} is VALID [2022-04-28 10:11:43,359 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:43,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:43,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039010749] [2022-04-28 10:11:43,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039010749] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:43,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268207517] [2022-04-28 10:11:43,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:43,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:43,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:43,368 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:11:43,369 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:11:43,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:43,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:43,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:11:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:43,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:43,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {64413#true} call ULTIMATE.init(); {64413#true} is VALID [2022-04-28 10:11:43,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {64413#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64413#true} is VALID [2022-04-28 10:11:43,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {64413#true} assume true; {64413#true} is VALID [2022-04-28 10:11:43,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64413#true} {64413#true} #83#return; {64413#true} is VALID [2022-04-28 10:11:43,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {64413#true} call #t~ret15 := main(); {64413#true} is VALID [2022-04-28 10:11:43,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {64413#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64418#(= main_~y~0 0)} is VALID [2022-04-28 10:11:43,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {64418#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64419#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:43,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {64419#(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; {64420#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:43,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {64420#(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; {64421#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:43,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {64421#(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; {64422#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:43,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {64422#(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; {64423#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:43,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {64423#(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; {64424#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:43,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {64424#(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; {64425#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:43,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {64425#(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; {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:43,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:43,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {64426#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {64427#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:43,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {64427#(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; {64481#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:43,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {64481#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-28 10:11:43,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {64414#false} assume !(~y~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-28 10:11:43,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {64414#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {64414#false} is VALID [2022-04-28 10:11:43,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {64414#false} assume !(~x~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-28 10:11:43,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {64414#false} assume !(~z~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-28 10:11:43,637 INFO L272 TraceCheckUtils]: 30: Hoare triple {64414#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64414#false} is VALID [2022-04-28 10:11:43,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {64414#false} ~cond := #in~cond; {64414#false} is VALID [2022-04-28 10:11:43,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {64414#false} assume 0 == ~cond; {64414#false} is VALID [2022-04-28 10:11:43,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {64414#false} assume !false; {64414#false} is VALID [2022-04-28 10:11:43,637 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:43,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:43,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {64414#false} assume !false; {64414#false} is VALID [2022-04-28 10:11:43,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {64414#false} assume 0 == ~cond; {64414#false} is VALID [2022-04-28 10:11:43,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {64414#false} ~cond := #in~cond; {64414#false} is VALID [2022-04-28 10:11:43,924 INFO L272 TraceCheckUtils]: 30: Hoare triple {64414#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64414#false} is VALID [2022-04-28 10:11:43,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {64414#false} assume !(~z~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-28 10:11:43,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {64414#false} assume !(~x~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-28 10:11:43,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {64414#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {64414#false} is VALID [2022-04-28 10:11:43,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {64414#false} assume !(~y~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-28 10:11:43,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {64414#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64414#false} is VALID [2022-04-28 10:11:43,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {64581#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {64414#false} is VALID [2022-04-28 10:11:43,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {64585#(< 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; {64581#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:43,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {64589#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {64585#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:43,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {64589#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {64589#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:43,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {64596#(< 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; {64589#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:43,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {64600#(< 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; {64596#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:43,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {64604#(< 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; {64600#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:43,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {64608#(< 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; {64604#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:43,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {64612#(< 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; {64608#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:43,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {64616#(< 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; {64612#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:43,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {64620#(< 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; {64616#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:43,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {64624#(< 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; {64620#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:43,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {64413#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64624#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:43,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {64413#true} call #t~ret15 := main(); {64413#true} is VALID [2022-04-28 10:11:43,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64413#true} {64413#true} #83#return; {64413#true} is VALID [2022-04-28 10:11:43,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {64413#true} assume true; {64413#true} is VALID [2022-04-28 10:11:43,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {64413#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64413#true} is VALID [2022-04-28 10:11:43,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {64413#true} call ULTIMATE.init(); {64413#true} is VALID [2022-04-28 10:11:43,935 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:43,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268207517] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:43,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:43,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:11:43,935 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:43,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [687257160] [2022-04-28 10:11:43,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [687257160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:43,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:43,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:11:43,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680128237] [2022-04-28 10:11:43,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:43,936 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 34 [2022-04-28 10:11:43,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:43,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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:43,956 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:43,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:11:43,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:43,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:11:43,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:11:43,956 INFO L87 Difference]: Start difference. First operand 288 states and 379 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:49,700 INFO L93 Difference]: Finished difference Result 465 states and 597 transitions. [2022-04-28 10:11:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:11:49,701 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 34 [2022-04-28 10:11:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-28 10:11:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-28 10:11:49,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 118 transitions. [2022-04-28 10:11:49,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:49,820 INFO L225 Difference]: With dead ends: 465 [2022-04-28 10:11:49,821 INFO L226 Difference]: Without dead ends: 448 [2022-04-28 10:11:49,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 58 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:49,821 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 96 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:49,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 112 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:11:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-04-28 10:11:51,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 288. [2022-04-28 10:11:51,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:51,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 448 states. Second operand has 288 states, 283 states have (on average 1.3215547703180213) internal successors, (374), 283 states have internal predecessors, (374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:51,142 INFO L74 IsIncluded]: Start isIncluded. First operand 448 states. Second operand has 288 states, 283 states have (on average 1.3215547703180213) internal successors, (374), 283 states have internal predecessors, (374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:51,142 INFO L87 Difference]: Start difference. First operand 448 states. Second operand has 288 states, 283 states have (on average 1.3215547703180213) internal successors, (374), 283 states have internal predecessors, (374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:51,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:51,151 INFO L93 Difference]: Finished difference Result 448 states and 579 transitions. [2022-04-28 10:11:51,151 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 579 transitions. [2022-04-28 10:11:51,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:51,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:51,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 283 states have (on average 1.3215547703180213) internal successors, (374), 283 states have internal predecessors, (374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 448 states. [2022-04-28 10:11:51,152 INFO L87 Difference]: Start difference. First operand has 288 states, 283 states have (on average 1.3215547703180213) internal successors, (374), 283 states have internal predecessors, (374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 448 states. [2022-04-28 10:11:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:51,162 INFO L93 Difference]: Finished difference Result 448 states and 579 transitions. [2022-04-28 10:11:51,162 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 579 transitions. [2022-04-28 10:11:51,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:51,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:51,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:51,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 283 states have (on average 1.3215547703180213) internal successors, (374), 283 states have internal predecessors, (374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:51,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 378 transitions. [2022-04-28 10:11:51,168 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 378 transitions. Word has length 34 [2022-04-28 10:11:51,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:51,169 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 378 transitions. [2022-04-28 10:11:51,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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:51,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 288 states and 378 transitions. [2022-04-28 10:11:52,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 378 edges. 378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 378 transitions. [2022-04-28 10:11:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:11:52,608 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:52,608 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:52,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-04-28 10:11:52,831 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,SelfDestructingSolverStorable48 [2022-04-28 10:11:52,831 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:52,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:52,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2073808990, now seen corresponding path program 35 times [2022-04-28 10:11:52,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:52,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2099471669] [2022-04-28 10:11:52,834 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:52,834 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2073808990, now seen corresponding path program 36 times [2022-04-28 10:11:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:52,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100703277] [2022-04-28 10:11:52,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:52,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:53,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:53,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {67096#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67071#true} is VALID [2022-04-28 10:11:53,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {67071#true} assume true; {67071#true} is VALID [2022-04-28 10:11:53,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67071#true} {67071#true} #83#return; {67071#true} is VALID [2022-04-28 10:11:53,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {67071#true} call ULTIMATE.init(); {67096#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:53,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {67096#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67071#true} is VALID [2022-04-28 10:11:53,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {67071#true} assume true; {67071#true} is VALID [2022-04-28 10:11:53,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67071#true} {67071#true} #83#return; {67071#true} is VALID [2022-04-28 10:11:53,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {67071#true} call #t~ret15 := main(); {67071#true} is VALID [2022-04-28 10:11:53,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {67071#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67076#(= main_~y~0 0)} is VALID [2022-04-28 10:11:53,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {67076#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67077#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:53,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {67077#(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; {67078#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:53,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {67078#(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; {67079#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:53,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {67079#(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; {67080#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:53,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {67080#(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; {67081#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:53,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {67081#(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; {67082#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:53,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {67082#(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; {67083#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:53,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {67083#(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; {67084#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:53,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {67084#(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; {67085#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:53,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {67085#(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; {67086#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:53,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {67086#(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; {67087#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:53,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {67087#(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; {67088#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:53,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {67088#(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; {67089#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:53,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {67089#(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; {67090#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:53,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {67090#(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; {67091#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:53,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {67091#(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; {67092#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:53,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {67092#(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; {67093#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:53,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {67093#(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; {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:53,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:53,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {67095#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID [2022-04-28 10:11:53,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {67095#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-28 10:11:53,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {67072#false} assume !(~y~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-28 10:11:53,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {67072#false} assume !(~x~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-28 10:11:53,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {67072#false} assume !(~z~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-28 10:11:53,211 INFO L272 TraceCheckUtils]: 30: Hoare triple {67072#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67072#false} is VALID [2022-04-28 10:11:53,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {67072#false} ~cond := #in~cond; {67072#false} is VALID [2022-04-28 10:11:53,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {67072#false} assume 0 == ~cond; {67072#false} is VALID [2022-04-28 10:11:53,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {67072#false} assume !false; {67072#false} is VALID [2022-04-28 10:11:53,211 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:53,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:53,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100703277] [2022-04-28 10:11:53,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100703277] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:53,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780122939] [2022-04-28 10:11:53,211 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:53,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:53,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:53,212 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:11:53,217 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:11:53,426 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 10:11:53,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:53,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:11:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:53,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:53,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {67071#true} call ULTIMATE.init(); {67071#true} is VALID [2022-04-28 10:11:53,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {67071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67071#true} is VALID [2022-04-28 10:11:53,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {67071#true} assume true; {67071#true} is VALID [2022-04-28 10:11:53,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67071#true} {67071#true} #83#return; {67071#true} is VALID [2022-04-28 10:11:53,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {67071#true} call #t~ret15 := main(); {67071#true} is VALID [2022-04-28 10:11:53,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {67071#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67076#(= main_~y~0 0)} is VALID [2022-04-28 10:11:53,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {67076#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67077#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:53,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {67077#(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; {67078#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:53,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {67078#(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; {67079#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:53,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {67079#(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; {67080#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:53,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {67080#(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; {67081#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:53,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {67081#(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; {67082#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:53,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {67082#(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; {67083#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:53,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {67083#(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; {67084#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:53,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {67084#(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; {67085#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:53,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {67085#(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; {67086#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:53,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {67086#(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; {67087#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:53,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {67087#(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; {67088#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:53,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {67088#(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; {67089#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:53,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {67089#(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; {67090#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:53,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {67090#(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; {67091#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:53,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {67091#(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; {67092#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:53,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {67092#(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; {67093#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:53,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {67093#(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; {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:53,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:53,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {67094#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {67175#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:11:53,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {67175#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-28 10:11:53,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {67072#false} assume !(~y~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-28 10:11:53,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {67072#false} assume !(~x~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-28 10:11:53,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {67072#false} assume !(~z~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-28 10:11:53,768 INFO L272 TraceCheckUtils]: 30: Hoare triple {67072#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67072#false} is VALID [2022-04-28 10:11:53,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {67072#false} ~cond := #in~cond; {67072#false} is VALID [2022-04-28 10:11:53,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {67072#false} assume 0 == ~cond; {67072#false} is VALID [2022-04-28 10:11:53,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {67072#false} assume !false; {67072#false} is VALID [2022-04-28 10:11:53,768 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:53,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:54,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {67072#false} assume !false; {67072#false} is VALID [2022-04-28 10:11:54,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {67072#false} assume 0 == ~cond; {67072#false} is VALID [2022-04-28 10:11:54,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {67072#false} ~cond := #in~cond; {67072#false} is VALID [2022-04-28 10:11:54,451 INFO L272 TraceCheckUtils]: 30: Hoare triple {67072#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67072#false} is VALID [2022-04-28 10:11:54,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {67072#false} assume !(~z~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-28 10:11:54,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {67072#false} assume !(~x~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-28 10:11:54,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {67072#false} assume !(~y~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-28 10:11:54,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {67221#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {67072#false} is VALID [2022-04-28 10:11:54,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {67225#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {67221#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:54,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {67225#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {67225#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:54,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {67232#(< 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; {67225#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:54,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {67236#(< 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; {67232#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:54,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {67240#(< 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; {67236#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:54,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {67244#(< 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; {67240#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:54,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {67248#(< 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; {67244#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:54,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {67252#(< 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; {67248#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:54,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {67256#(< 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; {67252#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:54,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {67260#(< 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; {67256#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:54,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {67264#(< 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; {67260#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:54,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {67268#(< 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; {67264#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:54,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {67272#(< 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; {67268#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:54,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {67276#(< 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; {67272#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:11:54,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {67280#(< 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; {67276#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:11:54,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {67284#(< 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; {67280#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:11:54,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {67288#(< 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; {67284#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:11:54,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {67292#(< 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; {67288#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:11:54,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {67296#(< 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; {67292#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:11:54,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {67300#(< 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; {67296#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:11:54,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {67071#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67300#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:11:54,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {67071#true} call #t~ret15 := main(); {67071#true} is VALID [2022-04-28 10:11:54,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67071#true} {67071#true} #83#return; {67071#true} is VALID [2022-04-28 10:11:54,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {67071#true} assume true; {67071#true} is VALID [2022-04-28 10:11:54,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {67071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67071#true} is VALID [2022-04-28 10:11:54,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {67071#true} call ULTIMATE.init(); {67071#true} is VALID [2022-04-28 10:11:54,463 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:54,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780122939] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:54,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:54,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:11:54,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:54,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2099471669] [2022-04-28 10:11:54,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2099471669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:54,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:54,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:11:54,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523020050] [2022-04-28 10:11:54,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:54,464 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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:54,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:54,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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:54,483 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:54,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:11:54,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:54,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:11:54,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:11:54,484 INFO L87 Difference]: Start difference. First operand 288 states and 378 transitions. Second operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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:12:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:07,414 INFO L93 Difference]: Finished difference Result 679 states and 971 transitions. [2022-04-28 10:12:07,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:12:07,414 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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:12:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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:12:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 245 transitions. [2022-04-28 10:12:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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:12:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 245 transitions. [2022-04-28 10:12:07,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 245 transitions. [2022-04-28 10:12:07,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:07,626 INFO L225 Difference]: With dead ends: 679 [2022-04-28 10:12:07,626 INFO L226 Difference]: Without dead ends: 647 [2022-04-28 10:12:07,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=910, Invalid=3122, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:12:07,627 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 211 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 3842 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 3948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:07,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 231 Invalid, 3948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3842 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 10:12:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-04-28 10:12:08,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 301. [2022-04-28 10:12:08,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:08,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 647 states. Second operand has 301 states, 296 states have (on average 1.3277027027027026) internal successors, (393), 296 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call 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:08,885 INFO L74 IsIncluded]: Start isIncluded. First operand 647 states. Second operand has 301 states, 296 states have (on average 1.3277027027027026) internal successors, (393), 296 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call 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:08,885 INFO L87 Difference]: Start difference. First operand 647 states. Second operand has 301 states, 296 states have (on average 1.3277027027027026) internal successors, (393), 296 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call 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:08,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:08,901 INFO L93 Difference]: Finished difference Result 647 states and 834 transitions. [2022-04-28 10:12:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 834 transitions. [2022-04-28 10:12:08,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:08,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:08,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 301 states, 296 states have (on average 1.3277027027027026) internal successors, (393), 296 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 647 states. [2022-04-28 10:12:08,902 INFO L87 Difference]: Start difference. First operand has 301 states, 296 states have (on average 1.3277027027027026) internal successors, (393), 296 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 647 states. [2022-04-28 10:12:08,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:08,916 INFO L93 Difference]: Finished difference Result 647 states and 834 transitions. [2022-04-28 10:12:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 834 transitions. [2022-04-28 10:12:08,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:08,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:08,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:08,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 296 states have (on average 1.3277027027027026) internal successors, (393), 296 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call 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:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 397 transitions. [2022-04-28 10:12:08,923 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 397 transitions. Word has length 34 [2022-04-28 10:12:08,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:08,923 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 397 transitions. [2022-04-28 10:12:08,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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:12:08,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 301 states and 397 transitions. [2022-04-28 10:12:10,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 397 transitions. [2022-04-28 10:12:10,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:12:10,205 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:10,205 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:10,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:10,405 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,SelfDestructingSolverStorable49 [2022-04-28 10:12:10,405 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:10,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash 991978272, now seen corresponding path program 19 times [2022-04-28 10:12:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:10,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [716614771] [2022-04-28 10:12:10,408 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:10,408 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:10,408 INFO L85 PathProgramCache]: Analyzing trace with hash 991978272, now seen corresponding path program 20 times [2022-04-28 10:12:10,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:10,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923050155] [2022-04-28 10:12:10,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:10,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:10,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:10,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {70634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70615#true} is VALID [2022-04-28 10:12:10,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {70615#true} assume true; {70615#true} is VALID [2022-04-28 10:12:10,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70615#true} {70615#true} #83#return; {70615#true} is VALID [2022-04-28 10:12:10,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {70615#true} call ULTIMATE.init(); {70634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:10,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {70634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70615#true} is VALID [2022-04-28 10:12:10,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {70615#true} assume true; {70615#true} is VALID [2022-04-28 10:12:10,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70615#true} {70615#true} #83#return; {70615#true} is VALID [2022-04-28 10:12:10,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {70615#true} call #t~ret15 := main(); {70615#true} is VALID [2022-04-28 10:12:10,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {70615#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70620#(= main_~y~0 0)} is VALID [2022-04-28 10:12:10,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {70620#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70621#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:10,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {70621#(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; {70622#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:10,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {70622#(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; {70623#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:10,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {70623#(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; {70624#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:10,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {70624#(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; {70625#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:10,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {70625#(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; {70626#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:10,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {70626#(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; {70627#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:10,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {70627#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {70627#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:10,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {70627#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {70628#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:10,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {70628#(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; {70629#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:10,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {70629#(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; {70630#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:10,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {70630#(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; {70631#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:12:10,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {70631#(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; {70632#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:12:10,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {70632#(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; {70633#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:12:10,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {70633#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-28 10:12:10,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {70616#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70616#false} is VALID [2022-04-28 10:12:10,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {70616#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70616#false} is VALID [2022-04-28 10:12:10,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {70616#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70616#false} is VALID [2022-04-28 10:12:10,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {70616#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70616#false} is VALID [2022-04-28 10:12:10,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {70616#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70616#false} is VALID [2022-04-28 10:12:10,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {70616#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70616#false} is VALID [2022-04-28 10:12:10,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {70616#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70616#false} is VALID [2022-04-28 10:12:10,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {70616#false} assume !(~y~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-28 10:12:10,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {70616#false} assume !(~x~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-28 10:12:10,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {70616#false} assume !(~z~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-28 10:12:10,616 INFO L272 TraceCheckUtils]: 31: Hoare triple {70616#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70616#false} is VALID [2022-04-28 10:12:10,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {70616#false} ~cond := #in~cond; {70616#false} is VALID [2022-04-28 10:12:10,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {70616#false} assume 0 == ~cond; {70616#false} is VALID [2022-04-28 10:12:10,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {70616#false} assume !false; {70616#false} is VALID [2022-04-28 10:12:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:12:10,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:10,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923050155] [2022-04-28 10:12:10,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923050155] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:10,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201127363] [2022-04-28 10:12:10,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:10,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:10,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:10,618 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:12:10,620 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:12:10,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:10,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:10,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 10:12:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:10,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:10,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {70615#true} call ULTIMATE.init(); {70615#true} is VALID [2022-04-28 10:12:10,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {70615#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70615#true} is VALID [2022-04-28 10:12:10,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {70615#true} assume true; {70615#true} is VALID [2022-04-28 10:12:10,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70615#true} {70615#true} #83#return; {70615#true} is VALID [2022-04-28 10:12:10,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {70615#true} call #t~ret15 := main(); {70615#true} is VALID [2022-04-28 10:12:10,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {70615#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70615#true} is VALID [2022-04-28 10:12:10,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {70615#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70615#true} is VALID [2022-04-28 10:12:10,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {70615#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70615#true} is VALID [2022-04-28 10:12:10,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {70615#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:10,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70666#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:10,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {70666#(< 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; {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:10,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:10,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:10,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:10,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:10,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:10,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:10,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70666#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:10,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {70666#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:10,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:10,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:10,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:10,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:10,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:10,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:10,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:10,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:10,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:10,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:10,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-28 10:12:10,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {70616#false} assume !(~z~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-28 10:12:10,891 INFO L272 TraceCheckUtils]: 31: Hoare triple {70616#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70616#false} is VALID [2022-04-28 10:12:10,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {70616#false} ~cond := #in~cond; {70616#false} is VALID [2022-04-28 10:12:10,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {70616#false} assume 0 == ~cond; {70616#false} is VALID [2022-04-28 10:12:10,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {70616#false} assume !false; {70616#false} is VALID [2022-04-28 10:12:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 10:12:10,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:11,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {70616#false} assume !false; {70616#false} is VALID [2022-04-28 10:12:11,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {70616#false} assume 0 == ~cond; {70616#false} is VALID [2022-04-28 10:12:11,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {70616#false} ~cond := #in~cond; {70616#false} is VALID [2022-04-28 10:12:11,013 INFO L272 TraceCheckUtils]: 31: Hoare triple {70616#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70616#false} is VALID [2022-04-28 10:12:11,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {70616#false} assume !(~z~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-28 10:12:11,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {70616#false} is VALID [2022-04-28 10:12:11,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:11,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:11,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:11,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:11,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:11,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:11,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:11,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:11,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {70700#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:11,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70700#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:11,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {70666#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:11,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70666#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:11,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:11,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:11,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:11,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:11,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70678#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:11,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70674#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:11,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {70666#(< 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; {70670#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:11,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70666#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:11,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {70615#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70662#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:11,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {70615#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70615#true} is VALID [2022-04-28 10:12:11,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {70615#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70615#true} is VALID [2022-04-28 10:12:11,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {70615#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70615#true} is VALID [2022-04-28 10:12:11,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {70615#true} call #t~ret15 := main(); {70615#true} is VALID [2022-04-28 10:12:11,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70615#true} {70615#true} #83#return; {70615#true} is VALID [2022-04-28 10:12:11,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {70615#true} assume true; {70615#true} is VALID [2022-04-28 10:12:11,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {70615#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70615#true} is VALID [2022-04-28 10:12:11,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {70615#true} call ULTIMATE.init(); {70615#true} is VALID [2022-04-28 10:12:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 10:12:11,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201127363] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:11,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:11,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 8] total 23 [2022-04-28 10:12:11,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:11,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [716614771] [2022-04-28 10:12:11,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [716614771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:11,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:11,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:12:11,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440836352] [2022-04-28 10:12:11,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:11,025 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 35 [2022-04-28 10:12:11,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:11,025 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:12:11,042 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:12:11,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:12:11,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:11,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:12:11,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:12:11,043 INFO L87 Difference]: Start difference. First operand 301 states and 397 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:12:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:16,912 INFO L93 Difference]: Finished difference Result 449 states and 583 transitions. [2022-04-28 10:12:16,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:12:16,912 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 35 [2022-04-28 10:12:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:16,913 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:12:16,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-28 10:12:16,913 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:12:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-28 10:12:16,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 124 transitions. [2022-04-28 10:12:17,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:17,037 INFO L225 Difference]: With dead ends: 449 [2022-04-28 10:12:17,037 INFO L226 Difference]: Without dead ends: 410 [2022-04-28 10:12:17,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=2136, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:12:17,038 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 83 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:17,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 123 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:12:17,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-04-28 10:12:18,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 302. [2022-04-28 10:12:18,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:18,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states. Second operand has 302 states, 297 states have (on average 1.3198653198653199) internal successors, (392), 297 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call 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,235 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states. Second operand has 302 states, 297 states have (on average 1.3198653198653199) internal successors, (392), 297 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call 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,235 INFO L87 Difference]: Start difference. First operand 410 states. Second operand has 302 states, 297 states have (on average 1.3198653198653199) internal successors, (392), 297 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call 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,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:18,242 INFO L93 Difference]: Finished difference Result 410 states and 540 transitions. [2022-04-28 10:12:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 540 transitions. [2022-04-28 10:12:18,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:18,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:18,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 302 states, 297 states have (on average 1.3198653198653199) internal successors, (392), 297 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 410 states. [2022-04-28 10:12:18,242 INFO L87 Difference]: Start difference. First operand has 302 states, 297 states have (on average 1.3198653198653199) internal successors, (392), 297 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 410 states. [2022-04-28 10:12:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:18,248 INFO L93 Difference]: Finished difference Result 410 states and 540 transitions. [2022-04-28 10:12:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 540 transitions. [2022-04-28 10:12:18,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:18,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:18,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:18,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 297 states have (on average 1.3198653198653199) internal successors, (392), 297 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call 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,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 396 transitions. [2022-04-28 10:12:18,253 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 396 transitions. Word has length 35 [2022-04-28 10:12:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:18,253 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 396 transitions. [2022-04-28 10:12:18,253 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:12:18,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 302 states and 396 transitions. [2022-04-28 10:12:19,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 396 transitions. [2022-04-28 10:12:19,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:12:19,988 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:19,988 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:20,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:20,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:20,188 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:20,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:20,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1717478545, now seen corresponding path program 37 times [2022-04-28 10:12:20,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:20,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [874734615] [2022-04-28 10:12:20,191 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:20,191 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:20,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1717478545, now seen corresponding path program 38 times [2022-04-28 10:12:20,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:20,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249343409] [2022-04-28 10:12:20,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:20,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:20,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:20,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {73250#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73224#true} is VALID [2022-04-28 10:12:20,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {73224#true} assume true; {73224#true} is VALID [2022-04-28 10:12:20,573 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73224#true} {73224#true} #83#return; {73224#true} is VALID [2022-04-28 10:12:20,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {73224#true} call ULTIMATE.init(); {73250#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:20,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {73250#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73224#true} is VALID [2022-04-28 10:12:20,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {73224#true} assume true; {73224#true} is VALID [2022-04-28 10:12:20,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73224#true} {73224#true} #83#return; {73224#true} is VALID [2022-04-28 10:12:20,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {73224#true} call #t~ret15 := main(); {73224#true} is VALID [2022-04-28 10:12:20,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {73224#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73229#(= main_~y~0 0)} is VALID [2022-04-28 10:12:20,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {73229#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73230#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:20,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {73230#(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; {73231#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:20,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {73231#(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; {73232#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:20,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {73232#(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; {73233#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:20,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {73233#(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; {73234#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:20,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {73234#(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; {73235#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:20,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {73235#(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; {73236#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:20,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {73236#(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; {73237#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:20,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {73237#(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; {73238#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:20,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {73238#(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; {73239#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:20,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {73239#(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; {73240#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:20,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {73240#(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; {73241#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:20,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {73241#(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; {73242#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:20,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {73242#(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; {73243#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:20,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {73243#(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; {73244#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:20,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {73244#(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; {73245#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:20,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {73245#(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; {73246#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:20,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {73246#(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; {73247#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:20,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {73247#(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; {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:20,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:20,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {73249#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:20,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {73249#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-28 10:12:20,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {73225#false} assume !(~y~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-28 10:12:20,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {73225#false} assume !(~x~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-28 10:12:20,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {73225#false} assume !(~z~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-28 10:12:20,586 INFO L272 TraceCheckUtils]: 31: Hoare triple {73225#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73225#false} is VALID [2022-04-28 10:12:20,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {73225#false} ~cond := #in~cond; {73225#false} is VALID [2022-04-28 10:12:20,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {73225#false} assume 0 == ~cond; {73225#false} is VALID [2022-04-28 10:12:20,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {73225#false} assume !false; {73225#false} is VALID [2022-04-28 10:12:20,586 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:12:20,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:20,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249343409] [2022-04-28 10:12:20,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249343409] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:20,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83232606] [2022-04-28 10:12:20,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:20,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:20,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:20,587 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:12:20,588 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:12:20,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:20,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:20,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:12:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:20,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:20,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {73224#true} call ULTIMATE.init(); {73224#true} is VALID [2022-04-28 10:12:20,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {73224#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73224#true} is VALID [2022-04-28 10:12:20,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {73224#true} assume true; {73224#true} is VALID [2022-04-28 10:12:20,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73224#true} {73224#true} #83#return; {73224#true} is VALID [2022-04-28 10:12:20,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {73224#true} call #t~ret15 := main(); {73224#true} is VALID [2022-04-28 10:12:20,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {73224#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73229#(= main_~y~0 0)} is VALID [2022-04-28 10:12:20,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {73229#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73230#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:20,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {73230#(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; {73231#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:20,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {73231#(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; {73232#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:20,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {73232#(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; {73233#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:20,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {73233#(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; {73234#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:20,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {73234#(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; {73235#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:20,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {73235#(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; {73236#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:20,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {73236#(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; {73237#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:20,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {73237#(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; {73238#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:20,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {73238#(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; {73239#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:20,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {73239#(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; {73240#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:20,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {73240#(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; {73241#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:20,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {73241#(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; {73242#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:20,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {73242#(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; {73243#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:20,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {73243#(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; {73244#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:20,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {73244#(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; {73245#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:20,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {73245#(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; {73246#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:20,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {73246#(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; {73247#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:20,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {73247#(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; {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:20,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:20,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {73248#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {73332#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-28 10:12:20,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {73332#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !(~z~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-28 10:12:20,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {73225#false} assume !(~y~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-28 10:12:20,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {73225#false} assume !(~x~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-28 10:12:20,968 INFO L290 TraceCheckUtils]: 30: Hoare triple {73225#false} assume !(~z~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-28 10:12:20,968 INFO L272 TraceCheckUtils]: 31: Hoare triple {73225#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73225#false} is VALID [2022-04-28 10:12:20,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {73225#false} ~cond := #in~cond; {73225#false} is VALID [2022-04-28 10:12:20,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {73225#false} assume 0 == ~cond; {73225#false} is VALID [2022-04-28 10:12:20,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {73225#false} assume !false; {73225#false} is VALID [2022-04-28 10:12:20,968 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:12:20,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:21,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {73225#false} assume !false; {73225#false} is VALID [2022-04-28 10:12:21,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {73225#false} assume 0 == ~cond; {73225#false} is VALID [2022-04-28 10:12:21,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {73225#false} ~cond := #in~cond; {73225#false} is VALID [2022-04-28 10:12:21,675 INFO L272 TraceCheckUtils]: 31: Hoare triple {73225#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73225#false} is VALID [2022-04-28 10:12:21,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {73225#false} assume !(~z~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-28 10:12:21,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {73225#false} assume !(~x~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-28 10:12:21,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {73225#false} assume !(~y~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-28 10:12:21,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {73378#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {73225#false} is VALID [2022-04-28 10:12:21,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {73382#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {73378#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:21,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {73382#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {73382#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:21,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {73389#(< 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; {73382#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:21,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {73393#(< 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; {73389#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:21,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {73397#(< 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; {73393#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:21,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {73401#(< 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; {73397#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:21,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {73405#(< 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; {73401#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:21,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {73409#(< 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; {73405#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:21,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {73413#(< 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; {73409#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:21,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {73417#(< 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; {73413#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:21,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {73421#(< 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; {73417#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:21,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {73425#(< 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; {73421#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:21,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {73429#(< 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; {73425#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:21,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {73433#(< 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; {73429#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:21,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {73437#(< 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; {73433#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:12:21,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {73441#(< 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; {73437#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:12:21,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {73445#(< 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; {73441#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:12:21,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {73449#(< 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; {73445#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:12:21,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {73453#(< 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; {73449#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:12:21,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {73457#(< 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; {73453#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:12:21,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {73461#(< 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; {73457#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:12:21,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {73224#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73461#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:21,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {73224#true} call #t~ret15 := main(); {73224#true} is VALID [2022-04-28 10:12:21,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73224#true} {73224#true} #83#return; {73224#true} is VALID [2022-04-28 10:12:21,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {73224#true} assume true; {73224#true} is VALID [2022-04-28 10:12:21,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {73224#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73224#true} is VALID [2022-04-28 10:12:21,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {73224#true} call ULTIMATE.init(); {73224#true} is VALID [2022-04-28 10:12:21,691 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:12:21,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83232606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:21,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:21,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:12:21,691 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:21,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [874734615] [2022-04-28 10:12:21,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [874734615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:21,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:21,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:12:21,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601474530] [2022-04-28 10:12:21,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:21,692 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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:21,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:21,692 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), 23 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:21,713 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:21,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:12:21,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:21,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:12:21,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1579, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:12:21,714 INFO L87 Difference]: Start difference. First operand 302 states and 396 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:36,051 INFO L93 Difference]: Finished difference Result 711 states and 1017 transitions. [2022-04-28 10:12:36,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:12:36,051 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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:36,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 257 transitions. [2022-04-28 10:12:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 257 transitions. [2022-04-28 10:12:36,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 257 transitions. [2022-04-28 10:12:36,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:36,265 INFO L225 Difference]: With dead ends: 711 [2022-04-28 10:12:36,266 INFO L226 Difference]: Without dead ends: 679 [2022-04-28 10:12:36,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=997, Invalid=3425, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:12:36,266 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 227 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4263 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 4378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 4263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:36,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 243 Invalid, 4378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 4263 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 10:12:36,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-04-28 10:12:37,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 315. [2022-04-28 10:12:37,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:37,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 679 states. Second operand has 315 states, 310 states have (on average 1.3258064516129033) internal successors, (411), 310 states have internal predecessors, (411), 3 states have call successors, (3), 3 states have call 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,510 INFO L74 IsIncluded]: Start isIncluded. First operand 679 states. Second operand has 315 states, 310 states have (on average 1.3258064516129033) internal successors, (411), 310 states have internal predecessors, (411), 3 states have call successors, (3), 3 states have call 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,511 INFO L87 Difference]: Start difference. First operand 679 states. Second operand has 315 states, 310 states have (on average 1.3258064516129033) internal successors, (411), 310 states have internal predecessors, (411), 3 states have call successors, (3), 3 states have call 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,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:37,524 INFO L93 Difference]: Finished difference Result 679 states and 875 transitions. [2022-04-28 10:12:37,524 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 875 transitions. [2022-04-28 10:12:37,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:37,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:37,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 315 states, 310 states have (on average 1.3258064516129033) internal successors, (411), 310 states have internal predecessors, (411), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 679 states. [2022-04-28 10:12:37,525 INFO L87 Difference]: Start difference. First operand has 315 states, 310 states have (on average 1.3258064516129033) internal successors, (411), 310 states have internal predecessors, (411), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 679 states. [2022-04-28 10:12:37,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:37,539 INFO L93 Difference]: Finished difference Result 679 states and 875 transitions. [2022-04-28 10:12:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 875 transitions. [2022-04-28 10:12:37,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:37,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:37,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:37,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.3258064516129033) internal successors, (411), 310 states have internal predecessors, (411), 3 states have call successors, (3), 3 states have call 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,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 415 transitions. [2022-04-28 10:12:37,544 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 415 transitions. Word has length 35 [2022-04-28 10:12:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:37,544 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 415 transitions. [2022-04-28 10:12:37,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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:37,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 315 states and 415 transitions. [2022-04-28 10:12:39,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 415 transitions. [2022-04-28 10:12:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:12:39,083 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:39,083 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:39,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:39,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:39,283 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:39,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 9 times [2022-04-28 10:12:39,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:39,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1900910605] [2022-04-28 10:12:39,287 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:39,287 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:39,287 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 10 times [2022-04-28 10:12:39,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:39,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858800249] [2022-04-28 10:12:39,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:39,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:39,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:39,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {76952#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76934#true} is VALID [2022-04-28 10:12:39,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {76934#true} assume true; {76934#true} is VALID [2022-04-28 10:12:39,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76934#true} {76934#true} #83#return; {76934#true} is VALID [2022-04-28 10:12:39,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {76934#true} call ULTIMATE.init(); {76952#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:39,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {76952#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76934#true} is VALID [2022-04-28 10:12:39,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {76934#true} assume true; {76934#true} is VALID [2022-04-28 10:12:39,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76934#true} {76934#true} #83#return; {76934#true} is VALID [2022-04-28 10:12:39,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {76934#true} call #t~ret15 := main(); {76934#true} is VALID [2022-04-28 10:12:39,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {76934#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:12:39,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76940#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-28 10:12:39,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {76940#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76941#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} is VALID [2022-04-28 10:12:39,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {76941#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76942#(and (< (div main_~n~0 4294967296) (+ (div main_~x~0 4294967296) 1)) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:12:39,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {76942#(and (< (div main_~n~0 4294967296) (+ (div main_~x~0 4294967296) 1)) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:12:39,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-28 10:12:39,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} ~z~0 := ~y~0; {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-28 10:12:39,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76945#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:12:39,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {76945#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76946#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:12:39,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {76946#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76947#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-28 10:12:39,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {76947#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 10:12:39,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 10:12:39,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 10:12:39,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 10:12:39,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 10:12:39,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 10:12:39,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !(~y~0 % 4294967296 > 0); {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 10:12:39,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {76948#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76947#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-28 10:12:39,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {76947#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76946#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:12:39,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {76946#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76945#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:12:39,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {76945#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-28 10:12:39,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-28 10:12:39,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {76944#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76945#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:12:39,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {76945#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76946#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:12:39,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {76946#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76947#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-28 10:12:39,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {76947#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:12:39,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:12:39,816 INFO L272 TraceCheckUtils]: 32: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {76950#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:12:39,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {76950#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {76951#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:12:39,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {76951#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {76935#false} is VALID [2022-04-28 10:12:39,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {76935#false} assume !false; {76935#false} is VALID [2022-04-28 10:12:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:12:39,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:39,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858800249] [2022-04-28 10:12:39,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858800249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:39,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556737915] [2022-04-28 10:12:39,818 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:39,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:39,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:39,819 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:12:39,819 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:12:39,864 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:39,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:39,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:12:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:39,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:40,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {76934#true} call ULTIMATE.init(); {76934#true} is VALID [2022-04-28 10:12:40,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {76934#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76934#true} is VALID [2022-04-28 10:12:40,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {76934#true} assume true; {76934#true} is VALID [2022-04-28 10:12:40,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76934#true} {76934#true} #83#return; {76934#true} is VALID [2022-04-28 10:12:40,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {76934#true} call #t~ret15 := main(); {76934#true} is VALID [2022-04-28 10:12:40,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {76934#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:12:40,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-28 10:12:40,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76978#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-28 10:12:40,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {76978#(= (+ 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; {76982#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-28 10:12:40,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {76982#(= (+ (- 1) 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; {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:12:40,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:12:40,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} ~z~0 := ~y~0; {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:12:40,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76982#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-28 10:12:40,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {76982#(= (+ (- 1) 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; {76978#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-28 10:12:40,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {76978#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-28 10:12:40,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:12:40,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:12:40,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:12:40,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:12:40,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:12:40,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:12:40,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:12:40,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-28 10:12:40,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76978#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-28 10:12:40,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {76978#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76982#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-28 10:12:40,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {76982#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:12:40,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:12:40,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {76943#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76982#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-28 10:12:40,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {76982#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76978#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-28 10:12:40,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {76978#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-28 10:12:40,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {76974#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:12:40,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:12:40,183 INFO L272 TraceCheckUtils]: 32: Hoare triple {76939#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77055#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:12:40,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {77055#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {77059#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:12:40,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {77059#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {76935#false} is VALID [2022-04-28 10:12:40,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {76935#false} assume !false; {76935#false} is VALID [2022-04-28 10:12:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:12:40,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:40,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {76935#false} assume !false; {76935#false} is VALID [2022-04-28 10:12:40,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {77059#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {76935#false} is VALID [2022-04-28 10:12:40,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {77055#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {77059#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:12:40,605 INFO L272 TraceCheckUtils]: 32: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77055#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:12:40,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:12:40,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:12:40,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:12:40,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:12:40,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-28 10:12:40,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:12:40,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:12:40,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-28 10:12:40,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:12:40,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:12:40,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:12:40,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:12:40,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:12:40,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:12:40,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:12:40,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:12:40,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:12:40,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:12:40,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:12:40,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-28 10:12:40,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:12:40,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:12:40,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77093#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:12:40,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77089#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-28 10:12:40,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77085#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:12:40,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77081#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:12:40,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {76934#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76949#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:12:40,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {76934#true} call #t~ret15 := main(); {76934#true} is VALID [2022-04-28 10:12:40,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76934#true} {76934#true} #83#return; {76934#true} is VALID [2022-04-28 10:12:40,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {76934#true} assume true; {76934#true} is VALID [2022-04-28 10:12:40,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {76934#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76934#true} is VALID [2022-04-28 10:12:40,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {76934#true} call ULTIMATE.init(); {76934#true} is VALID [2022-04-28 10:12:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:12:40,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556737915] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:40,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:40,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 25 [2022-04-28 10:12:40,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:40,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1900910605] [2022-04-28 10:12:40,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1900910605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:40,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:40,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:12:40,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161200895] [2022-04-28 10:12:40,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:40,625 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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 36 [2022-04-28 10:12:40,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:40,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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:12:40,668 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:12:40,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:12:40,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:40,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:12:40,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:12:40,669 INFO L87 Difference]: Start difference. First operand 315 states and 415 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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:12:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:43,236 INFO L93 Difference]: Finished difference Result 326 states and 426 transitions. [2022-04-28 10:12:43,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:12:43,236 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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 36 [2022-04-28 10:12:43,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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:12:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2022-04-28 10:12:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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:12:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2022-04-28 10:12:43,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 50 transitions. [2022-04-28 10:12:43,302 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:12:43,306 INFO L225 Difference]: With dead ends: 326 [2022-04-28 10:12:43,307 INFO L226 Difference]: Without dead ends: 316 [2022-04-28 10:12:43,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 14 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=1117, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:12:43,307 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:43,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 73 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:12:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-04-28 10:12:44,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2022-04-28 10:12:44,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:44,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 316 states, 311 states have (on average 1.32475884244373) internal successors, (412), 311 states have internal predecessors, (412), 3 states have call successors, (3), 3 states have call 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,613 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 316 states, 311 states have (on average 1.32475884244373) internal successors, (412), 311 states have internal predecessors, (412), 3 states have call successors, (3), 3 states have call 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,614 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 316 states, 311 states have (on average 1.32475884244373) internal successors, (412), 311 states have internal predecessors, (412), 3 states have call successors, (3), 3 states have call 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,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:44,617 INFO L93 Difference]: Finished difference Result 316 states and 416 transitions. [2022-04-28 10:12:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 416 transitions. [2022-04-28 10:12:44,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:44,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:44,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 316 states, 311 states have (on average 1.32475884244373) internal successors, (412), 311 states have internal predecessors, (412), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 316 states. [2022-04-28 10:12:44,618 INFO L87 Difference]: Start difference. First operand has 316 states, 311 states have (on average 1.32475884244373) internal successors, (412), 311 states have internal predecessors, (412), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 316 states. [2022-04-28 10:12:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:44,622 INFO L93 Difference]: Finished difference Result 316 states and 416 transitions. [2022-04-28 10:12:44,622 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 416 transitions. [2022-04-28 10:12:44,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:44,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:44,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:44,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 311 states have (on average 1.32475884244373) internal successors, (412), 311 states have internal predecessors, (412), 3 states have call successors, (3), 3 states have call 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,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 416 transitions. [2022-04-28 10:12:44,628 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 416 transitions. Word has length 36 [2022-04-28 10:12:44,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:44,628 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 416 transitions. [2022-04-28 10:12:44,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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:12:44,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 316 states and 416 transitions. [2022-04-28 10:12:45,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 416 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 416 transitions. [2022-04-28 10:12:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:12:45,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:45,978 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:45,994 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:12:46,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:46,178 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:46,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash -562951837, now seen corresponding path program 9 times [2022-04-28 10:12:46,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:46,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1880745539] [2022-04-28 10:12:46,181 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:46,181 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:46,181 INFO L85 PathProgramCache]: Analyzing trace with hash -562951837, now seen corresponding path program 10 times [2022-04-28 10:12:46,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:46,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674099323] [2022-04-28 10:12:46,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:46,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:46,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {79130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {79115#true} is VALID [2022-04-28 10:12:46,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {79115#true} assume true; {79115#true} is VALID [2022-04-28 10:12:46,342 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79115#true} {79115#true} #83#return; {79115#true} is VALID [2022-04-28 10:12:46,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {79115#true} call ULTIMATE.init(); {79130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:46,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {79130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {79115#true} is VALID [2022-04-28 10:12:46,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {79115#true} assume true; {79115#true} is VALID [2022-04-28 10:12:46,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79115#true} {79115#true} #83#return; {79115#true} is VALID [2022-04-28 10:12:46,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {79115#true} call #t~ret15 := main(); {79115#true} is VALID [2022-04-28 10:12:46,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {79115#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79115#true} is VALID [2022-04-28 10:12:46,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {79115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79120#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:46,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {79120#(<= 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; {79121#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:12:46,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {79121#(<= 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; {79122#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:46,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {79122#(<= 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; {79123#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:46,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {79123#(<= 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; {79124#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:12:46,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {79124#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {79124#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:12:46,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {79124#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {79124#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:12:46,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {79124#(<= (* (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; {79125#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:12:46,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {79125#(<= (+ (* (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; {79126#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} is VALID [2022-04-28 10:12:46,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {79126#(<= (+ (* 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; {79127#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:12:46,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {79127#(<= (+ 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; {79128#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:12:46,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {79128#(<= (+ (* (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; {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:46,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:46,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {79129#(<= (+ 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; {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:46,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {79129#(<= (+ 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; {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:46,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {79129#(<= (+ 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; {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:46,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {79129#(<= (+ 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; {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:46,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {79129#(<= (+ 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; {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:46,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:12:46,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {79129#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {79116#false} is VALID [2022-04-28 10:12:46,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-28 10:12:46,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-28 10:12:46,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-28 10:12:46,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-28 10:12:46,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-28 10:12:46,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {79116#false} assume !(~z~0 % 4294967296 > 0); {79116#false} is VALID [2022-04-28 10:12:46,354 INFO L272 TraceCheckUtils]: 32: Hoare triple {79116#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {79116#false} is VALID [2022-04-28 10:12:46,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {79116#false} ~cond := #in~cond; {79116#false} is VALID [2022-04-28 10:12:46,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {79116#false} assume 0 == ~cond; {79116#false} is VALID [2022-04-28 10:12:46,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {79116#false} assume !false; {79116#false} is VALID [2022-04-28 10:12:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:12:46,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:46,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674099323] [2022-04-28 10:12:46,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674099323] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:46,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591647712] [2022-04-28 10:12:46,355 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:46,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:46,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:46,356 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:12:46,357 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:12:46,396 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:46,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:46,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:12:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:46,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:46,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {79115#true} call ULTIMATE.init(); {79115#true} is VALID [2022-04-28 10:12:46,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {79115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {79115#true} is VALID [2022-04-28 10:12:46,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {79115#true} assume true; {79115#true} is VALID [2022-04-28 10:12:46,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79115#true} {79115#true} #83#return; {79115#true} is VALID [2022-04-28 10:12:46,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {79115#true} call #t~ret15 := main(); {79115#true} is VALID [2022-04-28 10:12:46,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {79115#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79115#true} is VALID [2022-04-28 10:12:46,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {79115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79120#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:46,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {79120#(<= 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; {79155#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:12:46,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {79155#(<= 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; {79159#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {79159#(<= 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; {79163#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:12:46,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {79163#(<= 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; {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {79167#(<= 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; {79163#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:12:46,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {79163#(<= 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; {79159#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {79159#(<= 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; {79155#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:12:46,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {79155#(<= 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; {79120#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:46,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {79120#(<= 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; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {79189#(<= 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; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {79189#(<= 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; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {79189#(<= 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; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {79189#(<= 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; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {79189#(<= 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; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {79116#false} is VALID [2022-04-28 10:12:46,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-28 10:12:46,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-28 10:12:46,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-28 10:12:46,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-28 10:12:46,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-28 10:12:46,712 INFO L290 TraceCheckUtils]: 31: Hoare triple {79116#false} assume !(~z~0 % 4294967296 > 0); {79116#false} is VALID [2022-04-28 10:12:46,712 INFO L272 TraceCheckUtils]: 32: Hoare triple {79116#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {79116#false} is VALID [2022-04-28 10:12:46,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {79116#false} ~cond := #in~cond; {79116#false} is VALID [2022-04-28 10:12:46,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {79116#false} assume 0 == ~cond; {79116#false} is VALID [2022-04-28 10:12:46,712 INFO L290 TraceCheckUtils]: 35: Hoare triple {79116#false} assume !false; {79116#false} is VALID [2022-04-28 10:12:46,712 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:12:46,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:46,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {79116#false} assume !false; {79116#false} is VALID [2022-04-28 10:12:46,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {79116#false} assume 0 == ~cond; {79116#false} is VALID [2022-04-28 10:12:46,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {79116#false} ~cond := #in~cond; {79116#false} is VALID [2022-04-28 10:12:46,847 INFO L272 TraceCheckUtils]: 32: Hoare triple {79116#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {79116#false} is VALID [2022-04-28 10:12:46,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {79116#false} assume !(~z~0 % 4294967296 > 0); {79116#false} is VALID [2022-04-28 10:12:46,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-28 10:12:46,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-28 10:12:46,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-28 10:12:46,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-28 10:12:46,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {79116#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {79116#false} is VALID [2022-04-28 10:12:46,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {79116#false} is VALID [2022-04-28 10:12:46,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {79189#(<= 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; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {79189#(<= 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; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {79189#(<= 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; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {79189#(<= 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; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {79189#(<= 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; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {79120#(<= 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; {79189#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {79155#(<= 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; {79120#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:46,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {79159#(<= 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; {79155#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:12:46,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {79163#(<= 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; {79159#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {79167#(<= 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; {79163#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:12:46,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {79163#(<= 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; {79167#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {79159#(<= 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; {79163#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:12:46,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {79155#(<= 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; {79159#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:12:46,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {79120#(<= 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; {79155#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:12:46,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {79115#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79120#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:12:46,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {79115#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79115#true} is VALID [2022-04-28 10:12:46,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {79115#true} call #t~ret15 := main(); {79115#true} is VALID [2022-04-28 10:12:46,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79115#true} {79115#true} #83#return; {79115#true} is VALID [2022-04-28 10:12:46,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {79115#true} assume true; {79115#true} is VALID [2022-04-28 10:12:46,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {79115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {79115#true} is VALID [2022-04-28 10:12:46,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {79115#true} call ULTIMATE.init(); {79115#true} is VALID [2022-04-28 10:12:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:12:46,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591647712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:46,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:46,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 18 [2022-04-28 10:12:46,858 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:46,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1880745539] [2022-04-28 10:12:46,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1880745539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:46,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:46,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:12:46,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787832074] [2022-04-28 10:12:46,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:46,859 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:46,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:46,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:46,887 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:46,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:12:46,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:46,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:12:46,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:12:46,887 INFO L87 Difference]: Start difference. First operand 316 states and 416 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:50,401 INFO L93 Difference]: Finished difference Result 417 states and 568 transitions. [2022-04-28 10:12:50,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:12:50,401 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:50,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:50,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 95 transitions. [2022-04-28 10:12:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 95 transitions. [2022-04-28 10:12:50,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 95 transitions. [2022-04-28 10:12:50,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:50,506 INFO L225 Difference]: With dead ends: 417 [2022-04-28 10:12:50,507 INFO L226 Difference]: Without dead ends: 405 [2022-04-28 10:12:50,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 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:12:50,507 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 88 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:50,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 53 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:12:50,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-28 10:12:52,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 358. [2022-04-28 10:12:52,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:52,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 358 states, 353 states have (on average 1.3286118980169972) internal successors, (469), 353 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call 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,150 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 358 states, 353 states have (on average 1.3286118980169972) internal successors, (469), 353 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call 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,150 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 358 states, 353 states have (on average 1.3286118980169972) internal successors, (469), 353 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call 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,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:52,157 INFO L93 Difference]: Finished difference Result 405 states and 541 transitions. [2022-04-28 10:12:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 541 transitions. [2022-04-28 10:12:52,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:52,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:52,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 358 states, 353 states have (on average 1.3286118980169972) internal successors, (469), 353 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-28 10:12:52,158 INFO L87 Difference]: Start difference. First operand has 358 states, 353 states have (on average 1.3286118980169972) internal successors, (469), 353 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-28 10:12:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:52,164 INFO L93 Difference]: Finished difference Result 405 states and 541 transitions. [2022-04-28 10:12:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 541 transitions. [2022-04-28 10:12:52,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:52,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:52,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:52,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 353 states have (on average 1.3286118980169972) internal successors, (469), 353 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call 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,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 473 transitions. [2022-04-28 10:12:52,170 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 473 transitions. Word has length 36 [2022-04-28 10:12:52,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:52,171 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 473 transitions. [2022-04-28 10:12:52,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:52,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 358 states and 473 transitions. [2022-04-28 10:12:54,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 473 transitions. [2022-04-28 10:12:54,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:12:54,362 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:54,362 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:54,378 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:12:54,562 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,SelfDestructingSolverStorable53 [2022-04-28 10:12:54,563 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:54,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:54,563 INFO L85 PathProgramCache]: Analyzing trace with hash -777486412, now seen corresponding path program 21 times [2022-04-28 10:12:54,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:54,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [615717371] [2022-04-28 10:12:54,566 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:54,566 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:54,566 INFO L85 PathProgramCache]: Analyzing trace with hash -777486412, now seen corresponding path program 22 times [2022-04-28 10:12:54,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:54,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231115860] [2022-04-28 10:12:54,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:54,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:54,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:54,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {81751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81731#true} is VALID [2022-04-28 10:12:54,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {81731#true} assume true; {81731#true} is VALID [2022-04-28 10:12:54,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81731#true} {81731#true} #83#return; {81731#true} is VALID [2022-04-28 10:12:54,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {81731#true} call ULTIMATE.init(); {81751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:54,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {81751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81731#true} is VALID [2022-04-28 10:12:54,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {81731#true} assume true; {81731#true} is VALID [2022-04-28 10:12:54,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81731#true} {81731#true} #83#return; {81731#true} is VALID [2022-04-28 10:12:54,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {81731#true} call #t~ret15 := main(); {81731#true} is VALID [2022-04-28 10:12:54,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {81731#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81736#(= main_~y~0 0)} is VALID [2022-04-28 10:12:54,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {81736#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81737#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:54,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {81737#(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; {81738#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:54,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {81738#(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; {81739#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:54,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {81739#(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; {81740#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:54,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {81740#(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; {81741#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:54,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {81741#(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; {81742#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:54,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {81742#(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; {81743#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:54,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {81743#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {81743#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:54,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {81743#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {81744#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:54,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {81744#(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; {81745#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:54,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {81745#(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; {81746#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:54,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {81746#(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; {81747#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:12:54,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {81747#(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; {81748#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:12:54,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {81748#(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; {81749#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:12:54,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {81749#(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; {81750#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:12:54,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {81750#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-28 10:12:54,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {81732#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81732#false} is VALID [2022-04-28 10:12:54,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {81732#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81732#false} is VALID [2022-04-28 10:12:54,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {81732#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81732#false} is VALID [2022-04-28 10:12:54,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {81732#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81732#false} is VALID [2022-04-28 10:12:54,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {81732#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81732#false} is VALID [2022-04-28 10:12:54,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {81732#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81732#false} is VALID [2022-04-28 10:12:54,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {81732#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81732#false} is VALID [2022-04-28 10:12:54,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {81732#false} assume !(~y~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-28 10:12:54,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {81732#false} assume !(~x~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-28 10:12:54,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {81732#false} assume !(~z~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-28 10:12:54,807 INFO L272 TraceCheckUtils]: 32: Hoare triple {81732#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {81732#false} is VALID [2022-04-28 10:12:54,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {81732#false} ~cond := #in~cond; {81732#false} is VALID [2022-04-28 10:12:54,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {81732#false} assume 0 == ~cond; {81732#false} is VALID [2022-04-28 10:12:54,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {81732#false} assume !false; {81732#false} is VALID [2022-04-28 10:12:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:12:54,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:54,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231115860] [2022-04-28 10:12:54,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231115860] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:54,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572294215] [2022-04-28 10:12:54,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:54,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:54,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:54,809 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:12:54,809 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:12:54,849 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:54,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:54,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 10:12:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:54,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:55,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {81731#true} call ULTIMATE.init(); {81731#true} is VALID [2022-04-28 10:12:55,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {81731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81731#true} is VALID [2022-04-28 10:12:55,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {81731#true} assume true; {81731#true} is VALID [2022-04-28 10:12:55,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81731#true} {81731#true} #83#return; {81731#true} is VALID [2022-04-28 10:12:55,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {81731#true} call #t~ret15 := main(); {81731#true} is VALID [2022-04-28 10:12:55,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {81731#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81731#true} is VALID [2022-04-28 10:12:55,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {81731#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81731#true} is VALID [2022-04-28 10:12:55,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {81731#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:55,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81780#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:55,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {81780#(< 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; {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:55,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:55,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:55,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:55,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:55,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:55,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:55,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:55,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:55,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81780#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:55,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {81780#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:55,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-28 10:12:55,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {81732#false} assume !(~z~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-28 10:12:55,100 INFO L272 TraceCheckUtils]: 32: Hoare triple {81732#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {81732#false} is VALID [2022-04-28 10:12:55,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {81732#false} ~cond := #in~cond; {81732#false} is VALID [2022-04-28 10:12:55,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {81732#false} assume 0 == ~cond; {81732#false} is VALID [2022-04-28 10:12:55,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {81732#false} assume !false; {81732#false} is VALID [2022-04-28 10:12:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:12:55,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:55,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {81732#false} assume !false; {81732#false} is VALID [2022-04-28 10:12:55,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {81732#false} assume 0 == ~cond; {81732#false} is VALID [2022-04-28 10:12:55,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {81732#false} ~cond := #in~cond; {81732#false} is VALID [2022-04-28 10:12:55,214 INFO L272 TraceCheckUtils]: 32: Hoare triple {81732#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {81732#false} is VALID [2022-04-28 10:12:55,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {81732#false} assume !(~z~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-28 10:12:55,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {81732#false} is VALID [2022-04-28 10:12:55,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {81821#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81821#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:55,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {81780#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:55,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81780#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:55,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:55,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:55,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:55,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:55,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:55,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81796#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:55,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81792#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:55,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81788#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:55,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {81780#(< 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; {81784#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:55,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81780#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:55,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {81731#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81776#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:55,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {81731#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81731#true} is VALID [2022-04-28 10:12:55,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {81731#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81731#true} is VALID [2022-04-28 10:12:55,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {81731#true} call #t~ret15 := main(); {81731#true} is VALID [2022-04-28 10:12:55,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81731#true} {81731#true} #83#return; {81731#true} is VALID [2022-04-28 10:12:55,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {81731#true} assume true; {81731#true} is VALID [2022-04-28 10:12:55,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {81731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {81731#true} is VALID [2022-04-28 10:12:55,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {81731#true} call ULTIMATE.init(); {81731#true} is VALID [2022-04-28 10:12:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:12:55,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572294215] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:55,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:55,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-28 10:12:55,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:55,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [615717371] [2022-04-28 10:12:55,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [615717371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:55,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:55,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:12:55,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831963226] [2022-04-28 10:12:55,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:55,227 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 36 [2022-04-28 10:12:55,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:55,227 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:12:55,246 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:55,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:12:55,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:55,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:12:55,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:12:55,247 INFO L87 Difference]: Start difference. First operand 358 states and 473 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:13:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:01,647 INFO L93 Difference]: Finished difference Result 476 states and 623 transitions. [2022-04-28 10:13:01,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 10:13:01,647 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 36 [2022-04-28 10:13:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:01,647 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:13:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 123 transitions. [2022-04-28 10:13:01,648 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:13:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 123 transitions. [2022-04-28 10:13:01,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 123 transitions. [2022-04-28 10:13:01,741 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:13:01,750 INFO L225 Difference]: With dead ends: 476 [2022-04-28 10:13:01,750 INFO L226 Difference]: Without dead ends: 461 [2022-04-28 10:13:01,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=2717, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:13:01,751 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 73 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:01,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 108 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:13:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-04-28 10:13:03,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 359. [2022-04-28 10:13:03,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:03,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 461 states. Second operand has 359 states, 354 states have (on average 1.3276836158192091) internal successors, (470), 354 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call 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:03,389 INFO L74 IsIncluded]: Start isIncluded. First operand 461 states. Second operand has 359 states, 354 states have (on average 1.3276836158192091) internal successors, (470), 354 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call 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:03,389 INFO L87 Difference]: Start difference. First operand 461 states. Second operand has 359 states, 354 states have (on average 1.3276836158192091) internal successors, (470), 354 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call 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:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:03,396 INFO L93 Difference]: Finished difference Result 461 states and 606 transitions. [2022-04-28 10:13:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 606 transitions. [2022-04-28 10:13:03,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:03,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:03,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 354 states have (on average 1.3276836158192091) internal successors, (470), 354 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 461 states. [2022-04-28 10:13:03,397 INFO L87 Difference]: Start difference. First operand has 359 states, 354 states have (on average 1.3276836158192091) internal successors, (470), 354 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 461 states. [2022-04-28 10:13:03,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:03,405 INFO L93 Difference]: Finished difference Result 461 states and 606 transitions. [2022-04-28 10:13:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 606 transitions. [2022-04-28 10:13:03,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:03,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:03,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:03,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.3276836158192091) internal successors, (470), 354 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call 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:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 474 transitions. [2022-04-28 10:13:03,411 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 474 transitions. Word has length 36 [2022-04-28 10:13:03,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:03,411 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 474 transitions. [2022-04-28 10:13:03,411 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:13:03,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 359 states and 474 transitions. [2022-04-28 10:13:05,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 474 transitions. [2022-04-28 10:13:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:13:05,261 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:05,261 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:05,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:05,461 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,SelfDestructingSolverStorable54 [2022-04-28 10:13:05,462 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:05,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash -84969854, now seen corresponding path program 21 times [2022-04-28 10:13:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:05,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [653917133] [2022-04-28 10:13:05,464 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:05,464 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:05,464 INFO L85 PathProgramCache]: Analyzing trace with hash -84969854, now seen corresponding path program 22 times [2022-04-28 10:13:05,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:05,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566281480] [2022-04-28 10:13:05,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:05,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:05,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:05,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {84643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84626#true} is VALID [2022-04-28 10:13:05,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {84626#true} assume true; {84626#true} is VALID [2022-04-28 10:13:05,643 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84626#true} {84626#true} #83#return; {84626#true} is VALID [2022-04-28 10:13:05,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {84626#true} call ULTIMATE.init(); {84643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:05,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {84643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84626#true} is VALID [2022-04-28 10:13:05,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {84626#true} assume true; {84626#true} is VALID [2022-04-28 10:13:05,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84626#true} {84626#true} #83#return; {84626#true} is VALID [2022-04-28 10:13:05,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {84626#true} call #t~ret15 := main(); {84626#true} is VALID [2022-04-28 10:13:05,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {84626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84631#(= main_~y~0 0)} is VALID [2022-04-28 10:13:05,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {84631#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84632#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:05,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {84632#(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; {84633#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:05,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {84633#(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; {84634#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:05,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {84634#(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; {84635#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:05,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {84635#(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; {84636#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:05,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {84636#(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; {84637#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:05,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {84637#(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; {84638#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:05,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {84638#(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; {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:05,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:05,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {84640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:05,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {84640#(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; {84641#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:05,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {84641#(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; {84642#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:05,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {84642#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-28 10:13:05,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:05,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:05,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:05,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:05,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:05,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:05,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:05,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:05,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {84627#false} assume !(~y~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-28 10:13:05,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {84627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {84627#false} is VALID [2022-04-28 10:13:05,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {84627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {84627#false} is VALID [2022-04-28 10:13:05,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {84627#false} assume !(~x~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-28 10:13:05,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {84627#false} assume !(~z~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-28 10:13:05,651 INFO L272 TraceCheckUtils]: 32: Hoare triple {84627#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {84627#false} is VALID [2022-04-28 10:13:05,651 INFO L290 TraceCheckUtils]: 33: Hoare triple {84627#false} ~cond := #in~cond; {84627#false} is VALID [2022-04-28 10:13:05,651 INFO L290 TraceCheckUtils]: 34: Hoare triple {84627#false} assume 0 == ~cond; {84627#false} is VALID [2022-04-28 10:13:05,651 INFO L290 TraceCheckUtils]: 35: Hoare triple {84627#false} assume !false; {84627#false} is VALID [2022-04-28 10:13:05,651 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:13:05,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:05,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566281480] [2022-04-28 10:13:05,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566281480] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:05,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567102679] [2022-04-28 10:13:05,652 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:05,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:05,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:05,653 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:13:05,654 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:13:05,694 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:05,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:05,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:13:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:05,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:06,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {84626#true} call ULTIMATE.init(); {84626#true} is VALID [2022-04-28 10:13:06,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {84626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84626#true} is VALID [2022-04-28 10:13:06,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {84626#true} assume true; {84626#true} is VALID [2022-04-28 10:13:06,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84626#true} {84626#true} #83#return; {84626#true} is VALID [2022-04-28 10:13:06,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {84626#true} call #t~ret15 := main(); {84626#true} is VALID [2022-04-28 10:13:06,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {84626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84631#(= main_~y~0 0)} is VALID [2022-04-28 10:13:06,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {84631#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84632#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:06,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {84632#(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; {84633#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:06,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {84633#(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; {84634#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:06,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {84634#(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; {84635#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:06,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {84635#(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; {84636#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:06,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {84636#(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; {84637#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:06,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {84637#(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; {84638#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:06,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {84638#(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; {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:06,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:06,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {84639#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {84640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:06,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {84640#(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; {84641#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:06,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {84641#(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; {84698#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:06,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {84698#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-28 10:13:06,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {84627#false} assume !(~y~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-28 10:13:06,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {84627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {84627#false} is VALID [2022-04-28 10:13:06,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {84627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {84627#false} is VALID [2022-04-28 10:13:06,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {84627#false} assume !(~x~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-28 10:13:06,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {84627#false} assume !(~z~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-28 10:13:06,069 INFO L272 TraceCheckUtils]: 32: Hoare triple {84627#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {84627#false} is VALID [2022-04-28 10:13:06,069 INFO L290 TraceCheckUtils]: 33: Hoare triple {84627#false} ~cond := #in~cond; {84627#false} is VALID [2022-04-28 10:13:06,069 INFO L290 TraceCheckUtils]: 34: Hoare triple {84627#false} assume 0 == ~cond; {84627#false} is VALID [2022-04-28 10:13:06,069 INFO L290 TraceCheckUtils]: 35: Hoare triple {84627#false} assume !false; {84627#false} is VALID [2022-04-28 10:13:06,069 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:13:06,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:06,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {84627#false} assume !false; {84627#false} is VALID [2022-04-28 10:13:06,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {84627#false} assume 0 == ~cond; {84627#false} is VALID [2022-04-28 10:13:06,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {84627#false} ~cond := #in~cond; {84627#false} is VALID [2022-04-28 10:13:06,363 INFO L272 TraceCheckUtils]: 32: Hoare triple {84627#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {84627#false} is VALID [2022-04-28 10:13:06,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {84627#false} assume !(~z~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-28 10:13:06,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {84627#false} assume !(~x~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-28 10:13:06,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {84627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {84627#false} is VALID [2022-04-28 10:13:06,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {84627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {84627#false} is VALID [2022-04-28 10:13:06,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {84627#false} assume !(~y~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-28 10:13:06,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {84627#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84627#false} is VALID [2022-04-28 10:13:06,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {84804#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {84627#false} is VALID [2022-04-28 10:13:06,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {84808#(< 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; {84804#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:06,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {84812#(< 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; {84808#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:06,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {84816#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {84812#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:06,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {84816#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {84816#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:06,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {84823#(< 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; {84816#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:06,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {84827#(< 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; {84823#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:06,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {84831#(< 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; {84827#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:06,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {84835#(< 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; {84831#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:06,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {84839#(< 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; {84835#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:06,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {84843#(< 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; {84839#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:06,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {84847#(< 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; {84843#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:06,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {84851#(< 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; {84847#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:06,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {84626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84851#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:06,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {84626#true} call #t~ret15 := main(); {84626#true} is VALID [2022-04-28 10:13:06,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84626#true} {84626#true} #83#return; {84626#true} is VALID [2022-04-28 10:13:06,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {84626#true} assume true; {84626#true} is VALID [2022-04-28 10:13:06,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {84626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84626#true} is VALID [2022-04-28 10:13:06,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {84626#true} call ULTIMATE.init(); {84626#true} is VALID [2022-04-28 10:13:06,393 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:13:06,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567102679] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:06,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:06,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:13:06,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:06,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [653917133] [2022-04-28 10:13:06,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [653917133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:06,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:06,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:13:06,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929907745] [2022-04-28 10:13:06,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:06,394 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 36 [2022-04-28 10:13:06,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:06,394 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:13:06,448 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:06,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:13:06,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:06,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:13:06,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:13:06,449 INFO L87 Difference]: Start difference. First operand 359 states and 474 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:13:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:13,002 INFO L93 Difference]: Finished difference Result 533 states and 683 transitions. [2022-04-28 10:13:13,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:13:13,002 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 36 [2022-04-28 10:13:13,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:13,002 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:13:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 121 transitions. [2022-04-28 10:13:13,003 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:13:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 121 transitions. [2022-04-28 10:13:13,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 121 transitions. [2022-04-28 10:13:13,094 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:13:13,104 INFO L225 Difference]: With dead ends: 533 [2022-04-28 10:13:13,105 INFO L226 Difference]: Without dead ends: 515 [2022-04-28 10:13:13,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 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:13:13,105 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 93 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:13,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 111 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:13:13,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-28 10:13:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 359. [2022-04-28 10:13:14,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:14,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 359 states, 354 states have (on average 1.3248587570621468) internal successors, (469), 354 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call 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,773 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 359 states, 354 states have (on average 1.3248587570621468) internal successors, (469), 354 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call 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,773 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 359 states, 354 states have (on average 1.3248587570621468) internal successors, (469), 354 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call 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,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:14,782 INFO L93 Difference]: Finished difference Result 515 states and 664 transitions. [2022-04-28 10:13:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 664 transitions. [2022-04-28 10:13:14,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:14,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:14,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 354 states have (on average 1.3248587570621468) internal successors, (469), 354 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-28 10:13:14,783 INFO L87 Difference]: Start difference. First operand has 359 states, 354 states have (on average 1.3248587570621468) internal successors, (469), 354 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-28 10:13:14,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:14,792 INFO L93 Difference]: Finished difference Result 515 states and 664 transitions. [2022-04-28 10:13:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 664 transitions. [2022-04-28 10:13:14,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:14,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:14,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:14,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.3248587570621468) internal successors, (469), 354 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call 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,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 473 transitions. [2022-04-28 10:13:14,798 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 473 transitions. Word has length 36 [2022-04-28 10:13:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:14,798 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 473 transitions. [2022-04-28 10:13:14,798 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:13:14,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 359 states and 473 transitions. [2022-04-28 10:13:16,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 473 transitions. [2022-04-28 10:13:16,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:13:16,707 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:16,707 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:16,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-04-28 10:13:16,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-04-28 10:13:16,908 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:16,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:16,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2043557906, now seen corresponding path program 23 times [2022-04-28 10:13:16,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:16,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [40179659] [2022-04-28 10:13:16,910 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:16,911 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2043557906, now seen corresponding path program 24 times [2022-04-28 10:13:16,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:16,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902412765] [2022-04-28 10:13:16,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:16,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:17,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:17,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {87733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87716#true} is VALID [2022-04-28 10:13:17,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {87716#true} assume true; {87716#true} is VALID [2022-04-28 10:13:17,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87716#true} {87716#true} #83#return; {87716#true} is VALID [2022-04-28 10:13:17,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {87716#true} call ULTIMATE.init(); {87733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:17,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {87733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87716#true} is VALID [2022-04-28 10:13:17,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {87716#true} assume true; {87716#true} is VALID [2022-04-28 10:13:17,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87716#true} {87716#true} #83#return; {87716#true} is VALID [2022-04-28 10:13:17,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {87716#true} call #t~ret15 := main(); {87716#true} is VALID [2022-04-28 10:13:17,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {87716#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87721#(= main_~y~0 0)} is VALID [2022-04-28 10:13:17,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {87721#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87722#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:17,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {87722#(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; {87723#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:17,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {87723#(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; {87724#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:17,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {87724#(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; {87725#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:17,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {87725#(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; {87726#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:17,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {87726#(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; {87727#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:17,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {87727#(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; {87728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:17,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {87728#(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; {87729#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:17,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {87729#(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; {87730#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:17,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {87730#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {87730#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:17,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {87730#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {87731#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:13:17,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {87731#(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; {87732#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:13:17,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {87732#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-28 10:13:17,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {87717#false} assume !(~y~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-28 10:13:17,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {87717#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87717#false} is VALID [2022-04-28 10:13:17,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {87717#false} assume !(~x~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-28 10:13:17,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {87717#false} assume !(~z~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-28 10:13:17,098 INFO L272 TraceCheckUtils]: 32: Hoare triple {87717#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {87717#false} is VALID [2022-04-28 10:13:17,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {87717#false} ~cond := #in~cond; {87717#false} is VALID [2022-04-28 10:13:17,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {87717#false} assume 0 == ~cond; {87717#false} is VALID [2022-04-28 10:13:17,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {87717#false} assume !false; {87717#false} is VALID [2022-04-28 10:13:17,098 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:13:17,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:17,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902412765] [2022-04-28 10:13:17,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902412765] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:17,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622536110] [2022-04-28 10:13:17,099 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:17,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:17,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:17,099 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:13:17,101 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:13:17,168 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:13:17,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:17,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:13:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:17,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:17,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {87716#true} call ULTIMATE.init(); {87716#true} is VALID [2022-04-28 10:13:17,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {87716#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87716#true} is VALID [2022-04-28 10:13:17,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {87716#true} assume true; {87716#true} is VALID [2022-04-28 10:13:17,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87716#true} {87716#true} #83#return; {87716#true} is VALID [2022-04-28 10:13:17,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {87716#true} call #t~ret15 := main(); {87716#true} is VALID [2022-04-28 10:13:17,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {87716#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87716#true} is VALID [2022-04-28 10:13:17,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {87716#true} assume !(~x~0 % 4294967296 > 0); {87716#true} is VALID [2022-04-28 10:13:17,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {87716#true} ~z~0 := ~y~0; {87785#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:13:17,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {87785#(= 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; {87789#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:13:17,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {87789#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {87793#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:13:17,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {87793#(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; {87797#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:13:17,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {87797#(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; {87717#false} is VALID [2022-04-28 10:13:17,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {87717#false} assume !(~y~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-28 10:13:17,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {87717#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87717#false} is VALID [2022-04-28 10:13:17,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {87717#false} assume !(~x~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-28 10:13:17,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {87717#false} assume !(~z~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-28 10:13:17,293 INFO L272 TraceCheckUtils]: 32: Hoare triple {87717#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {87717#false} is VALID [2022-04-28 10:13:17,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {87717#false} ~cond := #in~cond; {87717#false} is VALID [2022-04-28 10:13:17,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {87717#false} assume 0 == ~cond; {87717#false} is VALID [2022-04-28 10:13:17,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {87717#false} assume !false; {87717#false} is VALID [2022-04-28 10:13:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-28 10:13:17,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:17,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {87717#false} assume !false; {87717#false} is VALID [2022-04-28 10:13:17,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {87717#false} assume 0 == ~cond; {87717#false} is VALID [2022-04-28 10:13:17,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {87717#false} ~cond := #in~cond; {87717#false} is VALID [2022-04-28 10:13:17,408 INFO L272 TraceCheckUtils]: 32: Hoare triple {87717#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {87717#false} is VALID [2022-04-28 10:13:17,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {87717#false} assume !(~z~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-28 10:13:17,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {87717#false} assume !(~x~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-28 10:13:17,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {87717#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87717#false} is VALID [2022-04-28 10:13:17,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {87717#false} assume !(~y~0 % 4294967296 > 0); {87717#false} is VALID [2022-04-28 10:13:17,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {87717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87717#false} is VALID [2022-04-28 10:13:17,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {87797#(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; {87717#false} is VALID [2022-04-28 10:13:17,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {87793#(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; {87797#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:13:17,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {87897#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {87793#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:13:17,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {87901#(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; {87897#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:13:17,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {87716#true} ~z~0 := ~y~0; {87901#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:13:17,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {87716#true} assume !(~x~0 % 4294967296 > 0); {87716#true} is VALID [2022-04-28 10:13:17,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {87716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87716#true} is VALID [2022-04-28 10:13:17,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {87716#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87716#true} is VALID [2022-04-28 10:13:17,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {87716#true} call #t~ret15 := main(); {87716#true} is VALID [2022-04-28 10:13:17,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87716#true} {87716#true} #83#return; {87716#true} is VALID [2022-04-28 10:13:17,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {87716#true} assume true; {87716#true} is VALID [2022-04-28 10:13:17,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {87716#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87716#true} is VALID [2022-04-28 10:13:17,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {87716#true} call ULTIMATE.init(); {87716#true} is VALID [2022-04-28 10:13:17,413 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-28 10:13:17,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622536110] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:17,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:17,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 6] total 21 [2022-04-28 10:13:17,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:17,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [40179659] [2022-04-28 10:13:17,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [40179659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:17,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:17,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:13:17,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132890979] [2022-04-28 10:13:17,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:17,414 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 36 [2022-04-28 10:13:17,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:17,414 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:13:17,431 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:17,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:13:17,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:17,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:13:17,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:13:17,431 INFO L87 Difference]: Start difference. First operand 359 states and 473 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:13:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:24,870 INFO L93 Difference]: Finished difference Result 563 states and 717 transitions. [2022-04-28 10:13:24,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:13:24,870 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 36 [2022-04-28 10:13:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:24,870 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:13:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2022-04-28 10:13:24,871 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:13:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2022-04-28 10:13:24,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 129 transitions. [2022-04-28 10:13:24,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:24,985 INFO L225 Difference]: With dead ends: 563 [2022-04-28 10:13:24,985 INFO L226 Difference]: Without dead ends: 545 [2022-04-28 10:13:24,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:13:24,986 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 107 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:24,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 129 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:13:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-04-28 10:13:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 359. [2022-04-28 10:13:26,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:26,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 545 states. Second operand has 359 states, 354 states have (on average 1.3220338983050848) internal successors, (468), 354 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call 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,618 INFO L74 IsIncluded]: Start isIncluded. First operand 545 states. Second operand has 359 states, 354 states have (on average 1.3220338983050848) internal successors, (468), 354 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call 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,618 INFO L87 Difference]: Start difference. First operand 545 states. Second operand has 359 states, 354 states have (on average 1.3220338983050848) internal successors, (468), 354 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call 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,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:26,628 INFO L93 Difference]: Finished difference Result 545 states and 698 transitions. [2022-04-28 10:13:26,628 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 698 transitions. [2022-04-28 10:13:26,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:26,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:26,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 354 states have (on average 1.3220338983050848) internal successors, (468), 354 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 545 states. [2022-04-28 10:13:26,629 INFO L87 Difference]: Start difference. First operand has 359 states, 354 states have (on average 1.3220338983050848) internal successors, (468), 354 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 545 states. [2022-04-28 10:13:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:26,639 INFO L93 Difference]: Finished difference Result 545 states and 698 transitions. [2022-04-28 10:13:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 698 transitions. [2022-04-28 10:13:26,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:26,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:26,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:26,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:26,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.3220338983050848) internal successors, (468), 354 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call 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,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 472 transitions. [2022-04-28 10:13:26,645 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 472 transitions. Word has length 36 [2022-04-28 10:13:26,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:26,645 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 472 transitions. [2022-04-28 10:13:26,645 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:13:26,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 359 states and 472 transitions. [2022-04-28 10:13:29,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 472 transitions. [2022-04-28 10:13:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:13:29,091 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:29,091 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:29,107 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:13:29,291 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,SelfDestructingSolverStorable56 [2022-04-28 10:13:29,292 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:29,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash 738830658, now seen corresponding path program 39 times [2022-04-28 10:13:29,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:29,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1651955006] [2022-04-28 10:13:29,294 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:29,294 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:29,294 INFO L85 PathProgramCache]: Analyzing trace with hash 738830658, now seen corresponding path program 40 times [2022-04-28 10:13:29,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:29,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009669271] [2022-04-28 10:13:29,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:29,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:29,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:29,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {90942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90915#true} is VALID [2022-04-28 10:13:29,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {90915#true} assume true; {90915#true} is VALID [2022-04-28 10:13:29,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90915#true} {90915#true} #83#return; {90915#true} is VALID [2022-04-28 10:13:29,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {90915#true} call ULTIMATE.init(); {90942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:29,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {90942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90915#true} is VALID [2022-04-28 10:13:29,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {90915#true} assume true; {90915#true} is VALID [2022-04-28 10:13:29,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90915#true} {90915#true} #83#return; {90915#true} is VALID [2022-04-28 10:13:29,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {90915#true} call #t~ret15 := main(); {90915#true} is VALID [2022-04-28 10:13:29,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {90915#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90920#(= main_~y~0 0)} is VALID [2022-04-28 10:13:29,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {90920#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90921#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:29,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {90921#(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; {90922#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:29,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {90922#(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; {90923#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:29,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {90923#(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; {90924#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:29,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {90924#(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; {90925#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:29,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {90925#(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; {90926#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:29,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {90926#(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; {90927#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:29,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {90927#(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; {90928#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:29,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {90928#(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; {90929#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:29,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {90929#(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; {90930#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:29,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {90930#(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; {90931#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:29,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {90931#(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; {90932#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:29,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {90932#(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; {90933#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:29,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {90933#(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; {90934#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:29,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {90934#(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; {90935#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:29,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {90935#(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; {90936#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:29,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {90936#(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; {90937#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:29,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {90937#(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; {90938#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:29,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {90938#(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; {90939#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:13:29,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {90939#(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; {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:13:29,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:13:29,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {90941#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} is VALID [2022-04-28 10:13:29,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {90941#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-28 10:13:29,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {90916#false} assume !(~y~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-28 10:13:29,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {90916#false} assume !(~x~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-28 10:13:29,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {90916#false} assume !(~z~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-28 10:13:29,681 INFO L272 TraceCheckUtils]: 32: Hoare triple {90916#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90916#false} is VALID [2022-04-28 10:13:29,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {90916#false} ~cond := #in~cond; {90916#false} is VALID [2022-04-28 10:13:29,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {90916#false} assume 0 == ~cond; {90916#false} is VALID [2022-04-28 10:13:29,681 INFO L290 TraceCheckUtils]: 35: Hoare triple {90916#false} assume !false; {90916#false} is VALID [2022-04-28 10:13:29,682 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:13:29,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:29,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009669271] [2022-04-28 10:13:29,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009669271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:29,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921897050] [2022-04-28 10:13:29,682 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:29,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:29,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:29,683 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:13:29,683 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:13:29,745 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:29,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:29,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:13:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:29,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:30,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {90915#true} call ULTIMATE.init(); {90915#true} is VALID [2022-04-28 10:13:30,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {90915#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90915#true} is VALID [2022-04-28 10:13:30,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {90915#true} assume true; {90915#true} is VALID [2022-04-28 10:13:30,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90915#true} {90915#true} #83#return; {90915#true} is VALID [2022-04-28 10:13:30,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {90915#true} call #t~ret15 := main(); {90915#true} is VALID [2022-04-28 10:13:30,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {90915#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90920#(= main_~y~0 0)} is VALID [2022-04-28 10:13:30,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {90920#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90921#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:30,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {90921#(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; {90922#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:30,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {90922#(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; {90923#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:30,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {90923#(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; {90924#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:30,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {90924#(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; {90925#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:30,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {90925#(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; {90926#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:30,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {90926#(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; {90927#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:30,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {90927#(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; {90928#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:30,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {90928#(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; {90929#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:30,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {90929#(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; {90930#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:30,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {90930#(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; {90931#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:30,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {90931#(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; {90932#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:30,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {90932#(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; {90933#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:30,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {90933#(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; {90934#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:30,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {90934#(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; {90935#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:30,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {90935#(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; {90936#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:30,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {90936#(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; {90937#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:30,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {90937#(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; {90938#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:30,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {90938#(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; {90939#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:13:30,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {90939#(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; {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:13:30,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:13:30,096 INFO L290 TraceCheckUtils]: 27: Hoare triple {90940#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {91027#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-28 10:13:30,096 INFO L290 TraceCheckUtils]: 28: Hoare triple {91027#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-28 10:13:30,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {90916#false} assume !(~y~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-28 10:13:30,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {90916#false} assume !(~x~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-28 10:13:30,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {90916#false} assume !(~z~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-28 10:13:30,097 INFO L272 TraceCheckUtils]: 32: Hoare triple {90916#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90916#false} is VALID [2022-04-28 10:13:30,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {90916#false} ~cond := #in~cond; {90916#false} is VALID [2022-04-28 10:13:30,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {90916#false} assume 0 == ~cond; {90916#false} is VALID [2022-04-28 10:13:30,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {90916#false} assume !false; {90916#false} is VALID [2022-04-28 10:13:30,097 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:13:30,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:30,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {90916#false} assume !false; {90916#false} is VALID [2022-04-28 10:13:30,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {90916#false} assume 0 == ~cond; {90916#false} is VALID [2022-04-28 10:13:30,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {90916#false} ~cond := #in~cond; {90916#false} is VALID [2022-04-28 10:13:30,906 INFO L272 TraceCheckUtils]: 32: Hoare triple {90916#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90916#false} is VALID [2022-04-28 10:13:30,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {90916#false} assume !(~z~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-28 10:13:30,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {90916#false} assume !(~x~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-28 10:13:30,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {90916#false} assume !(~y~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-28 10:13:30,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {91073#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {90916#false} is VALID [2022-04-28 10:13:30,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {91077#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {91073#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:30,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {91077#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {91077#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:30,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {91084#(< 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; {91077#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:30,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {91088#(< 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; {91084#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:30,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {91092#(< 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; {91088#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:30,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {91096#(< 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; {91092#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:30,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {91100#(< 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; {91096#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:30,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {91104#(< 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; {91100#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:30,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {91108#(< 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; {91104#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:30,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {91112#(< 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; {91108#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:30,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {91116#(< 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; {91112#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:13:30,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {91120#(< 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; {91116#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:13:30,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {91124#(< 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; {91120#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:13:30,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {91128#(< 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; {91124#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:13:30,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {91132#(< 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; {91128#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:13:30,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {91136#(< 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; {91132#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:13:30,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {91140#(< 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; {91136#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:13:30,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {91144#(< 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; {91140#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:13:30,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {91148#(< 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; {91144#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:13:30,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {91152#(< 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; {91148#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:13:30,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {91156#(< 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; {91152#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:13:30,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {91160#(< 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; {91156#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:30,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {90915#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91160#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:13:30,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {90915#true} call #t~ret15 := main(); {90915#true} is VALID [2022-04-28 10:13:30,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90915#true} {90915#true} #83#return; {90915#true} is VALID [2022-04-28 10:13:30,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {90915#true} assume true; {90915#true} is VALID [2022-04-28 10:13:30,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {90915#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90915#true} is VALID [2022-04-28 10:13:30,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {90915#true} call ULTIMATE.init(); {90915#true} is VALID [2022-04-28 10:13:30,923 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:13:30,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921897050] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:30,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:30,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:13:30,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:30,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1651955006] [2022-04-28 10:13:30,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1651955006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:30,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:30,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:13:30,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470897042] [2022-04-28 10:13:30,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:30,924 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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:13:30,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:30,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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:13:30,945 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:13:30,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:13:30,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:30,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:13:30,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1720, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:13:30,946 INFO L87 Difference]: Start difference. First operand 359 states and 472 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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:13:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:47,571 INFO L93 Difference]: Finished difference Result 810 states and 1162 transitions. [2022-04-28 10:13:47,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:13:47,571 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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:13:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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:13:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 269 transitions. [2022-04-28 10:13:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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:13:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 269 transitions. [2022-04-28 10:13:47,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 269 transitions. [2022-04-28 10:13:47,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:47,805 INFO L225 Difference]: With dead ends: 810 [2022-04-28 10:13:47,805 INFO L226 Difference]: Without dead ends: 775 [2022-04-28 10:13:47,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1088, Invalid=3742, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:13:47,806 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 237 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4707 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 4826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 4707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:47,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 255 Invalid, 4826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 4707 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-28 10:13:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-04-28 10:13:49,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 374. [2022-04-28 10:13:49,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:49,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 775 states. Second operand has 374 states, 369 states have (on average 1.3279132791327912) internal successors, (490), 369 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call 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,540 INFO L74 IsIncluded]: Start isIncluded. First operand 775 states. Second operand has 374 states, 369 states have (on average 1.3279132791327912) internal successors, (490), 369 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call 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,540 INFO L87 Difference]: Start difference. First operand 775 states. Second operand has 374 states, 369 states have (on average 1.3279132791327912) internal successors, (490), 369 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call 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,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:49,560 INFO L93 Difference]: Finished difference Result 775 states and 990 transitions. [2022-04-28 10:13:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 990 transitions. [2022-04-28 10:13:49,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:49,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:49,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 374 states, 369 states have (on average 1.3279132791327912) internal successors, (490), 369 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 775 states. [2022-04-28 10:13:49,561 INFO L87 Difference]: Start difference. First operand has 374 states, 369 states have (on average 1.3279132791327912) internal successors, (490), 369 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 775 states. [2022-04-28 10:13:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:49,580 INFO L93 Difference]: Finished difference Result 775 states and 990 transitions. [2022-04-28 10:13:49,580 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 990 transitions. [2022-04-28 10:13:49,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:49,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:49,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:49,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 369 states have (on average 1.3279132791327912) internal successors, (490), 369 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call 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,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 494 transitions. [2022-04-28 10:13:49,587 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 494 transitions. Word has length 36 [2022-04-28 10:13:49,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:49,587 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 494 transitions. [2022-04-28 10:13:49,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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:13:49,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 374 states and 494 transitions. [2022-04-28 10:13:52,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:52,112 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 494 transitions. [2022-04-28 10:13:52,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:13:52,113 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:52,113 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:52,129 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:13:52,313 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,SelfDestructingSolverStorable57 [2022-04-28 10:13:52,313 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:52,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:52,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1464011024, now seen corresponding path program 11 times [2022-04-28 10:13:52,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:52,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1291718716] [2022-04-28 10:13:52,316 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:52,316 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:52,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1464011024, now seen corresponding path program 12 times [2022-04-28 10:13:52,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:52,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040952167] [2022-04-28 10:13:52,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:52,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:52,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:52,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {95153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95143#true} is VALID [2022-04-28 10:13:52,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {95143#true} assume true; {95143#true} is VALID [2022-04-28 10:13:52,423 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95143#true} {95143#true} #83#return; {95143#true} is VALID [2022-04-28 10:13:52,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {95143#true} call ULTIMATE.init(); {95153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:52,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {95153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95143#true} is VALID [2022-04-28 10:13:52,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {95143#true} assume true; {95143#true} is VALID [2022-04-28 10:13:52,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95143#true} {95143#true} #83#return; {95143#true} is VALID [2022-04-28 10:13:52,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {95143#true} call #t~ret15 := main(); {95143#true} is VALID [2022-04-28 10:13:52,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {95143#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95143#true} is VALID [2022-04-28 10:13:52,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-28 10:13:52,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-28 10:13:52,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-28 10:13:52,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-28 10:13:52,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {95143#true} assume !(~x~0 % 4294967296 > 0); {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:13:52,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:13:52,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {95148#(<= 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; {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:13:52,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {95149#(<= 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; {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {95150#(<= 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; {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {95151#(<= 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; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {95152#(<= 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; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {95152#(<= 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; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {95152#(<= 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; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {95152#(<= 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; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {95152#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:13:52,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:13:52,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95144#false} is VALID [2022-04-28 10:13:52,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {95144#false} assume !(~x~0 % 4294967296 > 0); {95144#false} is VALID [2022-04-28 10:13:52,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-28 10:13:52,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-28 10:13:52,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-28 10:13:52,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-28 10:13:52,433 INFO L290 TraceCheckUtils]: 32: Hoare triple {95144#false} assume !(~z~0 % 4294967296 > 0); {95144#false} is VALID [2022-04-28 10:13:52,433 INFO L272 TraceCheckUtils]: 33: Hoare triple {95144#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {95144#false} is VALID [2022-04-28 10:13:52,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {95144#false} ~cond := #in~cond; {95144#false} is VALID [2022-04-28 10:13:52,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {95144#false} assume 0 == ~cond; {95144#false} is VALID [2022-04-28 10:13:52,433 INFO L290 TraceCheckUtils]: 36: Hoare triple {95144#false} assume !false; {95144#false} is VALID [2022-04-28 10:13:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:13:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:52,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040952167] [2022-04-28 10:13:52,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040952167] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:52,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684661922] [2022-04-28 10:13:52,434 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:52,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:52,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:52,435 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:13:52,435 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:13:52,501 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:13:52,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:52,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 10:13:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:52,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:52,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {95143#true} call ULTIMATE.init(); {95143#true} is VALID [2022-04-28 10:13:52,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {95143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95143#true} is VALID [2022-04-28 10:13:52,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {95143#true} assume true; {95143#true} is VALID [2022-04-28 10:13:52,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95143#true} {95143#true} #83#return; {95143#true} is VALID [2022-04-28 10:13:52,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {95143#true} call #t~ret15 := main(); {95143#true} is VALID [2022-04-28 10:13:52,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {95143#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95143#true} is VALID [2022-04-28 10:13:52,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-28 10:13:52,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-28 10:13:52,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-28 10:13:52,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-28 10:13:52,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {95143#true} assume !(~x~0 % 4294967296 > 0); {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:13:52,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:13:52,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {95148#(<= 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; {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:13:52,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {95149#(<= 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; {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {95150#(<= 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; {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {95151#(<= 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; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {95152#(<= 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; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {95152#(<= 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; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {95152#(<= 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; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {95152#(<= 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; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {95152#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:13:52,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:13:52,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95144#false} is VALID [2022-04-28 10:13:52,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {95144#false} assume !(~x~0 % 4294967296 > 0); {95144#false} is VALID [2022-04-28 10:13:52,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-28 10:13:52,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-28 10:13:52,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-28 10:13:52,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-28 10:13:52,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {95144#false} assume !(~z~0 % 4294967296 > 0); {95144#false} is VALID [2022-04-28 10:13:52,740 INFO L272 TraceCheckUtils]: 33: Hoare triple {95144#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {95144#false} is VALID [2022-04-28 10:13:52,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {95144#false} ~cond := #in~cond; {95144#false} is VALID [2022-04-28 10:13:52,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {95144#false} assume 0 == ~cond; {95144#false} is VALID [2022-04-28 10:13:52,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {95144#false} assume !false; {95144#false} is VALID [2022-04-28 10:13:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:13:52,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:52,990 INFO L290 TraceCheckUtils]: 36: Hoare triple {95144#false} assume !false; {95144#false} is VALID [2022-04-28 10:13:52,990 INFO L290 TraceCheckUtils]: 35: Hoare triple {95144#false} assume 0 == ~cond; {95144#false} is VALID [2022-04-28 10:13:52,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {95144#false} ~cond := #in~cond; {95144#false} is VALID [2022-04-28 10:13:52,990 INFO L272 TraceCheckUtils]: 33: Hoare triple {95144#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {95144#false} is VALID [2022-04-28 10:13:52,990 INFO L290 TraceCheckUtils]: 32: Hoare triple {95144#false} assume !(~z~0 % 4294967296 > 0); {95144#false} is VALID [2022-04-28 10:13:52,990 INFO L290 TraceCheckUtils]: 31: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-28 10:13:52,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-28 10:13:52,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-28 10:13:52,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {95144#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {95144#false} is VALID [2022-04-28 10:13:52,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {95144#false} assume !(~x~0 % 4294967296 > 0); {95144#false} is VALID [2022-04-28 10:13:52,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95144#false} is VALID [2022-04-28 10:13:52,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:13:52,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:13:52,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {95152#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {95152#(<= 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; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {95152#(<= 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; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {95152#(<= 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; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {95152#(<= 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; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {95151#(<= 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; {95152#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:52,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {95150#(<= 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; {95151#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:53,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {95149#(<= 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; {95150#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:53,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {95148#(<= 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; {95149#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:13:53,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:13:53,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {95143#true} assume !(~x~0 % 4294967296 > 0); {95148#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:13:53,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-28 10:13:53,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-28 10:13:53,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-28 10:13:53,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {95143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95143#true} is VALID [2022-04-28 10:13:53,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {95143#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95143#true} is VALID [2022-04-28 10:13:53,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {95143#true} call #t~ret15 := main(); {95143#true} is VALID [2022-04-28 10:13:53,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95143#true} {95143#true} #83#return; {95143#true} is VALID [2022-04-28 10:13:53,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {95143#true} assume true; {95143#true} is VALID [2022-04-28 10:13:53,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {95143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95143#true} is VALID [2022-04-28 10:13:53,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {95143#true} call ULTIMATE.init(); {95143#true} is VALID [2022-04-28 10:13:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:13:53,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684661922] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:53,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:53,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-04-28 10:13:53,003 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:53,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1291718716] [2022-04-28 10:13:53,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1291718716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:53,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:53,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:13:53,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514010761] [2022-04-28 10:13:53,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:53,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 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:53,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:53,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 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:53,024 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:53,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:13:53,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:53,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:13:53,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:13:53,025 INFO L87 Difference]: Start difference. First operand 374 states and 494 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 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:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:56,243 INFO L93 Difference]: Finished difference Result 413 states and 542 transitions. [2022-04-28 10:13:56,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:13:56,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 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:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 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:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-04-28 10:13:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 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:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-04-28 10:13:56,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 70 transitions. [2022-04-28 10:13:56,311 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:56,319 INFO L225 Difference]: With dead ends: 413 [2022-04-28 10:13:56,319 INFO L226 Difference]: Without dead ends: 383 [2022-04-28 10:13:56,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 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:13:56,320 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 38 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:56,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 65 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:13:56,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-28 10:13:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 359. [2022-04-28 10:13:58,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:58,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 359 states, 354 states have (on average 1.3361581920903955) internal successors, (473), 354 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call 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:58,206 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 359 states, 354 states have (on average 1.3361581920903955) internal successors, (473), 354 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call 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:58,206 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 359 states, 354 states have (on average 1.3361581920903955) internal successors, (473), 354 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call 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:58,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:58,213 INFO L93 Difference]: Finished difference Result 383 states and 506 transitions. [2022-04-28 10:13:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 506 transitions. [2022-04-28 10:13:58,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:58,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:58,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 354 states have (on average 1.3361581920903955) internal successors, (473), 354 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 383 states. [2022-04-28 10:13:58,215 INFO L87 Difference]: Start difference. First operand has 359 states, 354 states have (on average 1.3361581920903955) internal successors, (473), 354 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 383 states. [2022-04-28 10:13:58,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:58,221 INFO L93 Difference]: Finished difference Result 383 states and 506 transitions. [2022-04-28 10:13:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 506 transitions. [2022-04-28 10:13:58,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:58,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:58,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:58,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.3361581920903955) internal successors, (473), 354 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call 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:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 477 transitions. [2022-04-28 10:13:58,230 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 477 transitions. Word has length 37 [2022-04-28 10:13:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:58,230 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 477 transitions. [2022-04-28 10:13:58,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 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:58,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 359 states and 477 transitions. [2022-04-28 10:14:00,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 477 transitions. [2022-04-28 10:14:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:14:00,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:00,429 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:00,445 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:14:00,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-04-28 10:14:00,630 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:00,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:00,630 INFO L85 PathProgramCache]: Analyzing trace with hash 203683232, now seen corresponding path program 23 times [2022-04-28 10:14:00,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:00,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291782340] [2022-04-28 10:14:00,632 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:00,632 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash 203683232, now seen corresponding path program 24 times [2022-04-28 10:14:00,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:00,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692968985] [2022-04-28 10:14:00,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:00,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:00,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:00,912 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); {97695#true} is VALID [2022-04-28 10:14:00,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {97695#true} assume true; {97695#true} is VALID [2022-04-28 10:14:00,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97695#true} {97695#true} #83#return; {97695#true} is VALID [2022-04-28 10:14:00,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {97695#true} call ULTIMATE.init(); {97717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:00,913 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); {97695#true} is VALID [2022-04-28 10:14:00,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {97695#true} assume true; {97695#true} is VALID [2022-04-28 10:14:00,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97695#true} {97695#true} #83#return; {97695#true} is VALID [2022-04-28 10:14:00,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {97695#true} call #t~ret15 := main(); {97695#true} is VALID [2022-04-28 10:14:00,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {97695#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97700#(= main_~y~0 0)} is VALID [2022-04-28 10:14:00,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {97700#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97701#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:00,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {97701#(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; {97702#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:00,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {97702#(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; {97703#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:00,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {97703#(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; {97704#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:00,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {97704#(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; {97705#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:00,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {97705#(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; {97706#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:00,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {97706#(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; {97707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:00,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {97707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {97707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:00,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {97707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {97708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:00,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {97708#(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; {97709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:00,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {97709#(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; {97710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:14:00,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {97710#(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; {97711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:14:00,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {97711#(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; {97712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:14:00,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {97712#(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; {97713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:14:00,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {97713#(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; {97714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:14:00,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {97714#(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; {97715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:14:00,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {97715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {97715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:14:00,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {97715#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:14:00,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {97714#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:14:00,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {97713#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:14:00,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {97712#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:14:00,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {97711#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97710#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:14:00,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {97710#(and (<= main_~z~0 5) (<= 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; {97709#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:00,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {97709#(and (<= main_~z~0 6) (<= 6 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; {97716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:00,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {97716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {97716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:00,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {97716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {97716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:00,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {97716#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {97696#false} is VALID [2022-04-28 10:14:00,928 INFO L272 TraceCheckUtils]: 33: Hoare triple {97696#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {97696#false} is VALID [2022-04-28 10:14:00,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {97696#false} ~cond := #in~cond; {97696#false} is VALID [2022-04-28 10:14:00,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {97696#false} assume 0 == ~cond; {97696#false} is VALID [2022-04-28 10:14:00,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {97696#false} assume !false; {97696#false} is VALID [2022-04-28 10:14:00,928 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:00,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:00,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692968985] [2022-04-28 10:14:00,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692968985] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:00,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687373691] [2022-04-28 10:14:00,929 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:00,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:00,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:00,930 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:14:00,931 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:14:01,075 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:14:01,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:01,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 10:14:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:01,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:01,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {97695#true} call ULTIMATE.init(); {97695#true} is VALID [2022-04-28 10:14:01,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {97695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {97695#true} is VALID [2022-04-28 10:14:01,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {97695#true} assume true; {97695#true} is VALID [2022-04-28 10:14:01,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97695#true} {97695#true} #83#return; {97695#true} is VALID [2022-04-28 10:14:01,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {97695#true} call #t~ret15 := main(); {97695#true} is VALID [2022-04-28 10:14:01,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {97695#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97695#true} is VALID [2022-04-28 10:14:01,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {97695#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:01,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97743#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:01,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {97743#(< 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; {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:01,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:01,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:01,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:14:01,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:01,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:01,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:01,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:14:01,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:01,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:01,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:01,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97743#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:01,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {97743#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:01,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {97696#false} is VALID [2022-04-28 10:14:01,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {97696#false} assume !(~z~0 % 4294967296 > 0); {97696#false} is VALID [2022-04-28 10:14:01,377 INFO L272 TraceCheckUtils]: 33: Hoare triple {97696#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {97696#false} is VALID [2022-04-28 10:14:01,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {97696#false} ~cond := #in~cond; {97696#false} is VALID [2022-04-28 10:14:01,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {97696#false} assume 0 == ~cond; {97696#false} is VALID [2022-04-28 10:14:01,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {97696#false} assume !false; {97696#false} is VALID [2022-04-28 10:14:01,377 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:14:01,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:01,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {97696#false} assume !false; {97696#false} is VALID [2022-04-28 10:14:01,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {97696#false} assume 0 == ~cond; {97696#false} is VALID [2022-04-28 10:14:01,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {97696#false} ~cond := #in~cond; {97696#false} is VALID [2022-04-28 10:14:01,507 INFO L272 TraceCheckUtils]: 33: Hoare triple {97696#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {97696#false} is VALID [2022-04-28 10:14:01,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {97696#false} assume !(~z~0 % 4294967296 > 0); {97696#false} is VALID [2022-04-28 10:14:01,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {97696#false} is VALID [2022-04-28 10:14:01,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {97791#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97791#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:01,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {97743#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:01,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97743#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:01,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:01,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:01,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:01,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:14:01,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:01,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:01,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97763#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:01,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97759#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:14:01,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97755#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:01,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97751#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:01,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {97743#(< 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; {97747#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:01,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97743#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:01,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {97695#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {97739#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:01,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {97695#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97695#true} is VALID [2022-04-28 10:14:01,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {97695#true} call #t~ret15 := main(); {97695#true} is VALID [2022-04-28 10:14:01,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97695#true} {97695#true} #83#return; {97695#true} is VALID [2022-04-28 10:14:01,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {97695#true} assume true; {97695#true} is VALID [2022-04-28 10:14:01,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {97695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {97695#true} is VALID [2022-04-28 10:14:01,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {97695#true} call ULTIMATE.init(); {97695#true} is VALID [2022-04-28 10:14:01,519 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:14:01,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687373691] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:01,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:01,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-28 10:14:01,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:01,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291782340] [2022-04-28 10:14:01,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291782340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:01,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:01,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:14:01,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708672797] [2022-04-28 10:14:01,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:01,520 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 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:14:01,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:01,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call 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:01,545 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:14:01,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:14:01,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:01,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:14:01,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:14:01,546 INFO L87 Difference]: Start difference. First operand 359 states and 477 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call 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:14,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:14,006 INFO L93 Difference]: Finished difference Result 541 states and 753 transitions. [2022-04-28 10:14:14,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-04-28 10:14:14,006 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 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:14:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call 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:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 292 transitions. [2022-04-28 10:14:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call 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:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 292 transitions. [2022-04-28 10:14:14,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 292 transitions. [2022-04-28 10:14:14,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:14,260 INFO L225 Difference]: With dead ends: 541 [2022-04-28 10:14:14,260 INFO L226 Difference]: Without dead ends: 525 [2022-04-28 10:14:14,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3103 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=575, Invalid=10981, Unknown=0, NotChecked=0, Total=11556 [2022-04-28 10:14:14,261 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 105 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2823 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 3137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 2823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:14,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 128 Invalid, 3137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 2823 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 10:14:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-04-28 10:14:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 369. [2022-04-28 10:14:15,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:15,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 525 states. Second operand has 369 states, 364 states have (on average 1.3269230769230769) internal successors, (483), 364 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call 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:15,976 INFO L74 IsIncluded]: Start isIncluded. First operand 525 states. Second operand has 369 states, 364 states have (on average 1.3269230769230769) internal successors, (483), 364 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call 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:15,976 INFO L87 Difference]: Start difference. First operand 525 states. Second operand has 369 states, 364 states have (on average 1.3269230769230769) internal successors, (483), 364 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call 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:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:15,985 INFO L93 Difference]: Finished difference Result 525 states and 662 transitions. [2022-04-28 10:14:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 662 transitions. [2022-04-28 10:14:15,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:15,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:15,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 369 states, 364 states have (on average 1.3269230769230769) internal successors, (483), 364 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 525 states. [2022-04-28 10:14:15,986 INFO L87 Difference]: Start difference. First operand has 369 states, 364 states have (on average 1.3269230769230769) internal successors, (483), 364 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 525 states. [2022-04-28 10:14:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:15,995 INFO L93 Difference]: Finished difference Result 525 states and 662 transitions. [2022-04-28 10:14:15,995 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 662 transitions. [2022-04-28 10:14:15,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:15,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:15,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:15,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 364 states have (on average 1.3269230769230769) internal successors, (483), 364 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call 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:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 487 transitions. [2022-04-28 10:14:16,002 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 487 transitions. Word has length 37 [2022-04-28 10:14:16,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:16,002 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 487 transitions. [2022-04-28 10:14:16,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call 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:16,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 369 states and 487 transitions. [2022-04-28 10:14:17,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:17,879 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 487 transitions. [2022-04-28 10:14:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:14:17,879 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:17,879 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:17,906 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:14:18,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:18,080 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:18,080 INFO L85 PathProgramCache]: Analyzing trace with hash -424995377, now seen corresponding path program 41 times [2022-04-28 10:14:18,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:18,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [741554108] [2022-04-28 10:14:18,082 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:18,082 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash -424995377, now seen corresponding path program 42 times [2022-04-28 10:14:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:18,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76141632] [2022-04-28 10:14:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:18,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:18,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {101005#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {100977#true} is VALID [2022-04-28 10:14:18,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {100977#true} assume true; {100977#true} is VALID [2022-04-28 10:14:18,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100977#true} {100977#true} #83#return; {100977#true} is VALID [2022-04-28 10:14:18,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {100977#true} call ULTIMATE.init(); {101005#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:18,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {101005#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {100977#true} is VALID [2022-04-28 10:14:18,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {100977#true} assume true; {100977#true} is VALID [2022-04-28 10:14:18,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100977#true} {100977#true} #83#return; {100977#true} is VALID [2022-04-28 10:14:18,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {100977#true} call #t~ret15 := main(); {100977#true} is VALID [2022-04-28 10:14:18,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {100977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {100982#(= main_~y~0 0)} is VALID [2022-04-28 10:14:18,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {100982#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100983#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:18,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {100983#(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; {100984#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:18,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {100984#(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; {100985#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:18,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {100985#(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; {100986#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:18,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {100986#(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; {100987#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:18,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {100987#(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; {100988#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:18,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {100988#(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; {100989#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:18,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {100989#(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; {100990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:18,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {100990#(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; {100991#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:18,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {100991#(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; {100992#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:18,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {100992#(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; {100993#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:18,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {100993#(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; {100994#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:18,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {100994#(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; {100995#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:18,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {100995#(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; {100996#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:18,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {100996#(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; {100997#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:18,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {100997#(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; {100998#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:18,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {100998#(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; {100999#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:14:18,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {100999#(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; {101000#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:14:18,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {101000#(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; {101001#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:14:18,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {101001#(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; {101002#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:14:18,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {101002#(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; {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:14:18,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:14:18,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {101004#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} is VALID [2022-04-28 10:14:18,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {101004#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {100978#false} is VALID [2022-04-28 10:14:18,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {100978#false} assume !(~y~0 % 4294967296 > 0); {100978#false} is VALID [2022-04-28 10:14:18,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {100978#false} assume !(~x~0 % 4294967296 > 0); {100978#false} is VALID [2022-04-28 10:14:18,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {100978#false} assume !(~z~0 % 4294967296 > 0); {100978#false} is VALID [2022-04-28 10:14:18,525 INFO L272 TraceCheckUtils]: 33: Hoare triple {100978#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {100978#false} is VALID [2022-04-28 10:14:18,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {100978#false} ~cond := #in~cond; {100978#false} is VALID [2022-04-28 10:14:18,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {100978#false} assume 0 == ~cond; {100978#false} is VALID [2022-04-28 10:14:18,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {100978#false} assume !false; {100978#false} is VALID [2022-04-28 10:14:18,526 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:14:18,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:18,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76141632] [2022-04-28 10:14:18,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76141632] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:18,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617261970] [2022-04-28 10:14:18,526 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:18,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:18,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:18,527 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:14:18,531 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:14:19,312 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 10:14:19,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:19,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:14:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:19,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:19,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {100977#true} call ULTIMATE.init(); {100977#true} is VALID [2022-04-28 10:14:19,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {100977#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {100977#true} is VALID [2022-04-28 10:14:19,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {100977#true} assume true; {100977#true} is VALID [2022-04-28 10:14:19,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100977#true} {100977#true} #83#return; {100977#true} is VALID [2022-04-28 10:14:19,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {100977#true} call #t~ret15 := main(); {100977#true} is VALID [2022-04-28 10:14:19,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {100977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {100982#(= main_~y~0 0)} is VALID [2022-04-28 10:14:19,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {100982#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {100983#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:19,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {100983#(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; {100984#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:19,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {100984#(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; {100985#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:19,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {100985#(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; {100986#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:19,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {100986#(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; {100987#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:19,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {100987#(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; {100988#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:19,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {100988#(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; {100989#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:19,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {100989#(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; {100990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:19,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {100990#(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; {100991#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:19,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {100991#(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; {100992#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:19,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {100992#(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; {100993#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:19,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {100993#(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; {100994#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:19,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {100994#(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; {100995#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:19,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {100995#(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; {100996#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:19,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {100996#(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; {100997#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:19,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {100997#(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; {100998#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:19,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {100998#(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; {100999#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:14:19,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {100999#(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; {101000#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:14:19,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {101000#(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; {101001#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:14:19,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {101001#(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; {101002#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:14:19,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {101002#(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; {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:14:19,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:14:19,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {101003#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:14:19,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:14:19,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:14:19,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:14:19,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {101093#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {100978#false} is VALID [2022-04-28 10:14:19,658 INFO L272 TraceCheckUtils]: 33: Hoare triple {100978#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {100978#false} is VALID [2022-04-28 10:14:19,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {100978#false} ~cond := #in~cond; {100978#false} is VALID [2022-04-28 10:14:19,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {100978#false} assume 0 == ~cond; {100978#false} is VALID [2022-04-28 10:14:19,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {100978#false} assume !false; {100978#false} is VALID [2022-04-28 10:14:19,659 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:14:19,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:20,527 INFO L290 TraceCheckUtils]: 36: Hoare triple {100978#false} assume !false; {100978#false} is VALID [2022-04-28 10:14:20,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {100978#false} assume 0 == ~cond; {100978#false} is VALID [2022-04-28 10:14:20,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {100978#false} ~cond := #in~cond; {100978#false} is VALID [2022-04-28 10:14:20,528 INFO L272 TraceCheckUtils]: 33: Hoare triple {100978#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {100978#false} is VALID [2022-04-28 10:14:20,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {101130#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {100978#false} is VALID [2022-04-28 10:14:20,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {101130#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {101130#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:20,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {101130#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {101130#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:20,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {101130#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {101130#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:20,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {101143#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {101130#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:20,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {101143#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {101143#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:20,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {101150#(< 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; {101143#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:20,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {101154#(< 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; {101150#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:20,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {101158#(< 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; {101154#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:20,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {101162#(< 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; {101158#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:20,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {101166#(< 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; {101162#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:20,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {101170#(< 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; {101166#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:20,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {101174#(< 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; {101170#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:20,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {101178#(< 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; {101174#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:20,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {101182#(< 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; {101178#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:14:20,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {101186#(< 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; {101182#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:14:20,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {101190#(< 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; {101186#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:14:20,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {101194#(< 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; {101190#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:14:20,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {101198#(< 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; {101194#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:14:20,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {101202#(< 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; {101198#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:14:20,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {101206#(< 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; {101202#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:14:20,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {101210#(< 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; {101206#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:14:20,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {101214#(< 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; {101210#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:14:20,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {101218#(< 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; {101214#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:14:20,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {101222#(< 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; {101218#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:14:20,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {101226#(< 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; {101222#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:20,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {101230#(< 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; {101226#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:14:20,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {100977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {101230#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:14:20,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {100977#true} call #t~ret15 := main(); {100977#true} is VALID [2022-04-28 10:14:20,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100977#true} {100977#true} #83#return; {100977#true} is VALID [2022-04-28 10:14:20,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {100977#true} assume true; {100977#true} is VALID [2022-04-28 10:14:20,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {100977#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {100977#true} is VALID [2022-04-28 10:14:20,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {100977#true} call ULTIMATE.init(); {100977#true} is VALID [2022-04-28 10:14:20,544 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:14:20,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617261970] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:20,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:20,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:14:20,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:20,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [741554108] [2022-04-28 10:14:20,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [741554108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:20,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:20,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:14:20,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244898566] [2022-04-28 10:14:20,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:20,548 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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:14:20,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:20,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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:14:20,569 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:14:20,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:14:20,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:20,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:14:20,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=1867, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:14:20,570 INFO L87 Difference]: Start difference. First operand 369 states and 487 transitions. Second operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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:14:40,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:40,081 INFO L93 Difference]: Finished difference Result 869 states and 1242 transitions. [2022-04-28 10:14:40,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:14:40,081 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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:14:40,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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:14:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 277 transitions. [2022-04-28 10:14:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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:14:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 277 transitions. [2022-04-28 10:14:40,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 277 transitions. [2022-04-28 10:14:40,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:40,325 INFO L225 Difference]: With dead ends: 869 [2022-04-28 10:14:40,325 INFO L226 Difference]: Without dead ends: 832 [2022-04-28 10:14:40,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1183, Invalid=4073, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 10:14:40,326 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 239 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5084 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 5208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 5084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:40,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 264 Invalid, 5208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 5084 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-28 10:14:40,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-04-28 10:14:42,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 384. [2022-04-28 10:14:42,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:42,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 832 states. Second operand has 384 states, 379 states have (on average 1.3324538258575198) internal successors, (505), 379 states have internal predecessors, (505), 3 states have call successors, (3), 3 states have call 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:42,097 INFO L74 IsIncluded]: Start isIncluded. First operand 832 states. Second operand has 384 states, 379 states have (on average 1.3324538258575198) internal successors, (505), 379 states have internal predecessors, (505), 3 states have call successors, (3), 3 states have call 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:42,098 INFO L87 Difference]: Start difference. First operand 832 states. Second operand has 384 states, 379 states have (on average 1.3324538258575198) internal successors, (505), 379 states have internal predecessors, (505), 3 states have call successors, (3), 3 states have call 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:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:42,120 INFO L93 Difference]: Finished difference Result 832 states and 1062 transitions. [2022-04-28 10:14:42,120 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1062 transitions. [2022-04-28 10:14:42,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:42,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:42,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 384 states, 379 states have (on average 1.3324538258575198) internal successors, (505), 379 states have internal predecessors, (505), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 832 states. [2022-04-28 10:14:42,122 INFO L87 Difference]: Start difference. First operand has 384 states, 379 states have (on average 1.3324538258575198) internal successors, (505), 379 states have internal predecessors, (505), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 832 states. [2022-04-28 10:14:42,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:42,145 INFO L93 Difference]: Finished difference Result 832 states and 1062 transitions. [2022-04-28 10:14:42,145 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1062 transitions. [2022-04-28 10:14:42,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:42,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:42,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:42,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 379 states have (on average 1.3324538258575198) internal successors, (505), 379 states have internal predecessors, (505), 3 states have call successors, (3), 3 states have call 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:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 509 transitions. [2022-04-28 10:14:42,155 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 509 transitions. Word has length 37 [2022-04-28 10:14:42,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:42,155 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 509 transitions. [2022-04-28 10:14:42,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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:14:42,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 384 states and 509 transitions. [2022-04-28 10:14:44,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 509 edges. 509 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 509 transitions. [2022-04-28 10:14:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:14:44,208 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:44,208 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:44,214 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:14:44,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:44,408 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:44,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:44,408 INFO L85 PathProgramCache]: Analyzing trace with hash -770615006, now seen corresponding path program 25 times [2022-04-28 10:14:44,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:44,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [376864884] [2022-04-28 10:14:44,410 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:44,411 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:44,411 INFO L85 PathProgramCache]: Analyzing trace with hash -770615006, now seen corresponding path program 26 times [2022-04-28 10:14:44,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:44,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196976218] [2022-04-28 10:14:44,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:44,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:44,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:44,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {105485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {105467#true} is VALID [2022-04-28 10:14:44,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {105467#true} assume true; {105467#true} is VALID [2022-04-28 10:14:44,587 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {105467#true} {105467#true} #83#return; {105467#true} is VALID [2022-04-28 10:14:44,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {105467#true} call ULTIMATE.init(); {105485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:44,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {105485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {105467#true} is VALID [2022-04-28 10:14:44,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {105467#true} assume true; {105467#true} is VALID [2022-04-28 10:14:44,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105467#true} {105467#true} #83#return; {105467#true} is VALID [2022-04-28 10:14:44,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {105467#true} call #t~ret15 := main(); {105467#true} is VALID [2022-04-28 10:14:44,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {105467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {105472#(= main_~y~0 0)} is VALID [2022-04-28 10:14:44,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {105472#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105473#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:44,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {105473#(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; {105474#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:44,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {105474#(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; {105475#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:44,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {105475#(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; {105476#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:44,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {105476#(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; {105477#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:44,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {105477#(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; {105478#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:44,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {105478#(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; {105479#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:44,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {105479#(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; {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:44,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:44,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {105481#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:44,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {105481#(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; {105482#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:44,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {105482#(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; {105483#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:44,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {105483#(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; {105484#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:44,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {105484#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {105468#false} is VALID [2022-04-28 10:14:44,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-28 10:14:44,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-28 10:14:44,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-28 10:14:44,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-28 10:14:44,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-28 10:14:44,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-28 10:14:44,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-28 10:14:44,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {105468#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105468#false} is VALID [2022-04-28 10:14:44,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {105468#false} assume !(~y~0 % 4294967296 > 0); {105468#false} is VALID [2022-04-28 10:14:44,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {105468#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105468#false} is VALID [2022-04-28 10:14:44,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {105468#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105468#false} is VALID [2022-04-28 10:14:44,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {105468#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105468#false} is VALID [2022-04-28 10:14:44,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {105468#false} assume !(~x~0 % 4294967296 > 0); {105468#false} is VALID [2022-04-28 10:14:44,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {105468#false} assume !(~z~0 % 4294967296 > 0); {105468#false} is VALID [2022-04-28 10:14:44,595 INFO L272 TraceCheckUtils]: 34: Hoare triple {105468#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {105468#false} is VALID [2022-04-28 10:14:44,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {105468#false} ~cond := #in~cond; {105468#false} is VALID [2022-04-28 10:14:44,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {105468#false} assume 0 == ~cond; {105468#false} is VALID [2022-04-28 10:14:44,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {105468#false} assume !false; {105468#false} is VALID [2022-04-28 10:14:44,595 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:14:44,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:44,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196976218] [2022-04-28 10:14:44,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196976218] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:44,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066327363] [2022-04-28 10:14:44,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:44,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:44,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:44,597 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:14:44,597 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:14:44,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:44,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:44,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:14:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:44,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:45,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {105467#true} call ULTIMATE.init(); {105467#true} is VALID [2022-04-28 10:14:45,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {105467#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {105467#true} is VALID [2022-04-28 10:14:45,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {105467#true} assume true; {105467#true} is VALID [2022-04-28 10:14:45,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105467#true} {105467#true} #83#return; {105467#true} is VALID [2022-04-28 10:14:45,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {105467#true} call #t~ret15 := main(); {105467#true} is VALID [2022-04-28 10:14:45,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {105467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {105472#(= main_~y~0 0)} is VALID [2022-04-28 10:14:45,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {105472#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {105473#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:45,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {105473#(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; {105474#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:45,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {105474#(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; {105475#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:45,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {105475#(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; {105476#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:45,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {105476#(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; {105477#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:45,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {105477#(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; {105478#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:45,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {105478#(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; {105479#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:45,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {105479#(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; {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:45,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:45,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {105480#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {105481#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:45,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {105481#(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; {105482#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:45,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {105482#(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; {105483#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:45,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {105483#(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; {105543#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:14:45,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {105543#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {105543#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:14:45,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {105543#(and (<= main_~z~0 5) (<= 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; {105483#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:45,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {105483#(and (<= main_~z~0 6) (<= 6 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; {105482#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:45,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {105482#(and (<= main_~z~0 7) (<= 7 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; {105481#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:45,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {105481#(and (<= 8 main_~z~0) (<= main_~z~0 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; {105559#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:45,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {105559#(and (<= 9 main_~z~0) (<= 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; {105563#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:45,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {105563#(and (<= main_~z~0 10) (<= 10 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; {105567#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:14:45,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {105567#(and (<= main_~z~0 11) (<= 11 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; {105571#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:14:45,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {105571#(and (<= main_~z~0 12) (<= 12 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; {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:14:45,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~y~0 % 4294967296 > 0); {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:14:45,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:14:45,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:14:45,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:14:45,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~x~0 % 4294967296 > 0); {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:14:45,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {105575#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {105468#false} is VALID [2022-04-28 10:14:45,066 INFO L272 TraceCheckUtils]: 34: Hoare triple {105468#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {105468#false} is VALID [2022-04-28 10:14:45,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {105468#false} ~cond := #in~cond; {105468#false} is VALID [2022-04-28 10:14:45,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {105468#false} assume 0 == ~cond; {105468#false} is VALID [2022-04-28 10:14:45,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {105468#false} assume !false; {105468#false} is VALID [2022-04-28 10:14:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:14:45,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:45,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {105468#false} assume !false; {105468#false} is VALID [2022-04-28 10:14:45,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {105468#false} assume 0 == ~cond; {105468#false} is VALID [2022-04-28 10:14:45,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {105468#false} ~cond := #in~cond; {105468#false} is VALID [2022-04-28 10:14:45,574 INFO L272 TraceCheckUtils]: 34: Hoare triple {105468#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {105468#false} is VALID [2022-04-28 10:14:45,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {105618#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {105468#false} is VALID [2022-04-28 10:14:45,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {105618#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {105618#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:45,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {105618#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105618#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:45,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {105618#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105618#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:45,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {105618#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {105618#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:45,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {105618#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {105618#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:45,576 INFO L290 TraceCheckUtils]: 27: Hoare triple {105637#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105618#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:45,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {105641#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105637#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:14:45,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {105645#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105641#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:14:45,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {105649#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105645#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:14:45,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {105653#(< 0 (mod (+ 5 main_~z~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; {105649#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 10:14:45,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {105657#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105653#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:45,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {105661#(< 0 (mod (+ 7 main_~z~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; {105657#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:14:45,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {105665#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {105661#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:45,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {105665#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !(~z~0 % 4294967296 > 0); {105665#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 10:14:45,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {105661#(< 0 (mod (+ 7 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; {105665#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 10:14:45,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {105657#(< 0 (mod (+ main_~z~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; {105661#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:45,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {105653#(< 0 (mod (+ 5 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; {105657#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:14:45,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {105681#(< 0 (mod (+ 5 main_~y~0) 4294967296))} ~z~0 := ~y~0; {105653#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:45,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {105681#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {105681#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:45,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {105688#(< 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; {105681#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:45,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {105692#(< 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; {105688#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:45,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {105696#(< 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; {105692#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:45,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {105700#(< 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; {105696#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:14:45,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {105704#(< 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; {105700#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:14:45,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {105708#(< 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; {105704#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:14:45,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {105712#(< 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; {105708#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:14:45,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {105716#(< 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; {105712#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:14:45,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {105467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {105716#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:14:45,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {105467#true} call #t~ret15 := main(); {105467#true} is VALID [2022-04-28 10:14:45,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105467#true} {105467#true} #83#return; {105467#true} is VALID [2022-04-28 10:14:45,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {105467#true} assume true; {105467#true} is VALID [2022-04-28 10:14:45,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {105467#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {105467#true} is VALID [2022-04-28 10:14:45,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {105467#true} call ULTIMATE.init(); {105467#true} is VALID [2022-04-28 10:14:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:14:45,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066327363] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:45,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:45,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 20] total 40 [2022-04-28 10:14:45,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:45,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [376864884] [2022-04-28 10:14:45,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [376864884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:45,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:45,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:14:45,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99032473] [2022-04-28 10:14:45,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:45,591 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 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:45,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:45,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:45,609 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:45,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:14:45,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:45,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:14:45,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1311, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:14:45,610 INFO L87 Difference]: Start difference. First operand 384 states and 509 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:53,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:53,272 INFO L93 Difference]: Finished difference Result 561 states and 726 transitions. [2022-04-28 10:14:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:14:53,272 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 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:53,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 121 transitions. [2022-04-28 10:14:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 121 transitions. [2022-04-28 10:14:53,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 121 transitions. [2022-04-28 10:14:53,365 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:14:53,376 INFO L225 Difference]: With dead ends: 561 [2022-04-28 10:14:53,377 INFO L226 Difference]: Without dead ends: 542 [2022-04-28 10:14:53,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=586, Invalid=2836, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 10:14:53,377 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 87 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:53,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 110 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:14:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-04-28 10:14:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 384. [2022-04-28 10:14:55,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:55,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 542 states. Second operand has 384 states, 379 states have (on average 1.3298153034300793) internal successors, (504), 379 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call 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,296 INFO L74 IsIncluded]: Start isIncluded. First operand 542 states. Second operand has 384 states, 379 states have (on average 1.3298153034300793) internal successors, (504), 379 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call 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,296 INFO L87 Difference]: Start difference. First operand 542 states. Second operand has 384 states, 379 states have (on average 1.3298153034300793) internal successors, (504), 379 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call 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,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:55,305 INFO L93 Difference]: Finished difference Result 542 states and 706 transitions. [2022-04-28 10:14:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 706 transitions. [2022-04-28 10:14:55,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:55,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:55,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 384 states, 379 states have (on average 1.3298153034300793) internal successors, (504), 379 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 542 states. [2022-04-28 10:14:55,306 INFO L87 Difference]: Start difference. First operand has 384 states, 379 states have (on average 1.3298153034300793) internal successors, (504), 379 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 542 states. [2022-04-28 10:14:55,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:55,316 INFO L93 Difference]: Finished difference Result 542 states and 706 transitions. [2022-04-28 10:14:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 706 transitions. [2022-04-28 10:14:55,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:55,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:55,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:55,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 379 states have (on average 1.3298153034300793) internal successors, (504), 379 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call 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,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 508 transitions. [2022-04-28 10:14:55,323 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 508 transitions. Word has length 38 [2022-04-28 10:14:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:55,323 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 508 transitions. [2022-04-28 10:14:55,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 384 states and 508 transitions. [2022-04-28 10:14:57,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:57,422 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 508 transitions. [2022-04-28 10:14:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:14:57,422 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:57,422 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:57,439 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:14:57,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:57,623 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:57,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:57,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1924187202, now seen corresponding path program 25 times [2022-04-28 10:14:57,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:57,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [442263771] [2022-04-28 10:14:57,625 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:57,625 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:57,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1924187202, now seen corresponding path program 26 times [2022-04-28 10:14:57,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:57,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516151857] [2022-04-28 10:14:57,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:57,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:57,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:57,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {108770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108749#true} is VALID [2022-04-28 10:14:57,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {108749#true} assume true; {108749#true} is VALID [2022-04-28 10:14:57,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {108749#true} {108749#true} #83#return; {108749#true} is VALID [2022-04-28 10:14:57,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {108749#true} call ULTIMATE.init(); {108770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:57,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {108770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108749#true} is VALID [2022-04-28 10:14:57,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {108749#true} assume true; {108749#true} is VALID [2022-04-28 10:14:57,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108749#true} {108749#true} #83#return; {108749#true} is VALID [2022-04-28 10:14:57,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {108749#true} call #t~ret15 := main(); {108749#true} is VALID [2022-04-28 10:14:57,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {108749#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108754#(= main_~y~0 0)} is VALID [2022-04-28 10:14:57,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {108754#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108755#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:57,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {108755#(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; {108756#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:57,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {108756#(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; {108757#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:57,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {108757#(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; {108758#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:57,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {108758#(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; {108759#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:57,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {108759#(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; {108760#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:57,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {108760#(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; {108761#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:57,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {108761#(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; {108762#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:57,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {108762#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {108762#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:57,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {108762#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {108763#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:57,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {108763#(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; {108764#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:57,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {108764#(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; {108765#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:57,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {108765#(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; {108766#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:14:57,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {108766#(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; {108767#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:14:57,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {108767#(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; {108768#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:14:57,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {108768#(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; {108769#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:14:57,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {108769#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-28 10:14:57,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-28 10:14:57,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-28 10:14:57,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-28 10:14:57,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-28 10:14:57,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-28 10:14:57,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-28 10:14:57,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-28 10:14:57,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {108750#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108750#false} is VALID [2022-04-28 10:14:57,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {108750#false} assume !(~y~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-28 10:14:57,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {108750#false} assume !(~x~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-28 10:14:57,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {108750#false} assume !(~z~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-28 10:14:57,901 INFO L272 TraceCheckUtils]: 34: Hoare triple {108750#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {108750#false} is VALID [2022-04-28 10:14:57,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {108750#false} ~cond := #in~cond; {108750#false} is VALID [2022-04-28 10:14:57,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {108750#false} assume 0 == ~cond; {108750#false} is VALID [2022-04-28 10:14:57,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {108750#false} assume !false; {108750#false} is VALID [2022-04-28 10:14:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:14:57,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:57,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516151857] [2022-04-28 10:14:57,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516151857] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:57,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715402993] [2022-04-28 10:14:57,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:57,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:57,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:57,903 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:14:57,903 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:14:57,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:57,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:57,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:14:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:57,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:58,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {108749#true} call ULTIMATE.init(); {108749#true} is VALID [2022-04-28 10:14:58,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {108749#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108749#true} is VALID [2022-04-28 10:14:58,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {108749#true} assume true; {108749#true} is VALID [2022-04-28 10:14:58,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108749#true} {108749#true} #83#return; {108749#true} is VALID [2022-04-28 10:14:58,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {108749#true} call #t~ret15 := main(); {108749#true} is VALID [2022-04-28 10:14:58,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {108749#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108749#true} is VALID [2022-04-28 10:14:58,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {108749#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108749#true} is VALID [2022-04-28 10:14:58,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {108749#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108749#true} is VALID [2022-04-28 10:14:58,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {108749#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:58,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:58,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {108802#(< 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; {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:58,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:58,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:58,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:14:58,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:14:58,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:14:58,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:58,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:58,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:58,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:58,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {108802#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:58,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-28 10:14:58,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {108750#false} assume !(~z~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-28 10:14:58,212 INFO L272 TraceCheckUtils]: 34: Hoare triple {108750#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {108750#false} is VALID [2022-04-28 10:14:58,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {108750#false} ~cond := #in~cond; {108750#false} is VALID [2022-04-28 10:14:58,212 INFO L290 TraceCheckUtils]: 36: Hoare triple {108750#false} assume 0 == ~cond; {108750#false} is VALID [2022-04-28 10:14:58,212 INFO L290 TraceCheckUtils]: 37: Hoare triple {108750#false} assume !false; {108750#false} is VALID [2022-04-28 10:14:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 10:14:58,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:58,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {108750#false} assume !false; {108750#false} is VALID [2022-04-28 10:14:58,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {108750#false} assume 0 == ~cond; {108750#false} is VALID [2022-04-28 10:14:58,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {108750#false} ~cond := #in~cond; {108750#false} is VALID [2022-04-28 10:14:58,343 INFO L272 TraceCheckUtils]: 34: Hoare triple {108750#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {108750#false} is VALID [2022-04-28 10:14:58,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {108750#false} assume !(~z~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-28 10:14:58,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {108750#false} is VALID [2022-04-28 10:14:58,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {108843#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108843#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:14:58,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {108802#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:58,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:58,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:58,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:58,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:58,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:14:58,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:14:58,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:14:58,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:14:58,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:14:58,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {108802#(< 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; {108806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:14:58,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:14:58,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {108749#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:14:58,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {108749#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108749#true} is VALID [2022-04-28 10:14:58,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {108749#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108749#true} is VALID [2022-04-28 10:14:58,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {108749#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108749#true} is VALID [2022-04-28 10:14:58,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {108749#true} call #t~ret15 := main(); {108749#true} is VALID [2022-04-28 10:14:58,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108749#true} {108749#true} #83#return; {108749#true} is VALID [2022-04-28 10:14:58,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {108749#true} assume true; {108749#true} is VALID [2022-04-28 10:14:58,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {108749#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108749#true} is VALID [2022-04-28 10:14:58,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {108749#true} call ULTIMATE.init(); {108749#true} is VALID [2022-04-28 10:14:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 10:14:58,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715402993] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:58,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:58,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 9] total 26 [2022-04-28 10:14:58,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:58,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [442263771] [2022-04-28 10:14:58,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [442263771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:58,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:58,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:14:58,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207077031] [2022-04-28 10:14:58,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:58,359 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 38 [2022-04-28 10:14:58,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:58,359 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:14:58,383 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:14:58,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:14:58,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:58,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:14:58,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:14:58,384 INFO L87 Difference]: Start difference. First operand 384 states and 508 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:15:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:06,435 INFO L93 Difference]: Finished difference Result 559 states and 725 transitions. [2022-04-28 10:15:06,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 10:15:06,435 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 38 [2022-04-28 10:15:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:06,435 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:15:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 135 transitions. [2022-04-28 10:15:06,436 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:15:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 135 transitions. [2022-04-28 10:15:06,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 135 transitions. [2022-04-28 10:15:06,541 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:15:06,552 INFO L225 Difference]: With dead ends: 559 [2022-04-28 10:15:06,552 INFO L226 Difference]: Without dead ends: 515 [2022-04-28 10:15:06,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=259, Invalid=2933, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 10:15:06,553 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 85 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:06,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 117 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:15:06,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-28 10:15:08,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 385. [2022-04-28 10:15:08,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:08,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 385 states, 380 states have (on average 1.3236842105263158) internal successors, (503), 380 states have internal predecessors, (503), 3 states have call successors, (3), 3 states have call 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:08,358 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 385 states, 380 states have (on average 1.3236842105263158) internal successors, (503), 380 states have internal predecessors, (503), 3 states have call successors, (3), 3 states have call 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:08,358 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 385 states, 380 states have (on average 1.3236842105263158) internal successors, (503), 380 states have internal predecessors, (503), 3 states have call successors, (3), 3 states have call 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:08,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:08,366 INFO L93 Difference]: Finished difference Result 515 states and 677 transitions. [2022-04-28 10:15:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 677 transitions. [2022-04-28 10:15:08,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:08,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:08,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 380 states have (on average 1.3236842105263158) internal successors, (503), 380 states have internal predecessors, (503), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-28 10:15:08,367 INFO L87 Difference]: Start difference. First operand has 385 states, 380 states have (on average 1.3236842105263158) internal successors, (503), 380 states have internal predecessors, (503), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-28 10:15:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:08,376 INFO L93 Difference]: Finished difference Result 515 states and 677 transitions. [2022-04-28 10:15:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 677 transitions. [2022-04-28 10:15:08,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:08,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:08,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:08,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 380 states have (on average 1.3236842105263158) internal successors, (503), 380 states have internal predecessors, (503), 3 states have call successors, (3), 3 states have call 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:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 507 transitions. [2022-04-28 10:15:08,384 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 507 transitions. Word has length 38 [2022-04-28 10:15:08,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:08,384 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 507 transitions. [2022-04-28 10:15:08,384 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:15:08,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 507 transitions. [2022-04-28 10:15:10,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 507 edges. 507 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 507 transitions. [2022-04-28 10:15:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:15:10,704 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:10,704 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:10,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-04-28 10:15:10,907 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,SelfDestructingSolverStorable62 [2022-04-28 10:15:10,907 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:10,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1286566156, now seen corresponding path program 27 times [2022-04-28 10:15:10,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:10,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [973162661] [2022-04-28 10:15:10,917 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:10,917 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:10,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1286566156, now seen corresponding path program 28 times [2022-04-28 10:15:10,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:10,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089841543] [2022-04-28 10:15:10,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:10,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:11,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:11,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {112003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111985#true} is VALID [2022-04-28 10:15:11,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {111985#true} assume true; {111985#true} is VALID [2022-04-28 10:15:11,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111985#true} {111985#true} #83#return; {111985#true} is VALID [2022-04-28 10:15:11,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {111985#true} call ULTIMATE.init(); {112003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:11,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {112003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111985#true} is VALID [2022-04-28 10:15:11,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {111985#true} assume true; {111985#true} is VALID [2022-04-28 10:15:11,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111985#true} {111985#true} #83#return; {111985#true} is VALID [2022-04-28 10:15:11,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {111985#true} call #t~ret15 := main(); {111985#true} is VALID [2022-04-28 10:15:11,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {111985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111990#(= main_~y~0 0)} is VALID [2022-04-28 10:15:11,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {111990#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:11,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {111991#(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; {111992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:11,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {111992#(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; {111993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:11,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {111993#(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; {111994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:11,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {111994#(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; {111995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:11,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {111995#(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; {111996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:11,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {111996#(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; {111997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:11,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {111997#(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; {111998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:11,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {111998#(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; {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:11,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:11,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {112000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:11,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {112000#(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; {112001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:11,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {112001#(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; {112002#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:15:11,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {112002#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-28 10:15:11,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {111986#false} assume !(~y~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-28 10:15:11,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {111986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {111986#false} is VALID [2022-04-28 10:15:11,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {111986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {111986#false} is VALID [2022-04-28 10:15:11,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {111986#false} assume !(~x~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-28 10:15:11,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {111986#false} assume !(~z~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-28 10:15:11,138 INFO L272 TraceCheckUtils]: 34: Hoare triple {111986#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {111986#false} is VALID [2022-04-28 10:15:11,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {111986#false} ~cond := #in~cond; {111986#false} is VALID [2022-04-28 10:15:11,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {111986#false} assume 0 == ~cond; {111986#false} is VALID [2022-04-28 10:15:11,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {111986#false} assume !false; {111986#false} is VALID [2022-04-28 10:15:11,138 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:15:11,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:11,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089841543] [2022-04-28 10:15:11,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089841543] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:11,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353127776] [2022-04-28 10:15:11,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:15:11,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:11,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:11,148 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:15:11,149 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:15:11,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:15:11,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:11,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:15:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:11,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:11,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {111985#true} call ULTIMATE.init(); {111985#true} is VALID [2022-04-28 10:15:11,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {111985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111985#true} is VALID [2022-04-28 10:15:11,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {111985#true} assume true; {111985#true} is VALID [2022-04-28 10:15:11,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111985#true} {111985#true} #83#return; {111985#true} is VALID [2022-04-28 10:15:11,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {111985#true} call #t~ret15 := main(); {111985#true} is VALID [2022-04-28 10:15:11,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {111985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111990#(= main_~y~0 0)} is VALID [2022-04-28 10:15:11,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {111990#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:11,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {111991#(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; {111992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:11,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {111992#(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; {111993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:11,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {111993#(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; {111994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:11,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {111994#(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; {111995#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:11,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {111995#(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; {111996#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:11,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {111996#(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; {111997#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:11,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {111997#(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; {111998#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:11,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {111998#(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; {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:11,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:11,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {111999#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {112000#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:11,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {112000#(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; {112001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:11,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {112001#(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; {112061#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:11,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {112061#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {111986#false} assume !(~y~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {111986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {111986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {111986#false} assume !(~x~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {111986#false} assume !(~z~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L272 TraceCheckUtils]: 34: Hoare triple {111986#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {111986#false} ~cond := #in~cond; {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {111986#false} assume 0 == ~cond; {111986#false} is VALID [2022-04-28 10:15:11,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {111986#false} assume !false; {111986#false} is VALID [2022-04-28 10:15:11,448 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:15:11,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:11,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {111986#false} assume !false; {111986#false} is VALID [2022-04-28 10:15:11,770 INFO L290 TraceCheckUtils]: 36: Hoare triple {111986#false} assume 0 == ~cond; {111986#false} is VALID [2022-04-28 10:15:11,770 INFO L290 TraceCheckUtils]: 35: Hoare triple {111986#false} ~cond := #in~cond; {111986#false} is VALID [2022-04-28 10:15:11,770 INFO L272 TraceCheckUtils]: 34: Hoare triple {111986#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {111986#false} is VALID [2022-04-28 10:15:11,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {111986#false} assume !(~z~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-28 10:15:11,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {111986#false} assume !(~x~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-28 10:15:11,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {111986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {111986#false} is VALID [2022-04-28 10:15:11,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {111986#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {111986#false} is VALID [2022-04-28 10:15:11,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {111986#false} assume !(~y~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-28 10:15:11,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {111986#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {111986#false} is VALID [2022-04-28 10:15:11,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {112173#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {111986#false} is VALID [2022-04-28 10:15:11,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {112177#(< 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; {112173#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:11,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {112181#(< 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; {112177#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:11,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {112185#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {112181#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:11,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {112185#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {112185#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:11,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {112192#(< 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; {112185#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:11,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {112196#(< 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; {112192#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:11,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {112200#(< 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; {112196#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:11,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {112204#(< 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; {112200#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:15:11,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {112208#(< 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; {112204#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:15:11,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {112212#(< 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; {112208#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:15:11,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {112216#(< 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; {112212#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:15:11,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {112220#(< 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; {112216#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:11,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {112224#(< 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; {112220#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:15:11,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {111985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {112224#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:11,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {111985#true} call #t~ret15 := main(); {111985#true} is VALID [2022-04-28 10:15:11,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111985#true} {111985#true} #83#return; {111985#true} is VALID [2022-04-28 10:15:11,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {111985#true} assume true; {111985#true} is VALID [2022-04-28 10:15:11,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {111985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111985#true} is VALID [2022-04-28 10:15:11,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {111985#true} call ULTIMATE.init(); {111985#true} is VALID [2022-04-28 10:15:11,779 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:15:11,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353127776] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:11,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:11,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:15:11,780 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:11,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [973162661] [2022-04-28 10:15:11,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [973162661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:11,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:11,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:15:11,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205769501] [2022-04-28 10:15:11,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:11,780 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 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:15:11,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:11,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:11,798 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:11,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:15:11,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:11,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:15:11,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:15:11,799 INFO L87 Difference]: Start difference. First operand 385 states and 507 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:20,193 INFO L93 Difference]: Finished difference Result 593 states and 760 transitions. [2022-04-28 10:15:20,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:15:20,193 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 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:15:20,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 128 transitions. [2022-04-28 10:15:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 128 transitions. [2022-04-28 10:15:20,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 128 transitions. [2022-04-28 10:15:20,296 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:15:20,310 INFO L225 Difference]: With dead ends: 593 [2022-04-28 10:15:20,310 INFO L226 Difference]: Without dead ends: 574 [2022-04-28 10:15:20,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=426, Invalid=1644, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:15:20,311 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 97 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:20,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 125 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:15:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-04-28 10:15:22,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 385. [2022-04-28 10:15:22,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:22,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 574 states. Second operand has 385 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 380 states have internal predecessors, (502), 3 states have call successors, (3), 3 states have call 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:22,102 INFO L74 IsIncluded]: Start isIncluded. First operand 574 states. Second operand has 385 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 380 states have internal predecessors, (502), 3 states have call successors, (3), 3 states have call 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:22,102 INFO L87 Difference]: Start difference. First operand 574 states. Second operand has 385 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 380 states have internal predecessors, (502), 3 states have call successors, (3), 3 states have call 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:22,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:22,113 INFO L93 Difference]: Finished difference Result 574 states and 740 transitions. [2022-04-28 10:15:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 740 transitions. [2022-04-28 10:15:22,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:22,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:22,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 380 states have internal predecessors, (502), 3 states have call successors, (3), 3 states 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:22,114 INFO L87 Difference]: Start difference. First operand has 385 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 380 states have internal predecessors, (502), 3 states have call successors, (3), 3 states 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:22,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:22,124 INFO L93 Difference]: Finished difference Result 574 states and 740 transitions. [2022-04-28 10:15:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 740 transitions. [2022-04-28 10:15:22,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:22,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:22,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:22,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 380 states have internal predecessors, (502), 3 states have call successors, (3), 3 states have call 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:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 506 transitions. [2022-04-28 10:15:22,133 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 506 transitions. Word has length 38 [2022-04-28 10:15:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:22,133 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 506 transitions. [2022-04-28 10:15:22,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:22,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 506 transitions. [2022-04-28 10:15:24,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 506 edges. 506 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:24,864 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 506 transitions. [2022-04-28 10:15:24,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:15:24,865 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:24,865 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:24,881 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:15:25,065 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,SelfDestructingSolverStorable63 [2022-04-28 10:15:25,065 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:25,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:25,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1857399070, now seen corresponding path program 29 times [2022-04-28 10:15:25,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:25,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1776130244] [2022-04-28 10:15:25,068 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:25,068 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:25,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1857399070, now seen corresponding path program 30 times [2022-04-28 10:15:25,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:25,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455516945] [2022-04-28 10:15:25,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:25,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:25,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:25,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {115399#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115381#true} is VALID [2022-04-28 10:15:25,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {115381#true} assume true; {115381#true} is VALID [2022-04-28 10:15:25,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115381#true} {115381#true} #83#return; {115381#true} is VALID [2022-04-28 10:15:25,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {115381#true} call ULTIMATE.init(); {115399#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:25,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {115399#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115381#true} is VALID [2022-04-28 10:15:25,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {115381#true} assume true; {115381#true} is VALID [2022-04-28 10:15:25,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115381#true} {115381#true} #83#return; {115381#true} is VALID [2022-04-28 10:15:25,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {115381#true} call #t~ret15 := main(); {115381#true} is VALID [2022-04-28 10:15:25,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {115381#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115386#(= main_~y~0 0)} is VALID [2022-04-28 10:15:25,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {115386#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115387#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:25,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {115387#(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; {115388#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:25,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {115388#(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; {115389#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:25,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {115389#(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; {115390#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:25,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {115390#(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; {115391#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:25,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {115391#(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; {115392#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:25,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {115392#(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; {115393#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:25,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {115393#(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; {115394#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:25,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {115394#(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; {115395#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:25,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {115395#(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; {115396#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:25,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {115396#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {115396#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:25,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {115396#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {115397#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:15:25,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {115397#(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; {115398#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:15:25,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {115398#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-28 10:15:25,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {115382#false} assume !(~y~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-28 10:15:25,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {115382#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {115382#false} is VALID [2022-04-28 10:15:25,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {115382#false} assume !(~x~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-28 10:15:25,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {115382#false} assume !(~z~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-28 10:15:25,289 INFO L272 TraceCheckUtils]: 34: Hoare triple {115382#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {115382#false} is VALID [2022-04-28 10:15:25,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {115382#false} ~cond := #in~cond; {115382#false} is VALID [2022-04-28 10:15:25,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {115382#false} assume 0 == ~cond; {115382#false} is VALID [2022-04-28 10:15:25,289 INFO L290 TraceCheckUtils]: 37: Hoare triple {115382#false} assume !false; {115382#false} is VALID [2022-04-28 10:15:25,289 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:15:25,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:25,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455516945] [2022-04-28 10:15:25,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455516945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:25,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594903189] [2022-04-28 10:15:25,290 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:15:25,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:25,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:25,291 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:15:25,292 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:15:25,375 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:15:25,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:25,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:15:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:25,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:25,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {115381#true} call ULTIMATE.init(); {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {115381#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {115381#true} assume true; {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115381#true} {115381#true} #83#return; {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {115381#true} call #t~ret15 := main(); {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {115381#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {115381#true} assume !(~x~0 % 4294967296 > 0); {115381#true} is VALID [2022-04-28 10:15:25,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {115381#true} ~z~0 := ~y~0; {115454#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:15:25,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {115454#(= 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; {115458#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:15:25,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {115458#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {115462#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:15:25,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {115462#(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; {115466#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:15:25,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {115466#(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; {115382#false} is VALID [2022-04-28 10:15:25,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {115382#false} assume !(~y~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-28 10:15:25,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {115382#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {115382#false} is VALID [2022-04-28 10:15:25,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {115382#false} assume !(~x~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-28 10:15:25,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {115382#false} assume !(~z~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-28 10:15:25,522 INFO L272 TraceCheckUtils]: 34: Hoare triple {115382#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {115382#false} is VALID [2022-04-28 10:15:25,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {115382#false} ~cond := #in~cond; {115382#false} is VALID [2022-04-28 10:15:25,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {115382#false} assume 0 == ~cond; {115382#false} is VALID [2022-04-28 10:15:25,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {115382#false} assume !false; {115382#false} is VALID [2022-04-28 10:15:25,522 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-28 10:15:25,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:25,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {115382#false} assume !false; {115382#false} is VALID [2022-04-28 10:15:25,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {115382#false} assume 0 == ~cond; {115382#false} is VALID [2022-04-28 10:15:25,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {115382#false} ~cond := #in~cond; {115382#false} is VALID [2022-04-28 10:15:25,653 INFO L272 TraceCheckUtils]: 34: Hoare triple {115382#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {115382#false} is VALID [2022-04-28 10:15:25,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {115382#false} assume !(~z~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-28 10:15:25,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {115382#false} assume !(~x~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-28 10:15:25,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {115382#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {115382#false} is VALID [2022-04-28 10:15:25,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {115382#false} assume !(~y~0 % 4294967296 > 0); {115382#false} is VALID [2022-04-28 10:15:25,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {115382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115382#false} is VALID [2022-04-28 10:15:25,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {115466#(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; {115382#false} is VALID [2022-04-28 10:15:25,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {115462#(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; {115466#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:15:25,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {115572#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {115462#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:15:25,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {115576#(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; {115572#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:15:25,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {115381#true} ~z~0 := ~y~0; {115576#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:15:25,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {115381#true} assume !(~x~0 % 4294967296 > 0); {115381#true} is VALID [2022-04-28 10:15:25,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {115381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115381#true} is VALID [2022-04-28 10:15:25,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {115381#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115381#true} is VALID [2022-04-28 10:15:25,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {115381#true} call #t~ret15 := main(); {115381#true} is VALID [2022-04-28 10:15:25,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115381#true} {115381#true} #83#return; {115381#true} is VALID [2022-04-28 10:15:25,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {115381#true} assume true; {115381#true} is VALID [2022-04-28 10:15:25,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {115381#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115381#true} is VALID [2022-04-28 10:15:25,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {115381#true} call ULTIMATE.init(); {115381#true} is VALID [2022-04-28 10:15:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-28 10:15:25,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594903189] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:25,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:25,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 22 [2022-04-28 10:15:25,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:25,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1776130244] [2022-04-28 10:15:25,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1776130244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:25,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:25,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:15:25,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984997223] [2022-04-28 10:15:25,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:25,660 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 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:15:25,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:25,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:25,683 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:25,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:15:25,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:25,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:15:25,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:15:25,685 INFO L87 Difference]: Start difference. First operand 385 states and 506 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:34,974 INFO L93 Difference]: Finished difference Result 625 states and 796 transitions. [2022-04-28 10:15:34,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:15:34,974 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 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:15:34,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 136 transitions. [2022-04-28 10:15:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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:34,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 136 transitions. [2022-04-28 10:15:34,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 136 transitions. [2022-04-28 10:15:35,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:35,099 INFO L225 Difference]: With dead ends: 625 [2022-04-28 10:15:35,099 INFO L226 Difference]: Without dead ends: 606 [2022-04-28 10:15:35,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:15:35,100 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 111 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:35,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 138 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:15:35,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-04-28 10:15:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 385. [2022-04-28 10:15:36,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:36,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 606 states. Second operand has 385 states, 380 states have (on average 1.318421052631579) internal successors, (501), 380 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call 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,921 INFO L74 IsIncluded]: Start isIncluded. First operand 606 states. Second operand has 385 states, 380 states have (on average 1.318421052631579) internal successors, (501), 380 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call 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,921 INFO L87 Difference]: Start difference. First operand 606 states. Second operand has 385 states, 380 states have (on average 1.318421052631579) internal successors, (501), 380 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call 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,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:36,932 INFO L93 Difference]: Finished difference Result 606 states and 776 transitions. [2022-04-28 10:15:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 776 transitions. [2022-04-28 10:15:36,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:36,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:36,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 380 states have (on average 1.318421052631579) internal successors, (501), 380 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 606 states. [2022-04-28 10:15:36,933 INFO L87 Difference]: Start difference. First operand has 385 states, 380 states have (on average 1.318421052631579) internal successors, (501), 380 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 606 states. [2022-04-28 10:15:36,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:36,944 INFO L93 Difference]: Finished difference Result 606 states and 776 transitions. [2022-04-28 10:15:36,945 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 776 transitions. [2022-04-28 10:15:36,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:36,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:36,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:36,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 380 states have (on average 1.318421052631579) internal successors, (501), 380 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call 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,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 505 transitions. [2022-04-28 10:15:36,952 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 505 transitions. Word has length 38 [2022-04-28 10:15:36,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:36,953 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 505 transitions. [2022-04-28 10:15:36,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call 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,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 505 transitions. [2022-04-28 10:15:39,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 505 edges. 505 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 505 transitions. [2022-04-28 10:15:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:15:39,011 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:39,011 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:39,038 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:15:39,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:39,212 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:39,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:39,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2143864094, now seen corresponding path program 43 times [2022-04-28 10:15:39,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:39,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [998740270] [2022-04-28 10:15:39,215 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:39,215 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:39,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2143864094, now seen corresponding path program 44 times [2022-04-28 10:15:39,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:39,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99470936] [2022-04-28 10:15:39,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:39,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:39,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:39,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {118922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118893#true} is VALID [2022-04-28 10:15:39,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {118893#true} assume true; {118893#true} is VALID [2022-04-28 10:15:39,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118893#true} {118893#true} #83#return; {118893#true} is VALID [2022-04-28 10:15:39,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {118893#true} call ULTIMATE.init(); {118922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:39,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {118922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118893#true} is VALID [2022-04-28 10:15:39,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {118893#true} assume true; {118893#true} is VALID [2022-04-28 10:15:39,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118893#true} {118893#true} #83#return; {118893#true} is VALID [2022-04-28 10:15:39,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {118893#true} call #t~ret15 := main(); {118893#true} is VALID [2022-04-28 10:15:39,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {118893#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118898#(= main_~y~0 0)} is VALID [2022-04-28 10:15:39,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {118898#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118899#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:39,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {118899#(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; {118900#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:39,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {118900#(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; {118901#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:39,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {118901#(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; {118902#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:39,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {118902#(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; {118903#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:39,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {118903#(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; {118904#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:39,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {118904#(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; {118905#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:39,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {118905#(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; {118906#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:39,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {118906#(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; {118907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:39,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {118907#(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; {118908#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:39,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {118908#(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; {118909#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:39,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {118909#(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; {118910#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:39,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {118910#(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; {118911#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:39,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {118911#(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; {118912#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:39,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {118912#(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; {118913#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:39,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {118913#(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; {118914#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:15:39,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {118914#(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; {118915#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:15:39,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {118915#(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; {118916#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:15:39,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {118916#(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; {118917#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:15:39,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {118917#(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; {118918#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:15:39,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {118918#(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; {118919#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:15:39,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {118919#(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; {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:39,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:39,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {118921#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:15:39,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {118921#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {118894#false} is VALID [2022-04-28 10:15:39,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {118894#false} assume !(~y~0 % 4294967296 > 0); {118894#false} is VALID [2022-04-28 10:15:39,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {118894#false} assume !(~x~0 % 4294967296 > 0); {118894#false} is VALID [2022-04-28 10:15:39,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {118894#false} assume !(~z~0 % 4294967296 > 0); {118894#false} is VALID [2022-04-28 10:15:39,767 INFO L272 TraceCheckUtils]: 34: Hoare triple {118894#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {118894#false} is VALID [2022-04-28 10:15:39,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {118894#false} ~cond := #in~cond; {118894#false} is VALID [2022-04-28 10:15:39,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {118894#false} assume 0 == ~cond; {118894#false} is VALID [2022-04-28 10:15:39,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {118894#false} assume !false; {118894#false} is VALID [2022-04-28 10:15:39,767 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:15:39,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:39,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99470936] [2022-04-28 10:15:39,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99470936] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:39,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068816607] [2022-04-28 10:15:39,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:15:39,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:39,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:39,777 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:15:39,778 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:15:39,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:15:39,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:39,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 10:15:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:39,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:40,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {118893#true} call ULTIMATE.init(); {118893#true} is VALID [2022-04-28 10:15:40,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {118893#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118893#true} is VALID [2022-04-28 10:15:40,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {118893#true} assume true; {118893#true} is VALID [2022-04-28 10:15:40,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118893#true} {118893#true} #83#return; {118893#true} is VALID [2022-04-28 10:15:40,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {118893#true} call #t~ret15 := main(); {118893#true} is VALID [2022-04-28 10:15:40,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {118893#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118898#(= main_~y~0 0)} is VALID [2022-04-28 10:15:40,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {118898#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118899#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:40,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {118899#(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; {118900#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:40,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {118900#(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; {118901#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:40,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {118901#(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; {118902#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:40,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {118902#(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; {118903#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:40,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {118903#(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; {118904#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:40,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {118904#(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; {118905#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:40,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {118905#(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; {118906#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:40,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {118906#(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; {118907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:40,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {118907#(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; {118908#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:40,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {118908#(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; {118909#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:40,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {118909#(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; {118910#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:40,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {118910#(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; {118911#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:40,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {118911#(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; {118912#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:40,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {118912#(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; {118913#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:40,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {118913#(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; {118914#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:15:40,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {118914#(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; {118915#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:15:40,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {118915#(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; {118916#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:15:40,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {118916#(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; {118917#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:15:40,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {118917#(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; {118918#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:15:40,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {118918#(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; {118919#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:15:40,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {118919#(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; {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:40,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:40,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {118920#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:15:40,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:15:40,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~y~0 % 4294967296 > 0); {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:15:40,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~x~0 % 4294967296 > 0); {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:15:40,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {119013#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {118894#false} is VALID [2022-04-28 10:15:40,210 INFO L272 TraceCheckUtils]: 34: Hoare triple {118894#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {118894#false} is VALID [2022-04-28 10:15:40,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {118894#false} ~cond := #in~cond; {118894#false} is VALID [2022-04-28 10:15:40,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {118894#false} assume 0 == ~cond; {118894#false} is VALID [2022-04-28 10:15:40,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {118894#false} assume !false; {118894#false} is VALID [2022-04-28 10:15:40,210 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:15:40,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:41,136 INFO L290 TraceCheckUtils]: 37: Hoare triple {118894#false} assume !false; {118894#false} is VALID [2022-04-28 10:15:41,136 INFO L290 TraceCheckUtils]: 36: Hoare triple {118894#false} assume 0 == ~cond; {118894#false} is VALID [2022-04-28 10:15:41,136 INFO L290 TraceCheckUtils]: 35: Hoare triple {118894#false} ~cond := #in~cond; {118894#false} is VALID [2022-04-28 10:15:41,136 INFO L272 TraceCheckUtils]: 34: Hoare triple {118894#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {118894#false} is VALID [2022-04-28 10:15:41,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {119050#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {118894#false} is VALID [2022-04-28 10:15:41,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {119050#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {119050#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:41,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {119050#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {119050#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:41,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {119050#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {119050#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:41,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {119063#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {119050#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:41,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {119063#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {119063#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:41,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {119070#(< 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; {119063#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:41,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {119074#(< 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; {119070#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:15:41,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {119078#(< 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; {119074#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:15:41,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {119082#(< 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; {119078#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:15:41,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {119086#(< 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; {119082#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:15:41,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {119090#(< 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; {119086#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:41,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {119094#(< 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; {119090#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:15:41,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {119098#(< 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; {119094#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:41,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {119102#(< 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; {119098#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:15:41,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {119106#(< 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; {119102#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:15:41,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {119110#(< 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; {119106#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:15:41,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {119114#(< 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; {119110#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:15:41,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {119118#(< 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; {119114#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:15:41,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {119122#(< 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; {119118#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:15:41,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {119126#(< 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; {119122#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:15:41,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {119130#(< 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; {119126#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:15:41,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {119134#(< 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; {119130#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:15:41,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {119138#(< 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; {119134#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:15:41,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {119142#(< 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; {119138#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:15:41,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {119146#(< 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; {119142#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:41,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {119150#(< 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; {119146#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:15:41,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {119154#(< 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; {119150#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:15:41,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {118893#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {119154#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:15:41,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {118893#true} call #t~ret15 := main(); {118893#true} is VALID [2022-04-28 10:15:41,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118893#true} {118893#true} #83#return; {118893#true} is VALID [2022-04-28 10:15:41,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {118893#true} assume true; {118893#true} is VALID [2022-04-28 10:15:41,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {118893#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118893#true} is VALID [2022-04-28 10:15:41,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {118893#true} call ULTIMATE.init(); {118893#true} is VALID [2022-04-28 10:15:41,152 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:15:41,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068816607] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:41,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:41,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-28 10:15:41,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:41,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [998740270] [2022-04-28 10:15:41,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [998740270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:41,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:41,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:15:41,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224816] [2022-04-28 10:15:41,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:41,153 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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:15:41,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:41,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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:15:41,175 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:15:41,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:15:41,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:41,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:15:41,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=2020, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:15:41,176 INFO L87 Difference]: Start difference. First operand 385 states and 505 transitions. Second operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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:16:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:02,262 INFO L93 Difference]: Finished difference Result 905 states and 1291 transitions. [2022-04-28 10:16:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:16:02,262 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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:16:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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:16:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 289 transitions. [2022-04-28 10:16:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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:16:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 289 transitions. [2022-04-28 10:16:02,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 289 transitions. [2022-04-28 10:16:02,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:02,564 INFO L225 Difference]: With dead ends: 905 [2022-04-28 10:16:02,565 INFO L226 Difference]: Without dead ends: 868 [2022-04-28 10:16:02,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1282, Invalid=4418, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 10:16:02,566 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 249 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5569 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 5696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 5569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:02,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 276 Invalid, 5696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 5569 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 10:16:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-04-28 10:16:04,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 400. [2022-04-28 10:16:04,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:04,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 868 states. Second operand has 400 states, 395 states have (on average 1.3240506329113924) internal successors, (523), 395 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call 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:04,658 INFO L74 IsIncluded]: Start isIncluded. First operand 868 states. Second operand has 400 states, 395 states have (on average 1.3240506329113924) internal successors, (523), 395 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call 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:04,658 INFO L87 Difference]: Start difference. First operand 868 states. Second operand has 400 states, 395 states have (on average 1.3240506329113924) internal successors, (523), 395 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call 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:04,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:04,688 INFO L93 Difference]: Finished difference Result 868 states and 1105 transitions. [2022-04-28 10:16:04,688 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1105 transitions. [2022-04-28 10:16:04,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:04,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:04,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 395 states have (on average 1.3240506329113924) internal successors, (523), 395 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 868 states. [2022-04-28 10:16:04,690 INFO L87 Difference]: Start difference. First operand has 400 states, 395 states have (on average 1.3240506329113924) internal successors, (523), 395 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 868 states. [2022-04-28 10:16:04,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:04,720 INFO L93 Difference]: Finished difference Result 868 states and 1105 transitions. [2022-04-28 10:16:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1105 transitions. [2022-04-28 10:16:04,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:04,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:04,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:04,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.3240506329113924) internal successors, (523), 395 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call 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:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 527 transitions. [2022-04-28 10:16:04,731 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 527 transitions. Word has length 38 [2022-04-28 10:16:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:04,731 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 527 transitions. [2022-04-28 10:16:04,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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:16:04,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 527 transitions. [2022-04-28 10:16:07,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 527 edges. 527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:07,048 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 527 transitions. [2022-04-28 10:16:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:16:07,048 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:07,048 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:07,065 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:16:07,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:07,249 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:07,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:07,249 INFO L85 PathProgramCache]: Analyzing trace with hash -2045746160, now seen corresponding path program 27 times [2022-04-28 10:16:07,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:07,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1289844864] [2022-04-28 10:16:07,251 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:07,251 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:07,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2045746160, now seen corresponding path program 28 times [2022-04-28 10:16:07,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:07,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272808371] [2022-04-28 10:16:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:07,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:07,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:07,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {123591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123569#true} is VALID [2022-04-28 10:16:07,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {123569#true} assume true; {123569#true} is VALID [2022-04-28 10:16:07,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123569#true} {123569#true} #83#return; {123569#true} is VALID [2022-04-28 10:16:07,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {123569#true} call ULTIMATE.init(); {123591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:07,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {123591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123569#true} is VALID [2022-04-28 10:16:07,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {123569#true} assume true; {123569#true} is VALID [2022-04-28 10:16:07,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123569#true} {123569#true} #83#return; {123569#true} is VALID [2022-04-28 10:16:07,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {123569#true} call #t~ret15 := main(); {123569#true} is VALID [2022-04-28 10:16:07,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {123569#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123574#(= main_~y~0 0)} is VALID [2022-04-28 10:16:07,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {123574#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123575#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:07,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {123575#(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; {123576#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:07,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {123576#(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; {123577#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:07,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {123577#(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; {123578#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:07,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {123578#(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; {123579#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:07,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {123579#(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; {123580#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:07,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {123580#(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; {123581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:07,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {123581#(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; {123582#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:07,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {123582#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {123582#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:07,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {123582#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {123583#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:07,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {123583#(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; {123584#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:07,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {123584#(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; {123585#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:16:07,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {123585#(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; {123586#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:16:07,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {123586#(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; {123587#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:16:07,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {123587#(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; {123588#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:16:07,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {123588#(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; {123589#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:16:07,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {123589#(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; {123590#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:16:07,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {123590#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {123570#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {123570#false} assume !(~y~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L290 TraceCheckUtils]: 33: Hoare triple {123570#false} assume !(~x~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {123570#false} assume !(~z~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L272 TraceCheckUtils]: 35: Hoare triple {123570#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {123570#false} ~cond := #in~cond; {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {123570#false} assume 0 == ~cond; {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {123570#false} assume !false; {123570#false} is VALID [2022-04-28 10:16:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:16:07,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:07,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272808371] [2022-04-28 10:16:07,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272808371] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:07,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320122529] [2022-04-28 10:16:07,536 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:16:07,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:07,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:07,537 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:16:07,537 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:16:07,591 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:16:07,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:07,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 10:16:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:07,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:07,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {123569#true} call ULTIMATE.init(); {123569#true} is VALID [2022-04-28 10:16:07,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {123569#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123569#true} is VALID [2022-04-28 10:16:07,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {123569#true} assume true; {123569#true} is VALID [2022-04-28 10:16:07,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123569#true} {123569#true} #83#return; {123569#true} is VALID [2022-04-28 10:16:07,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {123569#true} call #t~ret15 := main(); {123569#true} is VALID [2022-04-28 10:16:07,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {123569#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123569#true} is VALID [2022-04-28 10:16:07,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {123569#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123569#true} is VALID [2022-04-28 10:16:07,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {123569#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:16:07,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123620#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:16:07,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {123620#(< 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; {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:16:07,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:16:07,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:07,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:16:07,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:07,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:07,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:07,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:16:07,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:07,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:16:07,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:16:07,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123620#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:16:07,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {123620#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:16:07,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:07,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:07,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:07,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:07,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:07,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:07,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:07,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:07,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:07,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:07,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:07,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-28 10:16:07,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {123570#false} assume !(~z~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-28 10:16:07,885 INFO L272 TraceCheckUtils]: 35: Hoare triple {123570#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {123570#false} is VALID [2022-04-28 10:16:07,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {123570#false} ~cond := #in~cond; {123570#false} is VALID [2022-04-28 10:16:07,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {123570#false} assume 0 == ~cond; {123570#false} is VALID [2022-04-28 10:16:07,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {123570#false} assume !false; {123570#false} is VALID [2022-04-28 10:16:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:16:07,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:08,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {123570#false} assume !false; {123570#false} is VALID [2022-04-28 10:16:08,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {123570#false} assume 0 == ~cond; {123570#false} is VALID [2022-04-28 10:16:08,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {123570#false} ~cond := #in~cond; {123570#false} is VALID [2022-04-28 10:16:08,017 INFO L272 TraceCheckUtils]: 35: Hoare triple {123570#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {123570#false} is VALID [2022-04-28 10:16:08,017 INFO L290 TraceCheckUtils]: 34: Hoare triple {123570#false} assume !(~z~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-28 10:16:08,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {123570#false} is VALID [2022-04-28 10:16:08,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:08,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:08,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:08,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:08,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:08,019 INFO L290 TraceCheckUtils]: 27: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:08,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:08,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:08,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:08,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {123668#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:08,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123668#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:16:08,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {123620#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:16:08,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123620#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:16:08,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:16:08,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:16:08,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:08,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:16:08,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:08,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:08,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123640#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:08,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123636#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:16:08,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123632#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:16:08,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123628#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:16:08,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {123620#(< 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; {123624#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:16:08,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123620#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:16:08,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {123569#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123616#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:16:08,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {123569#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123569#true} is VALID [2022-04-28 10:16:08,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {123569#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123569#true} is VALID [2022-04-28 10:16:08,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {123569#true} call #t~ret15 := main(); {123569#true} is VALID [2022-04-28 10:16:08,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123569#true} {123569#true} #83#return; {123569#true} is VALID [2022-04-28 10:16:08,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {123569#true} assume true; {123569#true} is VALID [2022-04-28 10:16:08,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {123569#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123569#true} is VALID [2022-04-28 10:16:08,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {123569#true} call ULTIMATE.init(); {123569#true} is VALID [2022-04-28 10:16:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:16:08,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320122529] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:08,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:08,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-28 10:16:08,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:08,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1289844864] [2022-04-28 10:16:08,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1289844864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:08,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:08,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:16:08,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083903930] [2022-04-28 10:16:08,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:08,032 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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:16:08,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:08,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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:16:08,052 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:16:08,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:16:08,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:08,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:16:08,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:16:08,052 INFO L87 Difference]: Start difference. First operand 400 states and 527 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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:16:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:17,213 INFO L93 Difference]: Finished difference Result 547 states and 716 transitions. [2022-04-28 10:16:17,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 10:16:17,213 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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:16:17,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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:16:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 134 transitions. [2022-04-28 10:16:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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:16:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 134 transitions. [2022-04-28 10:16:17,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 134 transitions. [2022-04-28 10:16:17,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:17,328 INFO L225 Difference]: With dead ends: 547 [2022-04-28 10:16:17,328 INFO L226 Difference]: Without dead ends: 531 [2022-04-28 10:16:17,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=296, Invalid=3610, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 10:16:17,329 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 84 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:17,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 142 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 10:16:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-04-28 10:16:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 401. [2022-04-28 10:16:19,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:19,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 531 states. Second operand has 401 states, 396 states have (on average 1.3232323232323233) internal successors, (524), 396 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call 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:19,207 INFO L74 IsIncluded]: Start isIncluded. First operand 531 states. Second operand has 401 states, 396 states have (on average 1.3232323232323233) internal successors, (524), 396 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call 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:19,207 INFO L87 Difference]: Start difference. First operand 531 states. Second operand has 401 states, 396 states have (on average 1.3232323232323233) internal successors, (524), 396 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call 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:19,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:19,217 INFO L93 Difference]: Finished difference Result 531 states and 698 transitions. [2022-04-28 10:16:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 698 transitions. [2022-04-28 10:16:19,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:19,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:19,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 396 states have (on average 1.3232323232323233) internal successors, (524), 396 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 531 states. [2022-04-28 10:16:19,218 INFO L87 Difference]: Start difference. First operand has 401 states, 396 states have (on average 1.3232323232323233) internal successors, (524), 396 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 531 states. [2022-04-28 10:16:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:19,227 INFO L93 Difference]: Finished difference Result 531 states and 698 transitions. [2022-04-28 10:16:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 698 transitions. [2022-04-28 10:16:19,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:19,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:19,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:19,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.3232323232323233) internal successors, (524), 396 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call 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:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 528 transitions. [2022-04-28 10:16:19,235 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 528 transitions. Word has length 39 [2022-04-28 10:16:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:19,235 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 528 transitions. [2022-04-28 10:16:19,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 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:16:19,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 528 transitions. [2022-04-28 10:16:21,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 528 edges. 528 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 528 transitions. [2022-04-28 10:16:21,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:16:21,414 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:21,414 INFO L195 NwaCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:21,432 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:16:21,614 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,SelfDestructingSolverStorable66 [2022-04-28 10:16:21,615 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:21,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash 405780527, now seen corresponding path program 45 times [2022-04-28 10:16:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:21,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1444810433] [2022-04-28 10:16:21,618 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:21,618 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:21,618 INFO L85 PathProgramCache]: Analyzing trace with hash 405780527, now seen corresponding path program 46 times [2022-04-28 10:16:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:21,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038323307] [2022-04-28 10:16:21,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:21,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:22,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:22,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {126891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126861#true} is VALID [2022-04-28 10:16:22,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {126861#true} assume true; {126861#true} is VALID [2022-04-28 10:16:22,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {126861#true} {126861#true} #83#return; {126861#true} is VALID [2022-04-28 10:16:22,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {126861#true} call ULTIMATE.init(); {126891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:22,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {126891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126861#true} is VALID [2022-04-28 10:16:22,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {126861#true} assume true; {126861#true} is VALID [2022-04-28 10:16:22,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126861#true} {126861#true} #83#return; {126861#true} is VALID [2022-04-28 10:16:22,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {126861#true} call #t~ret15 := main(); {126861#true} is VALID [2022-04-28 10:16:22,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {126861#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126866#(= main_~y~0 0)} is VALID [2022-04-28 10:16:22,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {126866#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126867#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:22,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {126867#(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; {126868#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:22,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {126868#(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; {126869#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:22,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {126869#(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; {126870#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:22,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {126870#(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; {126871#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:22,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {126871#(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; {126872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:22,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {126872#(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; {126873#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:22,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {126873#(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; {126874#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:22,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {126874#(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; {126875#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:22,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {126875#(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; {126876#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:22,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {126876#(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; {126877#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:22,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {126877#(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; {126878#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:22,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {126878#(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; {126879#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:16:22,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {126879#(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; {126880#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:16:22,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {126880#(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; {126881#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:16:22,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {126881#(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; {126882#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:16:22,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {126882#(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; {126883#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:16:22,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {126883#(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; {126884#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:16:22,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {126884#(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; {126885#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:16:22,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {126885#(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; {126886#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:16:22,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {126886#(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; {126887#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:16:22,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {126887#(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; {126888#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:16:22,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {126888#(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; {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:16:22,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:16:22,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {126890#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} is VALID [2022-04-28 10:16:22,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {126890#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-28 10:16:22,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {126862#false} assume !(~y~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-28 10:16:22,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {126862#false} assume !(~x~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-28 10:16:22,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {126862#false} assume !(~z~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-28 10:16:22,081 INFO L272 TraceCheckUtils]: 35: Hoare triple {126862#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {126862#false} is VALID [2022-04-28 10:16:22,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {126862#false} ~cond := #in~cond; {126862#false} is VALID [2022-04-28 10:16:22,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {126862#false} assume 0 == ~cond; {126862#false} is VALID [2022-04-28 10:16:22,082 INFO L290 TraceCheckUtils]: 38: Hoare triple {126862#false} assume !false; {126862#false} is VALID [2022-04-28 10:16:22,082 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:16:22,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:22,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038323307] [2022-04-28 10:16:22,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038323307] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:22,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251467181] [2022-04-28 10:16:22,082 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:16:22,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:22,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:22,083 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:16:22,084 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:16:22,129 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:16:22,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:22,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 10:16:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:22,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:22,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {126861#true} call ULTIMATE.init(); {126861#true} is VALID [2022-04-28 10:16:22,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {126861#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126861#true} is VALID [2022-04-28 10:16:22,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {126861#true} assume true; {126861#true} is VALID [2022-04-28 10:16:22,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126861#true} {126861#true} #83#return; {126861#true} is VALID [2022-04-28 10:16:22,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {126861#true} call #t~ret15 := main(); {126861#true} is VALID [2022-04-28 10:16:22,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {126861#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126866#(= main_~y~0 0)} is VALID [2022-04-28 10:16:22,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {126866#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {126867#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:22,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {126867#(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; {126868#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:22,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {126868#(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; {126869#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:22,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {126869#(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; {126870#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:22,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {126870#(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; {126871#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:22,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {126871#(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; {126872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:22,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {126872#(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; {126873#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:22,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {126873#(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; {126874#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:22,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {126874#(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; {126875#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:22,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {126875#(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; {126876#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:22,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {126876#(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; {126877#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:22,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {126877#(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; {126878#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:22,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {126878#(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; {126879#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:16:22,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {126879#(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; {126880#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:16:22,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {126880#(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; {126881#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:16:22,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {126881#(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; {126882#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:16:22,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {126882#(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; {126883#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:16:22,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {126883#(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; {126884#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:16:22,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {126884#(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; {126885#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:16:22,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {126885#(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; {126886#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:16:22,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {126886#(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; {126887#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:16:22,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {126887#(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; {126888#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:16:22,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {126888#(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; {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:16:22,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:16:22,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {126889#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {126985#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-28 10:16:22,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {126985#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !(~z~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-28 10:16:22,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {126862#false} assume !(~y~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-28 10:16:22,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {126862#false} assume !(~x~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-28 10:16:22,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {126862#false} assume !(~z~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-28 10:16:22,510 INFO L272 TraceCheckUtils]: 35: Hoare triple {126862#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {126862#false} is VALID [2022-04-28 10:16:22,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {126862#false} ~cond := #in~cond; {126862#false} is VALID [2022-04-28 10:16:22,510 INFO L290 TraceCheckUtils]: 37: Hoare triple {126862#false} assume 0 == ~cond; {126862#false} is VALID [2022-04-28 10:16:22,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {126862#false} assume !false; {126862#false} is VALID [2022-04-28 10:16:22,510 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:16:22,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:23,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {126862#false} assume !false; {126862#false} is VALID [2022-04-28 10:16:23,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {126862#false} assume 0 == ~cond; {126862#false} is VALID [2022-04-28 10:16:23,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {126862#false} ~cond := #in~cond; {126862#false} is VALID [2022-04-28 10:16:23,500 INFO L272 TraceCheckUtils]: 35: Hoare triple {126862#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {126862#false} is VALID [2022-04-28 10:16:23,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {126862#false} assume !(~z~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-28 10:16:23,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {126862#false} assume !(~x~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-28 10:16:23,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {126862#false} assume !(~y~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-28 10:16:23,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {127031#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {126862#false} is VALID [2022-04-28 10:16:23,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {127035#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {127031#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:23,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {127035#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {127035#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:23,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {127042#(< 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; {127035#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:23,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {127046#(< 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; {127042#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:23,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {127050#(< 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; {127046#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:23,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {127054#(< 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; {127050#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:23,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {127058#(< 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; {127054#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:23,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {127062#(< 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; {127058#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:23,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {127066#(< 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; {127062#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:16:23,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {127070#(< 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; {127066#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:23,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {127074#(< 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; {127070#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:16:23,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {127078#(< 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; {127074#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:16:23,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {127082#(< 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; {127078#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:16:23,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {127086#(< 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; {127082#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:16:23,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {127090#(< 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; {127086#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:16:23,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {127094#(< 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; {127090#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:16:23,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {127098#(< 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; {127094#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:16:23,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {127102#(< 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; {127098#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:16:23,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {127106#(< 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; {127102#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:16:23,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {127110#(< 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; {127106#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:16:23,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {127114#(< 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; {127110#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:16:23,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {127118#(< 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; {127114#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:23,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {127122#(< 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; {127118#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:16:23,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {127126#(< 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; {127122#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:16:23,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {127130#(< 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; {127126#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:16:23,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {126861#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {127130#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:23,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {126861#true} call #t~ret15 := main(); {126861#true} is VALID [2022-04-28 10:16:23,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126861#true} {126861#true} #83#return; {126861#true} is VALID [2022-04-28 10:16:23,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {126861#true} assume true; {126861#true} is VALID [2022-04-28 10:16:23,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {126861#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {126861#true} is VALID [2022-04-28 10:16:23,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {126861#true} call ULTIMATE.init(); {126861#true} is VALID [2022-04-28 10:16:23,518 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:16:23,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251467181] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:23,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:23,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-28 10:16:23,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:23,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1444810433] [2022-04-28 10:16:23,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1444810433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:23,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:23,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 10:16:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431193783] [2022-04-28 10:16:23,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:23,519 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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:16:23,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:23,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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:16:23,543 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:16:23,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 10:16:23,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:23,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 10:16:23,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:16:23,544 INFO L87 Difference]: Start difference. First operand 401 states and 528 transitions. Second operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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:16:46,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:46,180 INFO L93 Difference]: Finished difference Result 941 states and 1345 transitions. [2022-04-28 10:16:46,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:16:46,180 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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:16:46,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:46,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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:16:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 301 transitions. [2022-04-28 10:16:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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:16:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 301 transitions. [2022-04-28 10:16:46,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 301 transitions. [2022-04-28 10:16:46,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:46,449 INFO L225 Difference]: With dead ends: 941 [2022-04-28 10:16:46,449 INFO L226 Difference]: Without dead ends: 904 [2022-04-28 10:16:46,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1385, Invalid=4777, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 10:16:46,450 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 265 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 6074 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 6210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 6074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:46,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 288 Invalid, 6210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 6074 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-28 10:16:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2022-04-28 10:16:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 416. [2022-04-28 10:16:48,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:48,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 904 states. Second operand has 416 states, 411 states have (on average 1.3284671532846715) internal successors, (546), 411 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:16:48,394 INFO L74 IsIncluded]: Start isIncluded. First operand 904 states. Second operand has 416 states, 411 states have (on average 1.3284671532846715) internal successors, (546), 411 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:16:48,395 INFO L87 Difference]: Start difference. First operand 904 states. Second operand has 416 states, 411 states have (on average 1.3284671532846715) internal successors, (546), 411 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:16:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:48,419 INFO L93 Difference]: Finished difference Result 904 states and 1153 transitions. [2022-04-28 10:16:48,419 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1153 transitions. [2022-04-28 10:16:48,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:48,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:48,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 416 states, 411 states have (on average 1.3284671532846715) internal successors, (546), 411 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 904 states. [2022-04-28 10:16:48,420 INFO L87 Difference]: Start difference. First operand has 416 states, 411 states have (on average 1.3284671532846715) internal successors, (546), 411 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 904 states. [2022-04-28 10:16:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:48,445 INFO L93 Difference]: Finished difference Result 904 states and 1153 transitions. [2022-04-28 10:16:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1153 transitions. [2022-04-28 10:16:48,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:48,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:48,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:48,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 411 states have (on average 1.3284671532846715) internal successors, (546), 411 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:16:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 550 transitions. [2022-04-28 10:16:48,455 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 550 transitions. Word has length 39 [2022-04-28 10:16:48,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:48,455 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 550 transitions. [2022-04-28 10:16:48,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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:16:48,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 416 states and 550 transitions. [2022-04-28 10:16:51,043 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:16:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 550 transitions. [2022-04-28 10:16:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:16:51,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:51,044 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:51,062 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:16:51,244 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,SelfDestructingSolverStorable67 [2022-04-28 10:16:51,244 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:51,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash -236102046, now seen corresponding path program 11 times [2022-04-28 10:16:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:51,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1212993917] [2022-04-28 10:16:51,247 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:51,247 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash -236102046, now seen corresponding path program 12 times [2022-04-28 10:16:51,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:51,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996400298] [2022-04-28 10:16:51,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:51,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:51,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:51,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {131740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {131723#true} is VALID [2022-04-28 10:16:51,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {131723#true} assume true; {131723#true} is VALID [2022-04-28 10:16:51,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131723#true} {131723#true} #83#return; {131723#true} is VALID [2022-04-28 10:16:51,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {131723#true} call ULTIMATE.init(); {131740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:51,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {131740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {131723#true} is VALID [2022-04-28 10:16:51,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {131723#true} assume true; {131723#true} is VALID [2022-04-28 10:16:51,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131723#true} {131723#true} #83#return; {131723#true} is VALID [2022-04-28 10:16:51,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {131723#true} call #t~ret15 := main(); {131723#true} is VALID [2022-04-28 10:16:51,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {131723#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {131723#true} is VALID [2022-04-28 10:16:51,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {131723#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131728#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:16:51,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {131728#(<= 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; {131729#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:16:51,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {131729#(<= 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; {131730#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:16:51,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {131730#(<= 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; {131731#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:16:51,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {131731#(<= 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; {131732#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:16:51,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {131732#(<= 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; {131733#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:16:51,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {131733#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {131733#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:16:51,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {131733#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {131733#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:16:51,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {131733#(<= (* 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; {131734#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:16:51,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {131734#(<= (+ (* (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; {131735#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-28 10:16:51,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {131735#(<= (+ (* (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; {131736#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} is VALID [2022-04-28 10:16:51,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {131736#(<= (+ (* 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; {131737#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:16:51,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {131737#(<= (+ (* (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; {131738#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:16:51,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {131738#(<= (+ 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; {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:16:51,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:16:51,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {131739#(<= (+ 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; {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:16:51,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {131739#(<= (+ 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; {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:16:51,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {131739#(<= (+ 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; {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:16:51,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {131739#(<= (+ 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; {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:16:51,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {131739#(<= (+ 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; {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:16:51,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {131739#(<= (+ 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; {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:16:51,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:16:51,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {131739#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {131724#false} is VALID [2022-04-28 10:16:51,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:51,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:51,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:51,431 INFO L290 TraceCheckUtils]: 32: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:51,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:51,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:51,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {131724#false} assume !(~z~0 % 4294967296 > 0); {131724#false} is VALID [2022-04-28 10:16:51,431 INFO L272 TraceCheckUtils]: 36: Hoare triple {131724#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {131724#false} is VALID [2022-04-28 10:16:51,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {131724#false} ~cond := #in~cond; {131724#false} is VALID [2022-04-28 10:16:51,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {131724#false} assume 0 == ~cond; {131724#false} is VALID [2022-04-28 10:16:51,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {131724#false} assume !false; {131724#false} is VALID [2022-04-28 10:16:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:16:51,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:51,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996400298] [2022-04-28 10:16:51,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996400298] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:51,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517746859] [2022-04-28 10:16:51,432 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:16:51,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:51,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:51,433 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:16:51,433 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:16:51,516 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:16:51,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:51,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 10:16:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:51,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:51,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {131723#true} call ULTIMATE.init(); {131723#true} is VALID [2022-04-28 10:16:51,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {131723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {131723#true} is VALID [2022-04-28 10:16:51,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {131723#true} assume true; {131723#true} is VALID [2022-04-28 10:16:51,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131723#true} {131723#true} #83#return; {131723#true} is VALID [2022-04-28 10:16:51,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {131723#true} call #t~ret15 := main(); {131723#true} is VALID [2022-04-28 10:16:51,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {131723#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {131723#true} is VALID [2022-04-28 10:16:51,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {131723#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131728#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:16:51,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {131728#(<= 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; {131765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:16:51,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {131765#(<= 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; {131769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:51,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {131769#(<= 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; {131773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:16:51,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {131773#(<= 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; {131777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:51,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {131777#(<= 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; {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:16:51,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:16:51,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:16:51,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {131781#(<= 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; {131777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:51,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {131777#(<= 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; {131773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:16:51,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {131773#(<= 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; {131769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:51,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {131769#(<= 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; {131765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:16:51,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {131765#(<= 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; {131728#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:16:51,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {131728#(<= 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; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:51,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:51,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {131806#(<= 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; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:51,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {131806#(<= 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; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:51,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {131806#(<= 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; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:51,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {131806#(<= 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; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:51,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {131806#(<= 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; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:51,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {131806#(<= 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; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:51,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:51,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {131724#false} is VALID [2022-04-28 10:16:51,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:51,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:51,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:51,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:51,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:51,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:51,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {131724#false} assume !(~z~0 % 4294967296 > 0); {131724#false} is VALID [2022-04-28 10:16:51,871 INFO L272 TraceCheckUtils]: 36: Hoare triple {131724#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {131724#false} is VALID [2022-04-28 10:16:51,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {131724#false} ~cond := #in~cond; {131724#false} is VALID [2022-04-28 10:16:51,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {131724#false} assume 0 == ~cond; {131724#false} is VALID [2022-04-28 10:16:51,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {131724#false} assume !false; {131724#false} is VALID [2022-04-28 10:16:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:16:51,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:52,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {131724#false} assume !false; {131724#false} is VALID [2022-04-28 10:16:52,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {131724#false} assume 0 == ~cond; {131724#false} is VALID [2022-04-28 10:16:52,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {131724#false} ~cond := #in~cond; {131724#false} is VALID [2022-04-28 10:16:52,017 INFO L272 TraceCheckUtils]: 36: Hoare triple {131724#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {131724#false} is VALID [2022-04-28 10:16:52,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {131724#false} assume !(~z~0 % 4294967296 > 0); {131724#false} is VALID [2022-04-28 10:16:52,017 INFO L290 TraceCheckUtils]: 34: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:52,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:52,017 INFO L290 TraceCheckUtils]: 32: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:52,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:52,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:52,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {131724#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {131724#false} is VALID [2022-04-28 10:16:52,018 INFO L290 TraceCheckUtils]: 28: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {131724#false} is VALID [2022-04-28 10:16:52,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:52,018 INFO L290 TraceCheckUtils]: 26: Hoare triple {131806#(<= 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; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:52,019 INFO L290 TraceCheckUtils]: 25: Hoare triple {131806#(<= 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; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:52,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {131806#(<= 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; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:52,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {131806#(<= 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; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:52,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {131806#(<= 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; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:52,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {131806#(<= 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; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:52,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:52,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {131728#(<= 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; {131806#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:52,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {131765#(<= 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; {131728#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:16:52,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {131769#(<= 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; {131765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:16:52,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {131773#(<= 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; {131769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:52,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {131777#(<= 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; {131773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:16:52,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {131781#(<= 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; {131777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:52,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:16:52,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:16:52,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {131777#(<= 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; {131781#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:16:52,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {131773#(<= 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; {131777#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:52,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {131769#(<= 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; {131773#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:16:52,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {131765#(<= 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; {131769#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:16:52,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {131728#(<= 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; {131765#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:16:52,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {131723#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {131728#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:16:52,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {131723#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {131723#true} is VALID [2022-04-28 10:16:52,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {131723#true} call #t~ret15 := main(); {131723#true} is VALID [2022-04-28 10:16:52,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131723#true} {131723#true} #83#return; {131723#true} is VALID [2022-04-28 10:16:52,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {131723#true} assume true; {131723#true} is VALID [2022-04-28 10:16:52,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {131723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {131723#true} is VALID [2022-04-28 10:16:52,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {131723#true} call ULTIMATE.init(); {131723#true} is VALID [2022-04-28 10:16:52,029 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:16:52,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517746859] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:52,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:52,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 21 [2022-04-28 10:16:52,029 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:52,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1212993917] [2022-04-28 10:16:52,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1212993917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:52,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:52,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:16:52,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528986290] [2022-04-28 10:16:52,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:52,030 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:16:52,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:52,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:52,054 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:52,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:16:52,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:52,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:16:52,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:16:52,055 INFO L87 Difference]: Start difference. First operand 416 states and 550 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:57,219 INFO L93 Difference]: Finished difference Result 535 states and 730 transitions. [2022-04-28 10:16:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:16:57,219 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:16:57,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 107 transitions. [2022-04-28 10:16:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 107 transitions. [2022-04-28 10:16:57,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 107 transitions. [2022-04-28 10:16:57,322 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:16:57,333 INFO L225 Difference]: With dead ends: 535 [2022-04-28 10:16:57,333 INFO L226 Difference]: Without dead ends: 522 [2022-04-28 10:16:57,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:16:57,334 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 95 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:57,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 63 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:16:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-04-28 10:16:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 466. [2022-04-28 10:16:59,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:59,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 522 states. Second operand has 466 states, 461 states have (on average 1.331887201735358) internal successors, (614), 461 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call 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:59,798 INFO L74 IsIncluded]: Start isIncluded. First operand 522 states. Second operand has 466 states, 461 states have (on average 1.331887201735358) internal successors, (614), 461 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call 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:59,798 INFO L87 Difference]: Start difference. First operand 522 states. Second operand has 466 states, 461 states have (on average 1.331887201735358) internal successors, (614), 461 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call 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:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:59,807 INFO L93 Difference]: Finished difference Result 522 states and 699 transitions. [2022-04-28 10:16:59,807 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 699 transitions. [2022-04-28 10:16:59,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:59,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:59,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 466 states, 461 states have (on average 1.331887201735358) internal successors, (614), 461 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 522 states. [2022-04-28 10:16:59,809 INFO L87 Difference]: Start difference. First operand has 466 states, 461 states have (on average 1.331887201735358) internal successors, (614), 461 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 522 states. [2022-04-28 10:16:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:59,817 INFO L93 Difference]: Finished difference Result 522 states and 699 transitions. [2022-04-28 10:16:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 699 transitions. [2022-04-28 10:16:59,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:59,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:59,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:59,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 461 states have (on average 1.331887201735358) internal successors, (614), 461 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call 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:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 618 transitions. [2022-04-28 10:16:59,827 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 618 transitions. Word has length 40 [2022-04-28 10:16:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:59,827 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 618 transitions. [2022-04-28 10:16:59,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:59,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 466 states and 618 transitions. [2022-04-28 10:17:02,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 618 edges. 618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:02,710 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 618 transitions. [2022-04-28 10:17:02,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:17:02,710 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:02,710 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:02,727 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:17:02,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:02,911 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:02,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:02,911 INFO L85 PathProgramCache]: Analyzing trace with hash -559628798, now seen corresponding path program 29 times [2022-04-28 10:17:02,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:02,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1415408247] [2022-04-28 10:17:02,913 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:02,913 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:02,913 INFO L85 PathProgramCache]: Analyzing trace with hash -559628798, now seen corresponding path program 30 times [2022-04-28 10:17:02,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:02,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321066536] [2022-04-28 10:17:02,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:02,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:03,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {135080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {135056#true} is VALID [2022-04-28 10:17:03,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {135056#true} assume true; {135056#true} is VALID [2022-04-28 10:17:03,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135056#true} {135056#true} #83#return; {135056#true} is VALID [2022-04-28 10:17:03,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {135056#true} call ULTIMATE.init(); {135080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:03,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {135080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {135056#true} is VALID [2022-04-28 10:17:03,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {135056#true} assume true; {135056#true} is VALID [2022-04-28 10:17:03,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135056#true} {135056#true} #83#return; {135056#true} is VALID [2022-04-28 10:17:03,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {135056#true} call #t~ret15 := main(); {135056#true} is VALID [2022-04-28 10:17:03,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {135056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {135061#(= main_~y~0 0)} is VALID [2022-04-28 10:17:03,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {135061#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135062#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:03,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {135062#(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; {135063#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:03,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {135063#(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; {135064#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:03,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {135064#(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; {135065#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:03,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {135065#(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; {135066#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:03,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {135066#(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; {135067#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:03,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {135067#(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; {135068#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:03,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {135068#(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; {135069#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:03,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {135069#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {135069#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:03,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {135069#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {135070#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:17:03,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {135070#(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; {135071#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:17:03,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {135071#(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; {135072#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:17:03,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {135072#(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; {135073#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:17:03,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {135073#(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; {135074#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:17:03,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {135074#(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; {135075#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:17:03,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {135075#(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; {135076#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:17:03,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {135076#(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; {135077#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:17:03,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {135077#(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; {135078#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:17:03,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {135078#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {135078#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:17:03,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {135078#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135077#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:17:03,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {135077#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135076#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:17:03,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {135076#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135075#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:17:03,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {135075#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135074#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:17:03,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {135074#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135073#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:17:03,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {135073#(and (<= main_~z~0 5) (<= 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; {135072#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:17:03,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {135072#(and (<= main_~z~0 6) (<= 6 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; {135071#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:17:03,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {135071#(and (<= main_~z~0 7) (<= 7 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; {135079#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:17:03,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {135079#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {135079#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:17:03,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {135079#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {135079#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:17:03,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {135079#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {135057#false} is VALID [2022-04-28 10:17:03,256 INFO L272 TraceCheckUtils]: 36: Hoare triple {135057#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {135057#false} is VALID [2022-04-28 10:17:03,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {135057#false} ~cond := #in~cond; {135057#false} is VALID [2022-04-28 10:17:03,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {135057#false} assume 0 == ~cond; {135057#false} is VALID [2022-04-28 10:17:03,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {135057#false} assume !false; {135057#false} is VALID [2022-04-28 10:17:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:17:03,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:03,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321066536] [2022-04-28 10:17:03,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321066536] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:03,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739296] [2022-04-28 10:17:03,257 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:17:03,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:03,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:03,258 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:17:03,258 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:17:03,365 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:17:03,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:03,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 10:17:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:03,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:03,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {135056#true} call ULTIMATE.init(); {135056#true} is VALID [2022-04-28 10:17:03,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {135056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {135056#true} is VALID [2022-04-28 10:17:03,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {135056#true} assume true; {135056#true} is VALID [2022-04-28 10:17:03,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135056#true} {135056#true} #83#return; {135056#true} is VALID [2022-04-28 10:17:03,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {135056#true} call #t~ret15 := main(); {135056#true} is VALID [2022-04-28 10:17:03,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {135056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {135056#true} is VALID [2022-04-28 10:17:03,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {135056#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:03,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135106#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:03,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {135106#(< 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; {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:03,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:03,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:03,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:03,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:03,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:17:03,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:17:03,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:17:03,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:03,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:03,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:03,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:03,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:03,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135106#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:03,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {135106#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:03,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,707 INFO L290 TraceCheckUtils]: 33: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {135057#false} is VALID [2022-04-28 10:17:03,707 INFO L290 TraceCheckUtils]: 35: Hoare triple {135057#false} assume !(~z~0 % 4294967296 > 0); {135057#false} is VALID [2022-04-28 10:17:03,707 INFO L272 TraceCheckUtils]: 36: Hoare triple {135057#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {135057#false} is VALID [2022-04-28 10:17:03,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {135057#false} ~cond := #in~cond; {135057#false} is VALID [2022-04-28 10:17:03,707 INFO L290 TraceCheckUtils]: 38: Hoare triple {135057#false} assume 0 == ~cond; {135057#false} is VALID [2022-04-28 10:17:03,708 INFO L290 TraceCheckUtils]: 39: Hoare triple {135057#false} assume !false; {135057#false} is VALID [2022-04-28 10:17:03,708 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:17:03,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:03,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {135057#false} assume !false; {135057#false} is VALID [2022-04-28 10:17:03,848 INFO L290 TraceCheckUtils]: 38: Hoare triple {135057#false} assume 0 == ~cond; {135057#false} is VALID [2022-04-28 10:17:03,848 INFO L290 TraceCheckUtils]: 37: Hoare triple {135057#false} ~cond := #in~cond; {135057#false} is VALID [2022-04-28 10:17:03,848 INFO L272 TraceCheckUtils]: 36: Hoare triple {135057#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {135057#false} is VALID [2022-04-28 10:17:03,848 INFO L290 TraceCheckUtils]: 35: Hoare triple {135057#false} assume !(~z~0 % 4294967296 > 0); {135057#false} is VALID [2022-04-28 10:17:03,848 INFO L290 TraceCheckUtils]: 34: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {135057#false} is VALID [2022-04-28 10:17:03,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {135161#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135161#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:03,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {135106#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:03,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135106#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:03,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:03,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:03,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:03,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:03,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:03,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:17:03,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:17:03,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135130#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:17:03,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135126#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:03,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135122#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:03,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135118#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:03,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135114#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:03,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {135106#(< 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; {135110#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:03,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135106#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:03,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {135056#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {135102#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:03,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {135056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {135056#true} is VALID [2022-04-28 10:17:03,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {135056#true} call #t~ret15 := main(); {135056#true} is VALID [2022-04-28 10:17:03,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135056#true} {135056#true} #83#return; {135056#true} is VALID [2022-04-28 10:17:03,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {135056#true} assume true; {135056#true} is VALID [2022-04-28 10:17:03,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {135056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {135056#true} is VALID [2022-04-28 10:17:03,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {135056#true} call ULTIMATE.init(); {135056#true} is VALID [2022-04-28 10:17:03,862 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:17:03,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739296] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:03,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:03,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 31 [2022-04-28 10:17:03,863 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:03,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1415408247] [2022-04-28 10:17:03,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1415408247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:03,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:03,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:17:03,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247789196] [2022-04-28 10:17:03,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:03,863 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 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:17:03,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:03,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 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:17:03,891 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:17:03,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:17:03,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:03,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:17:03,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:17:03,891 INFO L87 Difference]: Start difference. First operand 466 states and 618 transitions. Second operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 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:17:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:22,184 INFO L93 Difference]: Finished difference Result 691 states and 961 transitions. [2022-04-28 10:17:22,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-04-28 10:17:22,184 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 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:17:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 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:17:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 370 transitions. [2022-04-28 10:17:22,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 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:17:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 370 transitions. [2022-04-28 10:17:22,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 370 transitions. [2022-04-28 10:17:22,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:22,518 INFO L225 Difference]: With dead ends: 691 [2022-04-28 10:17:22,518 INFO L226 Difference]: Without dead ends: 674 [2022-04-28 10:17:22,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4770 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=709, Invalid=16061, Unknown=0, NotChecked=0, Total=16770 [2022-04-28 10:17:22,520 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 131 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4197 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 4197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:22,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 146 Invalid, 4601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 4197 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 10:17:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-04-28 10:17:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 477. [2022-04-28 10:17:25,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:25,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 674 states. Second operand has 477 states, 472 states have (on average 1.3241525423728813) internal successors, (625), 472 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call 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:25,167 INFO L74 IsIncluded]: Start isIncluded. First operand 674 states. Second operand has 477 states, 472 states have (on average 1.3241525423728813) internal successors, (625), 472 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call 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:25,167 INFO L87 Difference]: Start difference. First operand 674 states. Second operand has 477 states, 472 states have (on average 1.3241525423728813) internal successors, (625), 472 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call 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:25,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:25,180 INFO L93 Difference]: Finished difference Result 674 states and 851 transitions. [2022-04-28 10:17:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 851 transitions. [2022-04-28 10:17:25,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:25,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:25,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 477 states, 472 states have (on average 1.3241525423728813) internal successors, (625), 472 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 674 states. [2022-04-28 10:17:25,181 INFO L87 Difference]: Start difference. First operand has 477 states, 472 states have (on average 1.3241525423728813) internal successors, (625), 472 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 674 states. [2022-04-28 10:17:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:25,194 INFO L93 Difference]: Finished difference Result 674 states and 851 transitions. [2022-04-28 10:17:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 851 transitions. [2022-04-28 10:17:25,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:25,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:25,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:25,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 472 states have (on average 1.3241525423728813) internal successors, (625), 472 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call 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:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 629 transitions. [2022-04-28 10:17:25,204 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 629 transitions. Word has length 40 [2022-04-28 10:17:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:25,204 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 629 transitions. [2022-04-28 10:17:25,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 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:17:25,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 477 states and 629 transitions. [2022-04-28 10:17:28,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 629 edges. 629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:28,315 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 629 transitions. [2022-04-28 10:17:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:17:28,316 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:28,316 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:28,332 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:17:28,516 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,SelfDestructingSolverStorable69 [2022-04-28 10:17:28,516 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:28,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:28,517 INFO L85 PathProgramCache]: Analyzing trace with hash -286560430, now seen corresponding path program 31 times [2022-04-28 10:17:28,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:28,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2039313254] [2022-04-28 10:17:28,519 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:28,519 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:28,519 INFO L85 PathProgramCache]: Analyzing trace with hash -286560430, now seen corresponding path program 32 times [2022-04-28 10:17:28,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:28,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483851506] [2022-04-28 10:17:28,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:28,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:28,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:28,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {139230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139211#true} is VALID [2022-04-28 10:17:28,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {139211#true} assume true; {139211#true} is VALID [2022-04-28 10:17:28,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139211#true} {139211#true} #83#return; {139211#true} is VALID [2022-04-28 10:17:28,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {139211#true} call ULTIMATE.init(); {139230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:28,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {139230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139211#true} is VALID [2022-04-28 10:17:28,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {139211#true} assume true; {139211#true} is VALID [2022-04-28 10:17:28,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139211#true} {139211#true} #83#return; {139211#true} is VALID [2022-04-28 10:17:28,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {139211#true} call #t~ret15 := main(); {139211#true} is VALID [2022-04-28 10:17:28,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {139211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139216#(= main_~y~0 0)} is VALID [2022-04-28 10:17:28,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {139216#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:28,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {139217#(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; {139218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:28,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {139218#(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; {139219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:28,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {139219#(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; {139220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:28,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {139220#(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; {139221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:28,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {139221#(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; {139222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:28,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {139222#(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; {139223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:28,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {139223#(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; {139224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:28,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {139224#(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; {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:28,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:28,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {139226#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:17:28,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {139226#(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; {139227#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:17:28,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {139227#(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; {139228#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:17:28,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {139228#(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; {139229#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:17:28,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {139229#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {139212#false} is VALID [2022-04-28 10:17:28,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-28 10:17:28,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-28 10:17:28,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-28 10:17:28,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-28 10:17:28,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-28 10:17:28,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-28 10:17:28,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-28 10:17:28,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-28 10:17:28,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {139212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139212#false} is VALID [2022-04-28 10:17:28,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {139212#false} assume !(~y~0 % 4294967296 > 0); {139212#false} is VALID [2022-04-28 10:17:28,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {139212#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139212#false} is VALID [2022-04-28 10:17:28,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {139212#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139212#false} is VALID [2022-04-28 10:17:28,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {139212#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139212#false} is VALID [2022-04-28 10:17:28,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {139212#false} assume !(~x~0 % 4294967296 > 0); {139212#false} is VALID [2022-04-28 10:17:28,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {139212#false} assume !(~z~0 % 4294967296 > 0); {139212#false} is VALID [2022-04-28 10:17:28,758 INFO L272 TraceCheckUtils]: 36: Hoare triple {139212#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {139212#false} is VALID [2022-04-28 10:17:28,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {139212#false} ~cond := #in~cond; {139212#false} is VALID [2022-04-28 10:17:28,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {139212#false} assume 0 == ~cond; {139212#false} is VALID [2022-04-28 10:17:28,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {139212#false} assume !false; {139212#false} is VALID [2022-04-28 10:17:28,758 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:17:28,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:28,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483851506] [2022-04-28 10:17:28,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483851506] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:28,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635693740] [2022-04-28 10:17:28,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:17:28,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:28,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:28,760 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:17:28,762 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:17:28,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:17:28,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:28,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:17:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:28,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:29,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {139211#true} call ULTIMATE.init(); {139211#true} is VALID [2022-04-28 10:17:29,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {139211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139211#true} is VALID [2022-04-28 10:17:29,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {139211#true} assume true; {139211#true} is VALID [2022-04-28 10:17:29,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139211#true} {139211#true} #83#return; {139211#true} is VALID [2022-04-28 10:17:29,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {139211#true} call #t~ret15 := main(); {139211#true} is VALID [2022-04-28 10:17:29,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {139211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139216#(= main_~y~0 0)} is VALID [2022-04-28 10:17:29,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {139216#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:29,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {139217#(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; {139218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:29,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {139218#(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; {139219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:29,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {139219#(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; {139220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:29,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {139220#(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; {139221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:29,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {139221#(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; {139222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:29,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {139222#(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; {139223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:29,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {139223#(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; {139224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:29,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {139224#(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; {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:29,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:29,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {139225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {139226#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:17:29,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {139226#(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; {139227#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:17:29,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {139227#(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; {139228#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:17:29,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {139228#(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; {139291#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:17:29,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {139291#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {139291#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:17:29,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {139291#(and (<= main_~z~0 6) (<= 6 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; {139228#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:17:29,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {139228#(and (<= main_~z~0 7) (<= 7 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; {139227#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:17:29,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {139227#(and (<= 8 main_~z~0) (<= main_~z~0 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; {139226#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:17:29,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {139226#(and (<= 9 main_~z~0) (<= 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; {139307#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:17:29,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {139307#(and (<= main_~z~0 10) (<= 10 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; {139311#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:17:29,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {139311#(and (<= main_~z~0 11) (<= 11 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; {139315#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:17:29,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {139315#(and (<= main_~z~0 12) (<= 12 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; {139319#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:17:29,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {139319#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139323#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:17:29,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {139323#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:17:29,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:17:29,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:17:29,286 INFO L290 TraceCheckUtils]: 32: Hoare triple {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:17:29,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:17:29,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:17:29,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {139327#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {139212#false} is VALID [2022-04-28 10:17:29,287 INFO L272 TraceCheckUtils]: 36: Hoare triple {139212#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {139212#false} is VALID [2022-04-28 10:17:29,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {139212#false} ~cond := #in~cond; {139212#false} is VALID [2022-04-28 10:17:29,287 INFO L290 TraceCheckUtils]: 38: Hoare triple {139212#false} assume 0 == ~cond; {139212#false} is VALID [2022-04-28 10:17:29,287 INFO L290 TraceCheckUtils]: 39: Hoare triple {139212#false} assume !false; {139212#false} is VALID [2022-04-28 10:17:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:17:29,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:29,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {139212#false} assume !false; {139212#false} is VALID [2022-04-28 10:17:29,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {139212#false} assume 0 == ~cond; {139212#false} is VALID [2022-04-28 10:17:29,862 INFO L290 TraceCheckUtils]: 37: Hoare triple {139212#false} ~cond := #in~cond; {139212#false} is VALID [2022-04-28 10:17:29,863 INFO L272 TraceCheckUtils]: 36: Hoare triple {139212#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {139212#false} is VALID [2022-04-28 10:17:29,863 INFO L290 TraceCheckUtils]: 35: Hoare triple {139370#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {139212#false} is VALID [2022-04-28 10:17:29,863 INFO L290 TraceCheckUtils]: 34: Hoare triple {139370#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {139370#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:29,863 INFO L290 TraceCheckUtils]: 33: Hoare triple {139370#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139370#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:29,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {139370#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139370#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:29,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {139370#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139370#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:29,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {139370#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {139370#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:29,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {139389#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139370#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:29,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {139393#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139389#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:17:29,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {139397#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139393#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:17:29,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {139401#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139397#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:17:29,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {139405#(< 0 (mod (+ 5 main_~z~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; {139401#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 10:17:29,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {139409#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139405#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 10:17:29,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {139413#(< 0 (mod (+ 7 main_~z~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; {139409#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:17:29,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {139417#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139413#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:17:29,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {139421#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139417#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 10:17:29,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {139421#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !(~z~0 % 4294967296 > 0); {139421#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-28 10:17:29,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {139417#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139421#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-28 10:17:29,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {139413#(< 0 (mod (+ 7 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; {139417#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 10:17:29,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {139409#(< 0 (mod (+ main_~z~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; {139413#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:17:29,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {139437#(< 0 (mod (+ main_~y~0 6) 4294967296))} ~z~0 := ~y~0; {139409#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:17:29,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {139437#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {139437#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:17:29,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {139444#(< 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; {139437#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:17:29,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {139448#(< 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; {139444#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:29,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {139452#(< 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; {139448#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:17:29,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {139456#(< 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; {139452#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:17:29,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {139460#(< 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; {139456#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:17:29,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {139464#(< 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; {139460#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:17:29,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {139468#(< 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; {139464#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:17:29,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {139472#(< 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; {139468#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:17:29,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {139476#(< 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; {139472#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:17:29,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {139211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139476#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:17:29,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {139211#true} call #t~ret15 := main(); {139211#true} is VALID [2022-04-28 10:17:29,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139211#true} {139211#true} #83#return; {139211#true} is VALID [2022-04-28 10:17:29,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {139211#true} assume true; {139211#true} is VALID [2022-04-28 10:17:29,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {139211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139211#true} is VALID [2022-04-28 10:17:29,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {139211#true} call ULTIMATE.init(); {139211#true} is VALID [2022-04-28 10:17:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:17:29,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635693740] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:29,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:29,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 22] total 44 [2022-04-28 10:17:29,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:29,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2039313254] [2022-04-28 10:17:29,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2039313254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:29,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:29,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:17:29,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154605278] [2022-04-28 10:17:29,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:29,888 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 40 [2022-04-28 10:17:29,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:29,888 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:17:29,910 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:17:29,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:17:29,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:29,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:17:29,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1596, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:17:29,910 INFO L87 Difference]: Start difference. First operand 477 states and 629 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:17:40,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:40,515 INFO L93 Difference]: Finished difference Result 702 states and 903 transitions. [2022-04-28 10:17:40,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:17:40,515 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 40 [2022-04-28 10:17:40,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:40,515 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:17:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 132 transitions. [2022-04-28 10:17:40,516 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:17:40,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 132 transitions. [2022-04-28 10:17:40,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 132 transitions. [2022-04-28 10:17:40,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:40,632 INFO L225 Difference]: With dead ends: 702 [2022-04-28 10:17:40,632 INFO L226 Difference]: Without dead ends: 682 [2022-04-28 10:17:40,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=672, Invalid=3360, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:17:40,633 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 99 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:40,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 119 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:17:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-04-28 10:17:43,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 477. [2022-04-28 10:17:43,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:43,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 682 states. Second operand has 477 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 472 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call 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:43,136 INFO L74 IsIncluded]: Start isIncluded. First operand 682 states. Second operand has 477 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 472 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call 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:43,136 INFO L87 Difference]: Start difference. First operand 682 states. Second operand has 477 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 472 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call 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:43,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:43,149 INFO L93 Difference]: Finished difference Result 682 states and 882 transitions. [2022-04-28 10:17:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 882 transitions. [2022-04-28 10:17:43,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:43,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:43,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 477 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 472 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 682 states. [2022-04-28 10:17:43,151 INFO L87 Difference]: Start difference. First operand has 477 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 472 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 682 states. [2022-04-28 10:17:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:43,165 INFO L93 Difference]: Finished difference Result 682 states and 882 transitions. [2022-04-28 10:17:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 882 transitions. [2022-04-28 10:17:43,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:43,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:43,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:43,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 472 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call 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:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 628 transitions. [2022-04-28 10:17:43,176 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 628 transitions. Word has length 40 [2022-04-28 10:17:43,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:43,176 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 628 transitions. [2022-04-28 10:17:43,176 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:17:43,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 477 states and 628 transitions. [2022-04-28 10:17:46,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 628 edges. 628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 628 transitions. [2022-04-28 10:17:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:17:46,356 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:46,356 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:46,374 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:17:46,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:46,559 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:46,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash -727872510, now seen corresponding path program 33 times [2022-04-28 10:17:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:46,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1030097670] [2022-04-28 10:17:46,562 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:46,562 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:46,562 INFO L85 PathProgramCache]: Analyzing trace with hash -727872510, now seen corresponding path program 34 times [2022-04-28 10:17:46,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:46,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467913595] [2022-04-28 10:17:46,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:46,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:46,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:46,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {143278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {143259#true} is VALID [2022-04-28 10:17:46,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {143259#true} assume true; {143259#true} is VALID [2022-04-28 10:17:46,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {143259#true} {143259#true} #83#return; {143259#true} is VALID [2022-04-28 10:17:46,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {143259#true} call ULTIMATE.init(); {143278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:46,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {143278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {143259#true} is VALID [2022-04-28 10:17:46,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {143259#true} assume true; {143259#true} is VALID [2022-04-28 10:17:46,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143259#true} {143259#true} #83#return; {143259#true} is VALID [2022-04-28 10:17:46,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {143259#true} call #t~ret15 := main(); {143259#true} is VALID [2022-04-28 10:17:46,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {143259#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {143264#(= main_~y~0 0)} is VALID [2022-04-28 10:17:46,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {143264#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143265#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:46,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {143265#(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; {143266#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:46,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {143266#(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; {143267#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:46,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {143267#(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; {143268#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:46,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {143268#(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; {143269#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:46,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {143269#(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; {143270#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:46,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {143270#(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; {143271#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:46,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {143271#(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; {143272#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:46,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {143272#(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; {143273#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:46,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {143273#(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; {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:46,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:46,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {143275#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:17:46,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {143275#(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; {143276#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:17:46,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {143276#(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; {143277#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:17:46,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {143277#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-28 10:17:46,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:46,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:46,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:46,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:46,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:46,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:46,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:46,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:46,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:46,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:46,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {143260#false} assume !(~y~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-28 10:17:46,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {143260#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {143260#false} is VALID [2022-04-28 10:17:46,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {143260#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {143260#false} is VALID [2022-04-28 10:17:46,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {143260#false} assume !(~x~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-28 10:17:46,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {143260#false} assume !(~z~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-28 10:17:46,769 INFO L272 TraceCheckUtils]: 36: Hoare triple {143260#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {143260#false} is VALID [2022-04-28 10:17:46,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {143260#false} ~cond := #in~cond; {143260#false} is VALID [2022-04-28 10:17:46,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {143260#false} assume 0 == ~cond; {143260#false} is VALID [2022-04-28 10:17:46,769 INFO L290 TraceCheckUtils]: 39: Hoare triple {143260#false} assume !false; {143260#false} is VALID [2022-04-28 10:17:46,769 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:17:46,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:46,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467913595] [2022-04-28 10:17:46,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467913595] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:46,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927323696] [2022-04-28 10:17:46,769 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:17:46,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:46,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:46,770 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:17:46,771 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:17:46,832 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:17:46,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:46,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:17:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:46,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:47,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {143259#true} call ULTIMATE.init(); {143259#true} is VALID [2022-04-28 10:17:47,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {143259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {143259#true} is VALID [2022-04-28 10:17:47,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {143259#true} assume true; {143259#true} is VALID [2022-04-28 10:17:47,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143259#true} {143259#true} #83#return; {143259#true} is VALID [2022-04-28 10:17:47,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {143259#true} call #t~ret15 := main(); {143259#true} is VALID [2022-04-28 10:17:47,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {143259#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {143264#(= main_~y~0 0)} is VALID [2022-04-28 10:17:47,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {143264#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {143265#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:47,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {143265#(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; {143266#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:47,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {143266#(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; {143267#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:47,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {143267#(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; {143268#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:47,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {143268#(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; {143269#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:47,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {143269#(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; {143270#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:47,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {143270#(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; {143271#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:47,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {143271#(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; {143272#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:47,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {143272#(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; {143273#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:47,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {143273#(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; {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:47,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:47,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {143274#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {143275#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:17:47,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {143275#(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; {143276#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:17:47,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {143276#(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; {143339#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:17:47,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {143339#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {143260#false} assume !(~y~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 32: Hoare triple {143260#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 33: Hoare triple {143260#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {143260#false} assume !(~x~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {143260#false} assume !(~z~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L272 TraceCheckUtils]: 36: Hoare triple {143260#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {143260#false} ~cond := #in~cond; {143260#false} is VALID [2022-04-28 10:17:47,091 INFO L290 TraceCheckUtils]: 38: Hoare triple {143260#false} assume 0 == ~cond; {143260#false} is VALID [2022-04-28 10:17:47,092 INFO L290 TraceCheckUtils]: 39: Hoare triple {143260#false} assume !false; {143260#false} is VALID [2022-04-28 10:17:47,092 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:17:47,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:47,474 INFO L290 TraceCheckUtils]: 39: Hoare triple {143260#false} assume !false; {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L290 TraceCheckUtils]: 38: Hoare triple {143260#false} assume 0 == ~cond; {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L290 TraceCheckUtils]: 37: Hoare triple {143260#false} ~cond := #in~cond; {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L272 TraceCheckUtils]: 36: Hoare triple {143260#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {143260#false} assume !(~z~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {143260#false} assume !(~x~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {143260#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {143260#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {143260#false} assume !(~y~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {143260#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {143260#false} is VALID [2022-04-28 10:17:47,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {143457#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {143260#false} is VALID [2022-04-28 10:17:47,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {143461#(< 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; {143457#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:47,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {143465#(< 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; {143461#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:17:47,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {143469#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {143465#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:17:47,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {143469#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {143469#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:17:47,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {143476#(< 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; {143469#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:17:47,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {143480#(< 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; {143476#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:17:47,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {143484#(< 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; {143480#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:17:47,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {143488#(< 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; {143484#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:17:47,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {143492#(< 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; {143488#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:17:47,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {143496#(< 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; {143492#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:17:47,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {143500#(< 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; {143496#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:17:47,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {143504#(< 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; {143500#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:47,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {143508#(< 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; {143504#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:17:47,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {143512#(< 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; {143508#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:47,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {143259#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {143512#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:17:47,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {143259#true} call #t~ret15 := main(); {143259#true} is VALID [2022-04-28 10:17:47,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143259#true} {143259#true} #83#return; {143259#true} is VALID [2022-04-28 10:17:47,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {143259#true} assume true; {143259#true} is VALID [2022-04-28 10:17:47,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {143259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {143259#true} is VALID [2022-04-28 10:17:47,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {143259#true} call ULTIMATE.init(); {143259#true} is VALID [2022-04-28 10:17:47,485 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:17:47,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927323696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:47,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:47,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:17:47,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:47,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1030097670] [2022-04-28 10:17:47,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1030097670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:47,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:47,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:17:47,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455587583] [2022-04-28 10:17:47,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:47,486 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 40 [2022-04-28 10:17:47,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:47,486 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:17:47,505 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:17:47,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:17:47,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:47,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:17:47,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:17:47,505 INFO L87 Difference]: Start difference. First operand 477 states and 628 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:17:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:58,974 INFO L93 Difference]: Finished difference Result 737 states and 943 transitions. [2022-04-28 10:17:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:17:58,974 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 40 [2022-04-28 10:17:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:58,975 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:17:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2022-04-28 10:17:58,976 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:17:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2022-04-28 10:17:58,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 139 transitions. [2022-04-28 10:17:59,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:59,111 INFO L225 Difference]: With dead ends: 737 [2022-04-28 10:17:59,111 INFO L226 Difference]: Without dead ends: 717 [2022-04-28 10:17:59,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=482, Invalid=1870, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:17:59,111 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 110 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:59,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 132 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:17:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-04-28 10:18:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 477. [2022-04-28 10:18:01,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:01,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 717 states. Second operand has 477 states, 472 states have (on average 1.319915254237288) internal successors, (623), 472 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call 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:01,577 INFO L74 IsIncluded]: Start isIncluded. First operand 717 states. Second operand has 477 states, 472 states have (on average 1.319915254237288) internal successors, (623), 472 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call 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:01,577 INFO L87 Difference]: Start difference. First operand 717 states. Second operand has 477 states, 472 states have (on average 1.319915254237288) internal successors, (623), 472 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call 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:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:01,591 INFO L93 Difference]: Finished difference Result 717 states and 922 transitions. [2022-04-28 10:18:01,592 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 922 transitions. [2022-04-28 10:18:01,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:01,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:01,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 477 states, 472 states have (on average 1.319915254237288) internal successors, (623), 472 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 717 states. [2022-04-28 10:18:01,593 INFO L87 Difference]: Start difference. First operand has 477 states, 472 states have (on average 1.319915254237288) internal successors, (623), 472 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 717 states. [2022-04-28 10:18:01,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:01,607 INFO L93 Difference]: Finished difference Result 717 states and 922 transitions. [2022-04-28 10:18:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 922 transitions. [2022-04-28 10:18:01,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:01,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:01,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:01,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 472 states have (on average 1.319915254237288) internal successors, (623), 472 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call 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:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 627 transitions. [2022-04-28 10:18:01,617 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 627 transitions. Word has length 40 [2022-04-28 10:18:01,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:01,617 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 627 transitions. [2022-04-28 10:18:01,617 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:18:01,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 477 states and 627 transitions. [2022-04-28 10:18:04,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 627 edges. 627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 627 transitions. [2022-04-28 10:18:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:18:04,693 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:18:04,693 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:18:04,709 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:18:04,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:04,894 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:18:04,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:18:04,894 INFO L85 PathProgramCache]: Analyzing trace with hash 920459602, now seen corresponding path program 35 times [2022-04-28 10:18:04,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:04,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [304001244] [2022-04-28 10:18:04,897 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:18:04,897 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:18:04,897 INFO L85 PathProgramCache]: Analyzing trace with hash 920459602, now seen corresponding path program 36 times [2022-04-28 10:18:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:18:04,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084929743] [2022-04-28 10:18:04,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:18:04,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:18:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:05,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:18:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:05,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {147448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {147429#true} is VALID [2022-04-28 10:18:05,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {147429#true} assume true; {147429#true} is VALID [2022-04-28 10:18:05,115 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147429#true} {147429#true} #83#return; {147429#true} is VALID [2022-04-28 10:18:05,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {147429#true} call ULTIMATE.init(); {147448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:18:05,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {147448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {147429#true} is VALID [2022-04-28 10:18:05,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {147429#true} assume true; {147429#true} is VALID [2022-04-28 10:18:05,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147429#true} {147429#true} #83#return; {147429#true} is VALID [2022-04-28 10:18:05,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {147429#true} call #t~ret15 := main(); {147429#true} is VALID [2022-04-28 10:18:05,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {147429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {147434#(= main_~y~0 0)} is VALID [2022-04-28 10:18:05,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {147434#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147435#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:05,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {147435#(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; {147436#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:05,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {147436#(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; {147437#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:05,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {147437#(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; {147438#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:05,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {147438#(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; {147439#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:05,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {147439#(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; {147440#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:05,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {147440#(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; {147441#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:05,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {147441#(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; {147442#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:05,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {147442#(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; {147443#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:05,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {147443#(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; {147444#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:18:05,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {147444#(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; {147445#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:18:05,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {147445#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {147445#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:18:05,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {147445#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {147446#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:18:05,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {147446#(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; {147447#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:18:05,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {147447#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-28 10:18:05,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {147430#false} assume !(~y~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {147430#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {147430#false} assume !(~x~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {147430#false} assume !(~z~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L272 TraceCheckUtils]: 36: Hoare triple {147430#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {147430#false} ~cond := #in~cond; {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {147430#false} assume 0 == ~cond; {147430#false} is VALID [2022-04-28 10:18:05,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {147430#false} assume !false; {147430#false} is VALID [2022-04-28 10:18:05,125 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:18:05,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:18:05,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084929743] [2022-04-28 10:18:05,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084929743] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:18:05,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656176483] [2022-04-28 10:18:05,125 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:18:05,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:05,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:18:05,126 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:18:05,126 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:18:05,218 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:18:05,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:18:05,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:18:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:05,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:18:05,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {147429#true} call ULTIMATE.init(); {147429#true} is VALID [2022-04-28 10:18:05,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {147429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {147429#true} assume true; {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147429#true} {147429#true} #83#return; {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {147429#true} call #t~ret15 := main(); {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {147429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {147429#true} assume !(~x~0 % 4294967296 > 0); {147429#true} is VALID [2022-04-28 10:18:05,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {147429#true} ~z~0 := ~y~0; {147506#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:18:05,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {147506#(= 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; {147510#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:18:05,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {147510#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {147514#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:18:05,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {147514#(<= (mod (+ main_~y~0 4294967295) 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; {147518#(<= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:18:05,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {147518#(<= (mod main_~y~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; {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {147430#false} assume !(~y~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {147430#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {147430#false} assume !(~x~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {147430#false} assume !(~z~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L272 TraceCheckUtils]: 36: Hoare triple {147430#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {147430#false} ~cond := #in~cond; {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {147430#false} assume 0 == ~cond; {147430#false} is VALID [2022-04-28 10:18:05,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {147430#false} assume !false; {147430#false} is VALID [2022-04-28 10:18:05,386 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:18:05,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:18:05,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {147430#false} assume !false; {147430#false} is VALID [2022-04-28 10:18:05,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {147430#false} assume 0 == ~cond; {147430#false} is VALID [2022-04-28 10:18:05,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {147430#false} ~cond := #in~cond; {147430#false} is VALID [2022-04-28 10:18:05,550 INFO L272 TraceCheckUtils]: 36: Hoare triple {147430#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {147430#false} is VALID [2022-04-28 10:18:05,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {147430#false} assume !(~z~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-28 10:18:05,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {147430#false} assume !(~x~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-28 10:18:05,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {147430#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {147430#false} is VALID [2022-04-28 10:18:05,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {147430#false} assume !(~y~0 % 4294967296 > 0); {147430#false} is VALID [2022-04-28 10:18:05,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {147430#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147430#false} is VALID [2022-04-28 10:18:05,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {147518#(<= (mod main_~y~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; {147430#false} is VALID [2022-04-28 10:18:05,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {147514#(<= (mod (+ main_~y~0 4294967295) 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; {147518#(<= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:18:05,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {147630#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {147514#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:18:05,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {147634#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 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; {147630#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:18:05,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {147429#true} ~z~0 := ~y~0; {147634#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:18:05,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {147429#true} assume !(~x~0 % 4294967296 > 0); {147429#true} is VALID [2022-04-28 10:18:05,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {147429#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147429#true} is VALID [2022-04-28 10:18:05,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {147429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {147429#true} is VALID [2022-04-28 10:18:05,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {147429#true} call #t~ret15 := main(); {147429#true} is VALID [2022-04-28 10:18:05,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147429#true} {147429#true} #83#return; {147429#true} is VALID [2022-04-28 10:18:05,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {147429#true} assume true; {147429#true} is VALID [2022-04-28 10:18:05,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {147429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {147429#true} is VALID [2022-04-28 10:18:05,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {147429#true} call ULTIMATE.init(); {147429#true} is VALID [2022-04-28 10:18:05,567 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:18:05,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656176483] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:18:05,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:18:05,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 23 [2022-04-28 10:18:05,567 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:18:05,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [304001244] [2022-04-28 10:18:05,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [304001244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:18:05,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:18:05,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:18:05,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601947993] [2022-04-28 10:18:05,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:18:05,568 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 40 [2022-04-28 10:18:05,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:18:05,568 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:18:05,586 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:18:05,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:18:05,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:05,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:18:05,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:18:05,587 INFO L87 Difference]: Start difference. First operand 477 states and 627 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:18:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:18,864 INFO L93 Difference]: Finished difference Result 773 states and 984 transitions. [2022-04-28 10:18:18,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:18:18,864 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 40 [2022-04-28 10:18:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:18:18,864 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:18:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 147 transitions. [2022-04-28 10:18:18,865 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:18:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 147 transitions. [2022-04-28 10:18:18,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 147 transitions. [2022-04-28 10:18:18,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:19,007 INFO L225 Difference]: With dead ends: 773 [2022-04-28 10:18:19,007 INFO L226 Difference]: Without dead ends: 753 [2022-04-28 10:18:19,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=1271, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:18:19,008 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 125 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:18:19,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 150 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 10:18:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-04-28 10:18:21,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 477. [2022-04-28 10:18:21,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:21,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 753 states. Second operand has 477 states, 472 states have (on average 1.3177966101694916) internal successors, (622), 472 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call 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:21,470 INFO L74 IsIncluded]: Start isIncluded. First operand 753 states. Second operand has 477 states, 472 states have (on average 1.3177966101694916) internal successors, (622), 472 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call 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:21,470 INFO L87 Difference]: Start difference. First operand 753 states. Second operand has 477 states, 472 states have (on average 1.3177966101694916) internal successors, (622), 472 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call 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:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:21,485 INFO L93 Difference]: Finished difference Result 753 states and 963 transitions. [2022-04-28 10:18:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 963 transitions. [2022-04-28 10:18:21,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:21,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:21,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 477 states, 472 states have (on average 1.3177966101694916) internal successors, (622), 472 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 753 states. [2022-04-28 10:18:21,486 INFO L87 Difference]: Start difference. First operand has 477 states, 472 states have (on average 1.3177966101694916) internal successors, (622), 472 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 753 states. [2022-04-28 10:18:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:21,502 INFO L93 Difference]: Finished difference Result 753 states and 963 transitions. [2022-04-28 10:18:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 963 transitions. [2022-04-28 10:18:21,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:21,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:21,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:21,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 472 states have (on average 1.3177966101694916) internal successors, (622), 472 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call 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:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 626 transitions. [2022-04-28 10:18:21,511 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 626 transitions. Word has length 40 [2022-04-28 10:18:21,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:21,512 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 626 transitions. [2022-04-28 10:18:21,512 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:18:21,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 477 states and 626 transitions. [2022-04-28 10:18:24,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 626 edges. 626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 626 transitions. [2022-04-28 10:18:24,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:18:24,676 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:18:24,676 INFO L195 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:18:24,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-04-28 10:18:24,876 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,SelfDestructingSolverStorable72 [2022-04-28 10:18:24,876 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:18:24,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:18:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2135352450, now seen corresponding path program 47 times [2022-04-28 10:18:24,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:24,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [999811931] [2022-04-28 10:18:24,879 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:18:24,879 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:18:24,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2135352450, now seen corresponding path program 48 times [2022-04-28 10:18:24,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:18:24,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96981315] [2022-04-28 10:18:24,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:18:24,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:18:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:25,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:18:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:25,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {151761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151730#true} is VALID [2022-04-28 10:18:25,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {151730#true} assume true; {151730#true} is VALID [2022-04-28 10:18:25,410 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {151730#true} {151730#true} #83#return; {151730#true} is VALID [2022-04-28 10:18:25,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {151730#true} call ULTIMATE.init(); {151761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:18:25,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {151761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151730#true} is VALID [2022-04-28 10:18:25,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {151730#true} assume true; {151730#true} is VALID [2022-04-28 10:18:25,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151730#true} {151730#true} #83#return; {151730#true} is VALID [2022-04-28 10:18:25,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {151730#true} call #t~ret15 := main(); {151730#true} is VALID [2022-04-28 10:18:25,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {151730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151735#(= main_~y~0 0)} is VALID [2022-04-28 10:18:25,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {151735#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151736#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:25,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {151736#(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; {151737#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:25,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {151737#(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; {151738#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:25,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {151738#(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; {151739#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:25,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {151739#(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; {151740#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:25,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {151740#(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; {151741#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:25,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {151741#(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; {151742#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:25,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {151742#(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; {151743#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:25,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {151743#(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; {151744#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:25,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {151744#(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; {151745#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:18:25,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {151745#(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; {151746#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:18:25,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {151746#(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; {151747#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:18:25,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {151747#(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; {151748#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:18:25,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {151748#(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; {151749#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:18:25,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {151749#(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; {151750#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:18:25,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {151750#(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; {151751#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:18:25,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {151751#(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; {151752#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:18:25,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {151752#(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; {151753#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:18:25,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {151753#(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; {151754#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:18:25,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {151754#(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; {151755#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:18:25,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {151755#(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; {151756#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:18:25,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {151756#(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; {151757#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:18:25,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {151757#(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; {151758#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:18:25,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {151758#(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; {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:18:25,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:18:25,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {151760#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} is VALID [2022-04-28 10:18:25,425 INFO L290 TraceCheckUtils]: 32: Hoare triple {151760#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-28 10:18:25,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {151731#false} assume !(~y~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-28 10:18:25,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {151731#false} assume !(~x~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-28 10:18:25,425 INFO L290 TraceCheckUtils]: 35: Hoare triple {151731#false} assume !(~z~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-28 10:18:25,425 INFO L272 TraceCheckUtils]: 36: Hoare triple {151731#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {151731#false} is VALID [2022-04-28 10:18:25,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {151731#false} ~cond := #in~cond; {151731#false} is VALID [2022-04-28 10:18:25,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {151731#false} assume 0 == ~cond; {151731#false} is VALID [2022-04-28 10:18:25,426 INFO L290 TraceCheckUtils]: 39: Hoare triple {151731#false} assume !false; {151731#false} is VALID [2022-04-28 10:18:25,426 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:18:25,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:18:25,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96981315] [2022-04-28 10:18:25,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96981315] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:18:25,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32270129] [2022-04-28 10:18:25,426 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:18:25,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:25,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:18:25,427 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:18:25,428 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:18:25,985 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 10:18:25,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:18:25,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-28 10:18:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:25,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:18:26,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {151730#true} call ULTIMATE.init(); {151730#true} is VALID [2022-04-28 10:18:26,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {151730#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151730#true} is VALID [2022-04-28 10:18:26,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {151730#true} assume true; {151730#true} is VALID [2022-04-28 10:18:26,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151730#true} {151730#true} #83#return; {151730#true} is VALID [2022-04-28 10:18:26,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {151730#true} call #t~ret15 := main(); {151730#true} is VALID [2022-04-28 10:18:26,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {151730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151735#(= main_~y~0 0)} is VALID [2022-04-28 10:18:26,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {151735#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151736#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:26,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {151736#(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; {151737#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:26,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {151737#(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; {151738#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:26,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {151738#(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; {151739#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:26,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {151739#(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; {151740#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:26,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {151740#(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; {151741#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:26,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {151741#(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; {151742#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:26,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {151742#(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; {151743#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:26,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {151743#(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; {151744#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:26,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {151744#(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; {151745#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:18:26,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {151745#(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; {151746#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:18:26,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {151746#(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; {151747#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:18:26,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {151747#(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; {151748#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:18:26,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {151748#(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; {151749#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:18:26,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {151749#(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; {151750#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:18:26,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {151750#(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; {151751#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:18:26,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {151751#(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; {151752#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:18:26,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {151752#(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; {151753#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:18:26,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {151753#(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; {151754#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:18:26,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {151754#(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; {151755#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:18:26,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {151755#(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; {151756#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:18:26,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {151756#(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; {151757#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:18:26,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {151757#(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; {151758#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:18:26,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {151758#(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; {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:18:26,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:18:26,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {151759#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {151858#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-28 10:18:26,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {151858#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-28 10:18:26,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {151731#false} assume !(~y~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-28 10:18:26,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {151731#false} assume !(~x~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-28 10:18:26,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {151731#false} assume !(~z~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-28 10:18:26,344 INFO L272 TraceCheckUtils]: 36: Hoare triple {151731#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {151731#false} is VALID [2022-04-28 10:18:26,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {151731#false} ~cond := #in~cond; {151731#false} is VALID [2022-04-28 10:18:26,344 INFO L290 TraceCheckUtils]: 38: Hoare triple {151731#false} assume 0 == ~cond; {151731#false} is VALID [2022-04-28 10:18:26,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {151731#false} assume !false; {151731#false} is VALID [2022-04-28 10:18:26,345 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:18:26,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:18:27,380 INFO L290 TraceCheckUtils]: 39: Hoare triple {151731#false} assume !false; {151731#false} is VALID [2022-04-28 10:18:27,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {151731#false} assume 0 == ~cond; {151731#false} is VALID [2022-04-28 10:18:27,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {151731#false} ~cond := #in~cond; {151731#false} is VALID [2022-04-28 10:18:27,381 INFO L272 TraceCheckUtils]: 36: Hoare triple {151731#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {151731#false} is VALID [2022-04-28 10:18:27,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {151731#false} assume !(~z~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-28 10:18:27,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {151731#false} assume !(~x~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-28 10:18:27,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {151731#false} assume !(~y~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-28 10:18:27,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {151904#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {151731#false} is VALID [2022-04-28 10:18:27,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {151908#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {151904#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:18:27,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {151908#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {151908#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:18:27,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {151915#(< 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; {151908#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:18:27,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {151919#(< 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; {151915#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:18:27,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {151923#(< 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; {151919#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:18:27,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {151927#(< 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; {151923#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:18:27,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {151931#(< 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; {151927#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:18:27,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {151935#(< 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; {151931#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:27,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {151939#(< 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; {151935#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:18:27,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {151943#(< 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; {151939#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:27,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {151947#(< 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; {151943#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:18:27,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {151951#(< 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; {151947#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:18:27,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {151955#(< 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; {151951#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:18:27,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {151959#(< 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; {151955#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:18:27,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {151963#(< 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; {151959#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:18:27,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {151967#(< 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; {151963#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:18:27,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {151971#(< 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; {151967#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:18:27,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {151975#(< 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; {151971#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:18:27,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {151979#(< 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; {151975#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:18:27,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {151983#(< 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; {151979#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:18:27,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {151987#(< 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; {151983#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:18:27,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {151991#(< 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; {151987#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:27,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {151995#(< 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; {151991#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:18:27,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {151999#(< 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; {151995#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:18:27,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {152003#(< 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; {151999#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:18:27,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {152007#(< 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; {152003#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:27,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {151730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {152007#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:18:27,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {151730#true} call #t~ret15 := main(); {151730#true} is VALID [2022-04-28 10:18:27,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151730#true} {151730#true} #83#return; {151730#true} is VALID [2022-04-28 10:18:27,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {151730#true} assume true; {151730#true} is VALID [2022-04-28 10:18:27,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {151730#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151730#true} is VALID [2022-04-28 10:18:27,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {151730#true} call ULTIMATE.init(); {151730#true} is VALID [2022-04-28 10:18:27,397 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:18:27,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32270129] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:18:27,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:18:27,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-28 10:18:27,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:18:27,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [999811931] [2022-04-28 10:18:27,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [999811931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:18:27,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:18:27,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 10:18:27,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760437366] [2022-04-28 10:18:27,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:18:27,398 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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:18:27,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:18:27,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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:18:27,420 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:18:27,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 10:18:27,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:27,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 10:18:27,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=2344, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:18:27,421 INFO L87 Difference]: Start difference. First operand 477 states and 626 transitions. Second operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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:18:54,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:54,964 INFO L93 Difference]: Finished difference Result 1116 states and 1599 transitions. [2022-04-28 10:18:54,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:18:54,964 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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:18:54,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:18:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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:18:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 313 transitions. [2022-04-28 10:18:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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:18:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 313 transitions. [2022-04-28 10:18:54,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 313 transitions. [2022-04-28 10:18:55,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:55,264 INFO L225 Difference]: With dead ends: 1116 [2022-04-28 10:18:55,264 INFO L226 Difference]: Without dead ends: 1076 [2022-04-28 10:18:55,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1492, Invalid=5150, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 10:18:55,265 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 276 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 6602 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 6742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 6602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:18:55,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 300 Invalid, 6742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 6602 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 10:18:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2022-04-28 10:18:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 494. [2022-04-28 10:18:57,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:57,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1076 states. Second operand has 494 states, 489 states have (on average 1.3231083844580778) internal successors, (647), 489 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call 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,839 INFO L74 IsIncluded]: Start isIncluded. First operand 1076 states. Second operand has 494 states, 489 states have (on average 1.3231083844580778) internal successors, (647), 489 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call 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,840 INFO L87 Difference]: Start difference. First operand 1076 states. Second operand has 494 states, 489 states have (on average 1.3231083844580778) internal successors, (647), 489 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call 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,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:57,871 INFO L93 Difference]: Finished difference Result 1076 states and 1372 transitions. [2022-04-28 10:18:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1372 transitions. [2022-04-28 10:18:57,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:57,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:57,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 494 states, 489 states have (on average 1.3231083844580778) internal successors, (647), 489 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1076 states. [2022-04-28 10:18:57,872 INFO L87 Difference]: Start difference. First operand has 494 states, 489 states have (on average 1.3231083844580778) internal successors, (647), 489 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1076 states. [2022-04-28 10:18:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:57,902 INFO L93 Difference]: Finished difference Result 1076 states and 1372 transitions. [2022-04-28 10:18:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1372 transitions. [2022-04-28 10:18:57,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:57,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:57,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:57,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 489 states have (on average 1.3231083844580778) internal successors, (647), 489 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call 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,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 651 transitions. [2022-04-28 10:18:57,915 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 651 transitions. Word has length 40 [2022-04-28 10:18:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:57,915 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 651 transitions. [2022-04-28 10:18:57,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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:18:57,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 494 states and 651 transitions. [2022-04-28 10:19:01,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 651 edges. 651 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 651 transitions. [2022-04-28 10:19:01,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:19:01,207 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:19:01,207 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:19:01,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-04-28 10:19:01,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:01,412 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:19:01,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:19:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash -264974095, now seen corresponding path program 13 times [2022-04-28 10:19:01,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:01,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1956701749] [2022-04-28 10:19:01,414 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:19:01,414 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:19:01,414 INFO L85 PathProgramCache]: Analyzing trace with hash -264974095, now seen corresponding path program 14 times [2022-04-28 10:19:01,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:19:01,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142074129] [2022-04-28 10:19:01,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:19:01,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:19:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:01,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:19:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:01,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {157472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157452#true} is VALID [2022-04-28 10:19:01,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {157452#true} assume true; {157452#true} is VALID [2022-04-28 10:19:01,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {157452#true} {157452#true} #83#return; {157452#true} is VALID [2022-04-28 10:19:01,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {157452#true} call ULTIMATE.init(); {157472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:19:01,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {157472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157452#true} is VALID [2022-04-28 10:19:01,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {157452#true} assume true; {157452#true} is VALID [2022-04-28 10:19:01,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157452#true} {157452#true} #83#return; {157452#true} is VALID [2022-04-28 10:19:01,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {157452#true} call #t~ret15 := main(); {157452#true} is VALID [2022-04-28 10:19:01,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {157452#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:19:01,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157458#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-28 10:19:01,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {157458#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157459#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} is VALID [2022-04-28 10:19:01,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {157459#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157460#(and (<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 3 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 3) main_~n~0))} is VALID [2022-04-28 10:19:01,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {157460#(and (<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 3 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 3) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157461#(and (<= main_~x~0 (+ (* (div (+ main_~x~0 4 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:19:01,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {157461#(and (<= main_~x~0 (+ (* (div (+ main_~x~0 4 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= (+ 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; {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-28 10:19:01,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-28 10:19:01,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} ~z~0 := ~y~0; {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-28 10:19:01,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157464#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 1) main_~x~0))} is VALID [2022-04-28 10:19:01,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {157464#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 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; {157465#(and (<= (+ main_~x~0 3) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:19:01,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {157465#(and (<= (+ main_~x~0 3) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157466#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:19:01,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {157466#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157467#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 10:19:01,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {157467#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~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; {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-28 10:19:01,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-28 10:19:01,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) 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; {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-28 10:19:01,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) 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; {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-28 10:19:01,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) 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; {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-28 10:19:01,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) 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; {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-28 10:19:01,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) 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; {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-28 10:19:01,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} assume !(~y~0 % 4294967296 > 0); {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-28 10:19:01,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {157468#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157467#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 10:19:01,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {157467#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157466#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:19:01,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {157466#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157465#(and (<= (+ main_~x~0 3) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:19:01,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {157465#(and (<= (+ main_~x~0 3) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157464#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 1) main_~x~0))} is VALID [2022-04-28 10:19:01,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {157464#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 1) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-28 10:19:01,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-28 10:19:01,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {157463#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157464#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 1) main_~x~0))} is VALID [2022-04-28 10:19:01,994 INFO L290 TraceCheckUtils]: 32: Hoare triple {157464#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 1) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157465#(and (<= (+ main_~x~0 3) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-28 10:19:01,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {157465#(and (<= (+ main_~x~0 3) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157466#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:19:01,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {157466#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157467#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 10:19:01,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {157467#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:19:01,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:19:01,999 INFO L272 TraceCheckUtils]: 37: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {157470#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:19:01,999 INFO L290 TraceCheckUtils]: 38: Hoare triple {157470#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {157471#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:19:01,999 INFO L290 TraceCheckUtils]: 39: Hoare triple {157471#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {157453#false} is VALID [2022-04-28 10:19:01,999 INFO L290 TraceCheckUtils]: 40: Hoare triple {157453#false} assume !false; {157453#false} is VALID [2022-04-28 10:19:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:19:02,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:19:02,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142074129] [2022-04-28 10:19:02,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142074129] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:19:02,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001102709] [2022-04-28 10:19:02,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:19:02,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:02,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:19:02,001 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:19:02,002 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:19:02,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:19:02,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:19:02,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:19:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:02,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:19:02,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {157452#true} call ULTIMATE.init(); {157452#true} is VALID [2022-04-28 10:19:02,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {157452#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157452#true} is VALID [2022-04-28 10:19:02,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {157452#true} assume true; {157452#true} is VALID [2022-04-28 10:19:02,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157452#true} {157452#true} #83#return; {157452#true} is VALID [2022-04-28 10:19:02,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {157452#true} call #t~ret15 := main(); {157452#true} is VALID [2022-04-28 10:19:02,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {157452#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:19:02,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-28 10:19:02,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157498#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-28 10:19:02,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {157498#(= (+ 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; {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-28 10:19:02,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-28 10:19:02,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-28 10:19:02,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-28 10:19:02,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} ~z~0 := ~y~0; {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-28 10:19:02,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-28 10:19:02,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-28 10:19:02,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157498#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-28 10:19:02,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {157498#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-28 10:19:02,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:19:02,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:19:02,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:19:02,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:19:02,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:19:02,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:19:02,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:19:02,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:19:02,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-28 10:19:02,480 INFO L290 TraceCheckUtils]: 26: Hoare triple {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157498#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-28 10:19:02,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {157498#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-28 10:19:02,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-28 10:19:02,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-28 10:19:02,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-28 10:19:02,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {157462#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-28 10:19:02,483 INFO L290 TraceCheckUtils]: 32: Hoare triple {157506#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-28 10:19:02,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {157502#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157498#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-28 10:19:02,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {157498#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-28 10:19:02,485 INFO L290 TraceCheckUtils]: 35: Hoare triple {157494#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:19:02,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 10:19:02,486 INFO L272 TraceCheckUtils]: 37: Hoare triple {157457#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {157591#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:19:02,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {157591#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {157595#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:19:02,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {157595#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {157453#false} is VALID [2022-04-28 10:19:02,486 INFO L290 TraceCheckUtils]: 40: Hoare triple {157453#false} assume !false; {157453#false} is VALID [2022-04-28 10:19:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:19:02,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:19:03,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {157453#false} assume !false; {157453#false} is VALID [2022-04-28 10:19:03,091 INFO L290 TraceCheckUtils]: 39: Hoare triple {157595#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {157453#false} is VALID [2022-04-28 10:19:03,091 INFO L290 TraceCheckUtils]: 38: Hoare triple {157591#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {157595#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:19:03,092 INFO L272 TraceCheckUtils]: 37: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {157591#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:19:03,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:19:03,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:19:03,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:03,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:03,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-28 10:19:03,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:19:03,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:03,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:03,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:19:03,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-28 10:19:03,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:03,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:03,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:19:03,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:19:03,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:19:03,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:19:03,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:19:03,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:19:03,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:19:03,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:19:03,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:03,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:03,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-28 10:19:03,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:19:03,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} ~z~0 := ~y~0; {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:03,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:03,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157633#(and (<= (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) (+ main_~x~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:03,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157629#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:19:03,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157625#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-28 10:19:03,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157621#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:03,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157617#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 10:19:03,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {157452#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157469#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:19:03,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {157452#true} call #t~ret15 := main(); {157452#true} is VALID [2022-04-28 10:19:03,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157452#true} {157452#true} #83#return; {157452#true} is VALID [2022-04-28 10:19:03,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {157452#true} assume true; {157452#true} is VALID [2022-04-28 10:19:03,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {157452#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157452#true} is VALID [2022-04-28 10:19:03,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {157452#true} call ULTIMATE.init(); {157452#true} is VALID [2022-04-28 10:19:03,118 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:19:03,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001102709] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:19:03,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:19:03,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 29 [2022-04-28 10:19:03,118 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:19:03,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1956701749] [2022-04-28 10:19:03,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1956701749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:19:03,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:19:03,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:19:03,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195812617] [2022-04-28 10:19:03,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:19:03,119 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 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 41 [2022-04-28 10:19:03,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:19:03,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 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:19:03,213 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:19:03,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:19:03,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:03,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:19:03,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:19:03,214 INFO L87 Difference]: Start difference. First operand 494 states and 651 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 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:19:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:07,705 INFO L93 Difference]: Finished difference Result 506 states and 663 transitions. [2022-04-28 10:19:07,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:19:07,705 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 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 41 [2022-04-28 10:19:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:19:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 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:19:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 54 transitions. [2022-04-28 10:19:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 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:19:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 54 transitions. [2022-04-28 10:19:07,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 54 transitions. [2022-04-28 10:19:07,801 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:19:07,810 INFO L225 Difference]: With dead ends: 506 [2022-04-28 10:19:07,810 INFO L226 Difference]: Without dead ends: 495 [2022-04-28 10:19:07,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 65 SyntacticMatches, 17 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=171, Invalid=1551, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:19:07,811 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:19:07,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 66 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:19:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-04-28 10:19:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2022-04-28 10:19:10,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:19:10,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 495 states. Second operand has 495 states, 490 states have (on average 1.3224489795918368) internal successors, (648), 490 states have internal predecessors, (648), 3 states have call successors, (3), 3 states have call 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:10,525 INFO L74 IsIncluded]: Start isIncluded. First operand 495 states. Second operand has 495 states, 490 states have (on average 1.3224489795918368) internal successors, (648), 490 states have internal predecessors, (648), 3 states have call successors, (3), 3 states have call 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:10,525 INFO L87 Difference]: Start difference. First operand 495 states. Second operand has 495 states, 490 states have (on average 1.3224489795918368) internal successors, (648), 490 states have internal predecessors, (648), 3 states have call successors, (3), 3 states have call 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:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:10,533 INFO L93 Difference]: Finished difference Result 495 states and 652 transitions. [2022-04-28 10:19:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 652 transitions. [2022-04-28 10:19:10,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:10,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:10,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 490 states have (on average 1.3224489795918368) internal successors, (648), 490 states have internal predecessors, (648), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 495 states. [2022-04-28 10:19:10,534 INFO L87 Difference]: Start difference. First operand has 495 states, 490 states have (on average 1.3224489795918368) internal successors, (648), 490 states have internal predecessors, (648), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 495 states. [2022-04-28 10:19:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:10,541 INFO L93 Difference]: Finished difference Result 495 states and 652 transitions. [2022-04-28 10:19:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 652 transitions. [2022-04-28 10:19:10,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:10,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:10,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:19:10,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:19:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 490 states have (on average 1.3224489795918368) internal successors, (648), 490 states have internal predecessors, (648), 3 states have call successors, (3), 3 states have call 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:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 652 transitions. [2022-04-28 10:19:10,554 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 652 transitions. Word has length 41 [2022-04-28 10:19:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:19:10,555 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 652 transitions. [2022-04-28 10:19:10,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 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:19:10,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 495 states and 652 transitions. [2022-04-28 10:19:14,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 652 edges. 652 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 652 transitions. [2022-04-28 10:19:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:19:14,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:19:14,301 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:19:14,316 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:19:14,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:14,501 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:19:14,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:19:14,501 INFO L85 PathProgramCache]: Analyzing trace with hash 763864160, now seen corresponding path program 31 times [2022-04-28 10:19:14,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:14,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1664530706] [2022-04-28 10:19:14,504 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:19:14,504 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:19:14,504 INFO L85 PathProgramCache]: Analyzing trace with hash 763864160, now seen corresponding path program 32 times [2022-04-28 10:19:14,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:19:14,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212596629] [2022-04-28 10:19:14,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:19:14,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:19:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:14,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:19:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:14,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {160770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160747#true} is VALID [2022-04-28 10:19:14,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {160747#true} assume true; {160747#true} is VALID [2022-04-28 10:19:14,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {160747#true} {160747#true} #83#return; {160747#true} is VALID [2022-04-28 10:19:14,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {160747#true} call ULTIMATE.init(); {160770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:19:14,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {160770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160747#true} is VALID [2022-04-28 10:19:14,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {160747#true} assume true; {160747#true} is VALID [2022-04-28 10:19:14,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160747#true} {160747#true} #83#return; {160747#true} is VALID [2022-04-28 10:19:14,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {160747#true} call #t~ret15 := main(); {160747#true} is VALID [2022-04-28 10:19:14,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {160747#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160752#(= main_~y~0 0)} is VALID [2022-04-28 10:19:14,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {160752#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160753#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:14,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {160753#(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; {160754#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:14,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {160754#(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; {160755#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:14,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {160755#(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; {160756#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:14,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {160756#(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; {160757#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:14,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {160757#(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; {160758#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:14,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {160758#(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; {160759#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:14,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {160759#(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; {160760#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:14,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {160760#(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; {160761#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:14,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {160761#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {160761#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:14,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {160761#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {160762#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:19:14,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {160762#(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; {160763#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:19:14,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {160763#(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; {160764#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:19:14,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {160764#(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; {160765#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:19:14,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {160765#(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; {160766#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:19:14,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {160766#(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; {160767#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:19:14,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {160767#(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; {160768#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:19:14,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {160768#(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; {160769#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:19:14,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {160769#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-28 10:19:14,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-28 10:19:14,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-28 10:19:14,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-28 10:19:14,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-28 10:19:14,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-28 10:19:14,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-28 10:19:14,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-28 10:19:14,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-28 10:19:14,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {160748#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160748#false} is VALID [2022-04-28 10:19:14,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {160748#false} assume !(~y~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-28 10:19:14,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {160748#false} assume !(~x~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-28 10:19:14,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {160748#false} assume !(~z~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-28 10:19:14,834 INFO L272 TraceCheckUtils]: 37: Hoare triple {160748#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160748#false} is VALID [2022-04-28 10:19:14,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {160748#false} ~cond := #in~cond; {160748#false} is VALID [2022-04-28 10:19:14,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {160748#false} assume 0 == ~cond; {160748#false} is VALID [2022-04-28 10:19:14,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {160748#false} assume !false; {160748#false} is VALID [2022-04-28 10:19:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:19:14,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:19:14,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212596629] [2022-04-28 10:19:14,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212596629] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:19:14,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402871267] [2022-04-28 10:19:14,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:19:14,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:14,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:19:14,836 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:19:14,837 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:19:14,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:19:14,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:19:14,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:19:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:14,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:19:15,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {160747#true} call ULTIMATE.init(); {160747#true} is VALID [2022-04-28 10:19:15,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {160747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160747#true} is VALID [2022-04-28 10:19:15,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {160747#true} assume true; {160747#true} is VALID [2022-04-28 10:19:15,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160747#true} {160747#true} #83#return; {160747#true} is VALID [2022-04-28 10:19:15,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {160747#true} call #t~ret15 := main(); {160747#true} is VALID [2022-04-28 10:19:15,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {160747#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160747#true} is VALID [2022-04-28 10:19:15,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {160747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160747#true} is VALID [2022-04-28 10:19:15,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {160747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160747#true} is VALID [2022-04-28 10:19:15,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {160747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:19:15,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:19:15,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {160802#(< 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; {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:19:15,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:19:15,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:15,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:19:15,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:15,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:15,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:15,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:19:15,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:15,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:19:15,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:19:15,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:19:15,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {160802#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:19:15,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-28 10:19:15,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {160748#false} assume !(~z~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-28 10:19:15,178 INFO L272 TraceCheckUtils]: 37: Hoare triple {160748#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160748#false} is VALID [2022-04-28 10:19:15,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {160748#false} ~cond := #in~cond; {160748#false} is VALID [2022-04-28 10:19:15,178 INFO L290 TraceCheckUtils]: 39: Hoare triple {160748#false} assume 0 == ~cond; {160748#false} is VALID [2022-04-28 10:19:15,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {160748#false} assume !false; {160748#false} is VALID [2022-04-28 10:19:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 10:19:15,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:19:15,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {160748#false} assume !false; {160748#false} is VALID [2022-04-28 10:19:15,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {160748#false} assume 0 == ~cond; {160748#false} is VALID [2022-04-28 10:19:15,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {160748#false} ~cond := #in~cond; {160748#false} is VALID [2022-04-28 10:19:15,304 INFO L272 TraceCheckUtils]: 37: Hoare triple {160748#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160748#false} is VALID [2022-04-28 10:19:15,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {160748#false} assume !(~z~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-28 10:19:15,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {160748#false} is VALID [2022-04-28 10:19:15,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {160850#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160850#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:15,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {160802#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:19:15,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:19:15,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:19:15,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:19:15,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:15,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:19:15,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:15,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:15,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160822#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:15,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160818#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:19:15,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160814#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:15,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160810#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:19:15,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {160802#(< 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; {160806#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:19:15,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160802#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:19:15,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {160747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160798#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:19:15,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {160747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160747#true} is VALID [2022-04-28 10:19:15,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {160747#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160747#true} is VALID [2022-04-28 10:19:15,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {160747#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160747#true} is VALID [2022-04-28 10:19:15,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {160747#true} call #t~ret15 := main(); {160747#true} is VALID [2022-04-28 10:19:15,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160747#true} {160747#true} #83#return; {160747#true} is VALID [2022-04-28 10:19:15,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {160747#true} assume true; {160747#true} is VALID [2022-04-28 10:19:15,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {160747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160747#true} is VALID [2022-04-28 10:19:15,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {160747#true} call ULTIMATE.init(); {160747#true} is VALID [2022-04-28 10:19:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 10:19:15,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402871267] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:19:15,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:19:15,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 10] total 29 [2022-04-28 10:19:15,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:19:15,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1664530706] [2022-04-28 10:19:15,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1664530706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:19:15,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:19:15,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:19:15,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190651414] [2022-04-28 10:19:15,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:19:15,317 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 41 [2022-04-28 10:19:15,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:19:15,318 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:19:15,338 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:19:15,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:19:15,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:15,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:19:15,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=750, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:19:15,339 INFO L87 Difference]: Start difference. First operand 495 states and 652 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:19:27,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:27,450 INFO L93 Difference]: Finished difference Result 712 states and 919 transitions. [2022-04-28 10:19:27,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 10:19:27,450 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 41 [2022-04-28 10:19:27,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:19:27,450 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:19:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 155 transitions. [2022-04-28 10:19:27,451 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:19:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 155 transitions. [2022-04-28 10:19:27,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 155 transitions. [2022-04-28 10:19:27,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:27,589 INFO L225 Difference]: With dead ends: 712 [2022-04-28 10:19:27,589 INFO L226 Difference]: Without dead ends: 654 [2022-04-28 10:19:27,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=332, Invalid=4360, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 10:19:27,590 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 95 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2002 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:19:27,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 153 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2002 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 10:19:27,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-04-28 10:19:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 496. [2022-04-28 10:19:30,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:19:30,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 654 states. Second operand has 496 states, 491 states have (on average 1.3156822810590632) internal successors, (646), 491 states have internal predecessors, (646), 3 states have call successors, (3), 3 states have call 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:30,254 INFO L74 IsIncluded]: Start isIncluded. First operand 654 states. Second operand has 496 states, 491 states have (on average 1.3156822810590632) internal successors, (646), 491 states have internal predecessors, (646), 3 states have call successors, (3), 3 states have call 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:30,254 INFO L87 Difference]: Start difference. First operand 654 states. Second operand has 496 states, 491 states have (on average 1.3156822810590632) internal successors, (646), 491 states have internal predecessors, (646), 3 states have call successors, (3), 3 states have call 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:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:30,267 INFO L93 Difference]: Finished difference Result 654 states and 856 transitions. [2022-04-28 10:19:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 856 transitions. [2022-04-28 10:19:30,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:30,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:30,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 496 states, 491 states have (on average 1.3156822810590632) internal successors, (646), 491 states have internal predecessors, (646), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 654 states. [2022-04-28 10:19:30,268 INFO L87 Difference]: Start difference. First operand has 496 states, 491 states have (on average 1.3156822810590632) internal successors, (646), 491 states have internal predecessors, (646), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 654 states. [2022-04-28 10:19:30,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:30,280 INFO L93 Difference]: Finished difference Result 654 states and 856 transitions. [2022-04-28 10:19:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 856 transitions. [2022-04-28 10:19:30,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:30,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:30,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:19:30,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:19:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 491 states have (on average 1.3156822810590632) internal successors, (646), 491 states have internal predecessors, (646), 3 states have call successors, (3), 3 states have call 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:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 650 transitions. [2022-04-28 10:19:30,290 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 650 transitions. Word has length 41 [2022-04-28 10:19:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:19:30,290 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 650 transitions. [2022-04-28 10:19:30,290 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:19:30,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 496 states and 650 transitions. [2022-04-28 10:19:33,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 650 edges. 650 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:33,730 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 650 transitions. [2022-04-28 10:19:33,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:19:33,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:19:33,731 INFO L195 NwaCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:19:33,747 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:19:33,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:33,943 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:19:33,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:19:33,944 INFO L85 PathProgramCache]: Analyzing trace with hash -82492785, now seen corresponding path program 49 times [2022-04-28 10:19:33,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:33,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [683507815] [2022-04-28 10:19:33,945 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:19:33,946 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:19:33,946 INFO L85 PathProgramCache]: Analyzing trace with hash -82492785, now seen corresponding path program 50 times [2022-04-28 10:19:33,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:19:33,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583586861] [2022-04-28 10:19:33,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:19:33,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:19:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:34,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:19:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:34,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {164860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {164828#true} is VALID [2022-04-28 10:19:34,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {164828#true} assume true; {164828#true} is VALID [2022-04-28 10:19:34,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {164828#true} {164828#true} #83#return; {164828#true} is VALID [2022-04-28 10:19:34,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {164828#true} call ULTIMATE.init(); {164860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:19:34,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {164860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {164828#true} is VALID [2022-04-28 10:19:34,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {164828#true} assume true; {164828#true} is VALID [2022-04-28 10:19:34,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164828#true} {164828#true} #83#return; {164828#true} is VALID [2022-04-28 10:19:34,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {164828#true} call #t~ret15 := main(); {164828#true} is VALID [2022-04-28 10:19:34,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {164828#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {164833#(= main_~y~0 0)} is VALID [2022-04-28 10:19:34,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {164833#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164834#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:34,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {164834#(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; {164835#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:34,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {164835#(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; {164836#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:34,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {164836#(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; {164837#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:34,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {164837#(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; {164838#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:34,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {164838#(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; {164839#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:34,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {164839#(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; {164840#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:34,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {164840#(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; {164841#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:34,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {164841#(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; {164842#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:34,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {164842#(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; {164843#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:34,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {164843#(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; {164844#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:34,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {164844#(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; {164845#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:19:34,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {164845#(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; {164846#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:19:34,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {164846#(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; {164847#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:19:34,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {164847#(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; {164848#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:19:34,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {164848#(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; {164849#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:19:34,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {164849#(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; {164850#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:19:34,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {164850#(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; {164851#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:19:34,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {164851#(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; {164852#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:19:34,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {164852#(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; {164853#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:19:34,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {164853#(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; {164854#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:19:34,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {164854#(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; {164855#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:19:34,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {164855#(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; {164856#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:19:34,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {164856#(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; {164857#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:19:34,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {164857#(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; {164858#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:19:34,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {164858#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {164858#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:19:34,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {164858#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {164859#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:19:34,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {164859#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {164829#false} is VALID [2022-04-28 10:19:34,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {164829#false} assume !(~y~0 % 4294967296 > 0); {164829#false} is VALID [2022-04-28 10:19:34,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {164829#false} assume !(~x~0 % 4294967296 > 0); {164829#false} is VALID [2022-04-28 10:19:34,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {164829#false} assume !(~z~0 % 4294967296 > 0); {164829#false} is VALID [2022-04-28 10:19:34,421 INFO L272 TraceCheckUtils]: 37: Hoare triple {164829#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {164829#false} is VALID [2022-04-28 10:19:34,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {164829#false} ~cond := #in~cond; {164829#false} is VALID [2022-04-28 10:19:34,421 INFO L290 TraceCheckUtils]: 39: Hoare triple {164829#false} assume 0 == ~cond; {164829#false} is VALID [2022-04-28 10:19:34,421 INFO L290 TraceCheckUtils]: 40: Hoare triple {164829#false} assume !false; {164829#false} is VALID [2022-04-28 10:19:34,421 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:19:34,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:19:34,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583586861] [2022-04-28 10:19:34,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583586861] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:19:34,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302149971] [2022-04-28 10:19:34,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:19:34,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:34,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:19:34,422 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:19:34,423 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:19:34,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:19:34,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:19:34,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-28 10:19:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:34,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:19:34,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {164828#true} call ULTIMATE.init(); {164828#true} is VALID [2022-04-28 10:19:34,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {164828#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {164828#true} is VALID [2022-04-28 10:19:34,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {164828#true} assume true; {164828#true} is VALID [2022-04-28 10:19:34,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164828#true} {164828#true} #83#return; {164828#true} is VALID [2022-04-28 10:19:34,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {164828#true} call #t~ret15 := main(); {164828#true} is VALID [2022-04-28 10:19:34,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {164828#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {164833#(= main_~y~0 0)} is VALID [2022-04-28 10:19:34,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {164833#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164834#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:34,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {164834#(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; {164835#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:34,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {164835#(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; {164836#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:34,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {164836#(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; {164837#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:34,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {164837#(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; {164838#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:34,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {164838#(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; {164839#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:34,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {164839#(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; {164840#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:34,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {164840#(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; {164841#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:34,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {164841#(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; {164842#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:34,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {164842#(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; {164843#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:34,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {164843#(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; {164844#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:34,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {164844#(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; {164845#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:19:34,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {164845#(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; {164846#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:19:34,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {164846#(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; {164847#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:19:34,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {164847#(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; {164848#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:19:34,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {164848#(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; {164849#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:19:34,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {164849#(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; {164850#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:19:34,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {164850#(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; {164851#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:19:34,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {164851#(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; {164852#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:19:34,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {164852#(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; {164853#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:19:34,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {164853#(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; {164854#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:19:34,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {164854#(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; {164855#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:19:34,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {164855#(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; {164856#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:19:34,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {164856#(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; {164857#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:19:34,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {164857#(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; {164858#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:19:34,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {164858#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {164858#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:19:34,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {164858#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {164960#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-28 10:19:34,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {164960#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !(~z~0 % 4294967296 > 0); {164829#false} is VALID [2022-04-28 10:19:34,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {164829#false} assume !(~y~0 % 4294967296 > 0); {164829#false} is VALID [2022-04-28 10:19:34,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {164829#false} assume !(~x~0 % 4294967296 > 0); {164829#false} is VALID [2022-04-28 10:19:34,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {164829#false} assume !(~z~0 % 4294967296 > 0); {164829#false} is VALID [2022-04-28 10:19:34,846 INFO L272 TraceCheckUtils]: 37: Hoare triple {164829#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {164829#false} is VALID [2022-04-28 10:19:34,846 INFO L290 TraceCheckUtils]: 38: Hoare triple {164829#false} ~cond := #in~cond; {164829#false} is VALID [2022-04-28 10:19:34,846 INFO L290 TraceCheckUtils]: 39: Hoare triple {164829#false} assume 0 == ~cond; {164829#false} is VALID [2022-04-28 10:19:34,846 INFO L290 TraceCheckUtils]: 40: Hoare triple {164829#false} assume !false; {164829#false} is VALID [2022-04-28 10:19:34,846 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:19:34,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:19:35,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {164829#false} assume !false; {164829#false} is VALID [2022-04-28 10:19:35,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {164829#false} assume 0 == ~cond; {164829#false} is VALID [2022-04-28 10:19:35,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {164829#false} ~cond := #in~cond; {164829#false} is VALID [2022-04-28 10:19:35,979 INFO L272 TraceCheckUtils]: 37: Hoare triple {164829#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {164829#false} is VALID [2022-04-28 10:19:35,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {164829#false} assume !(~z~0 % 4294967296 > 0); {164829#false} is VALID [2022-04-28 10:19:35,979 INFO L290 TraceCheckUtils]: 35: Hoare triple {164829#false} assume !(~x~0 % 4294967296 > 0); {164829#false} is VALID [2022-04-28 10:19:35,979 INFO L290 TraceCheckUtils]: 34: Hoare triple {164829#false} assume !(~y~0 % 4294967296 > 0); {164829#false} is VALID [2022-04-28 10:19:35,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {165006#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {164829#false} is VALID [2022-04-28 10:19:35,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {165010#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {165006#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:35,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {165010#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {165010#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:19:35,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {165017#(< 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; {165010#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:19:35,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {165021#(< 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; {165017#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:19:35,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {165025#(< 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; {165021#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:19:35,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {165029#(< 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; {165025#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:19:35,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {165033#(< 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; {165029#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:19:35,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {165037#(< 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; {165033#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:35,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {165041#(< 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; {165037#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:19:35,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {165045#(< 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; {165041#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:35,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {165049#(< 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; {165045#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:19:35,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {165053#(< 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; {165049#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:19:35,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {165057#(< 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; {165053#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:19:35,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {165061#(< 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; {165057#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:19:35,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {165065#(< 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; {165061#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:19:35,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {165069#(< 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; {165065#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:19:35,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {165073#(< 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; {165069#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:19:35,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {165077#(< 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; {165073#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:19:35,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {165081#(< 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; {165077#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:19:35,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {165085#(< 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; {165081#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:19:35,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {165089#(< 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; {165085#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:19:35,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {165093#(< 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; {165089#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:35,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {165097#(< 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; {165093#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:19:35,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {165101#(< 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; {165097#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:19:35,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {165105#(< 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; {165101#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:19:35,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {165109#(< 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; {165105#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:19:35,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {165113#(< 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; {165109#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:19:35,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {164828#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {165113#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:19:35,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {164828#true} call #t~ret15 := main(); {164828#true} is VALID [2022-04-28 10:19:35,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164828#true} {164828#true} #83#return; {164828#true} is VALID [2022-04-28 10:19:35,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {164828#true} assume true; {164828#true} is VALID [2022-04-28 10:19:35,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {164828#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {164828#true} is VALID [2022-04-28 10:19:35,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {164828#true} call ULTIMATE.init(); {164828#true} is VALID [2022-04-28 10:19:35,995 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:19:35,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302149971] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:19:35,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:19:35,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-28 10:19:35,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:19:35,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [683507815] [2022-04-28 10:19:35,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [683507815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:19:35,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:19:35,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 10:19:35,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202484550] [2022-04-28 10:19:35,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:19:35,996 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 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:19:35,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:19:35,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 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:19:36,018 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:19:36,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 10:19:36,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:36,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 10:19:36,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=791, Invalid=2515, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:19:36,019 INFO L87 Difference]: Start difference. First operand 496 states and 650 transitions. Second operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 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:20:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:05,633 INFO L93 Difference]: Finished difference Result 1157 states and 1657 transitions. [2022-04-28 10:20:05,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 10:20:05,633 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 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:20:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:20:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 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:20:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 325 transitions. [2022-04-28 10:20:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 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:20:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 325 transitions. [2022-04-28 10:20:05,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 325 transitions. [2022-04-28 10:20:05,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:05,932 INFO L225 Difference]: With dead ends: 1157 [2022-04-28 10:20:05,932 INFO L226 Difference]: Without dead ends: 1117 [2022-04-28 10:20:05,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1603, Invalid=5537, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 10:20:05,933 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 292 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7152 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 7301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 7152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:20:05,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 312 Invalid, 7301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 7152 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-28 10:20:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2022-04-28 10:20:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 513. [2022-04-28 10:20:08,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:20:08,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1117 states. Second operand has 513 states, 508 states have (on average 1.3208661417322836) internal successors, (671), 508 states have internal predecessors, (671), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:08,682 INFO L74 IsIncluded]: Start isIncluded. First operand 1117 states. Second operand has 513 states, 508 states have (on average 1.3208661417322836) internal successors, (671), 508 states have internal predecessors, (671), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:08,682 INFO L87 Difference]: Start difference. First operand 1117 states. Second operand has 513 states, 508 states have (on average 1.3208661417322836) internal successors, (671), 508 states have internal predecessors, (671), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:08,721 INFO L93 Difference]: Finished difference Result 1117 states and 1423 transitions. [2022-04-28 10:20:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1423 transitions. [2022-04-28 10:20:08,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:08,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:08,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 513 states, 508 states have (on average 1.3208661417322836) internal successors, (671), 508 states have internal predecessors, (671), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1117 states. [2022-04-28 10:20:08,723 INFO L87 Difference]: Start difference. First operand has 513 states, 508 states have (on average 1.3208661417322836) internal successors, (671), 508 states have internal predecessors, (671), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1117 states. [2022-04-28 10:20:08,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:08,765 INFO L93 Difference]: Finished difference Result 1117 states and 1423 transitions. [2022-04-28 10:20:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1423 transitions. [2022-04-28 10:20:08,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:08,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:08,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:20:08,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:20:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 508 states have (on average 1.3208661417322836) internal successors, (671), 508 states have internal predecessors, (671), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 675 transitions. [2022-04-28 10:20:08,779 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 675 transitions. Word has length 41 [2022-04-28 10:20:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:20:08,779 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 675 transitions. [2022-04-28 10:20:08,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 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:20:08,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 513 states and 675 transitions.