/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de61.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:13:20,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:13:20,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:13:20,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:13:20,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:13:20,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:13:20,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:13:20,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:13:20,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:13:20,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:13:20,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:13:20,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:13:20,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:13:20,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:13:20,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:13:20,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:13:20,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:13:20,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:13:20,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:13:20,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:13:20,197 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:13:20,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:13:20,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:13:20,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:13:20,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:13:20,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:13:20,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:13:20,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:13:20,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:13:20,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:13:20,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:13:20,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:13:20,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:13:20,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:13:20,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:13:20,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:13:20,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:13:20,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:13:20,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:13:20,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:13:20,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:13:20,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:13:20,214 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:13:20,242 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:13:20,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:13:20,242 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:13:20,242 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:13:20,243 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:13:20,243 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:13:20,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:13:20,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:13:20,243 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:13:20,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:13:20,244 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:13:20,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:13:20,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:13:20,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:13:20,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:13:20,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:13:20,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:13:20,244 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:13:20,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:13:20,244 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:13:20,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:13:20,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:13:20,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:13:20,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:13:20,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:13:20,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:13:20,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:13:20,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:13:20,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:13:20,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:13:20,245 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:13:20,245 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:13:20,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:13:20,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:13:20,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:13:20,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:13:20,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:13:20,425 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:13:20,431 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:13:20,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-04-27 11:13:20,478 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/421971b56/124e7d29b70743cb8496349f4a495c4d/FLAG6f3a1fde1 [2022-04-27 11:13:20,867 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:13:20,867 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-04-27 11:13:20,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/421971b56/124e7d29b70743cb8496349f4a495c4d/FLAG6f3a1fde1 [2022-04-27 11:13:21,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/421971b56/124e7d29b70743cb8496349f4a495c4d [2022-04-27 11:13:21,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:13:21,292 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:13:21,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:13:21,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:13:21,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:13:21,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:13:21" (1/1) ... [2022-04-27 11:13:21,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4719fa98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:21, skipping insertion in model container [2022-04-27 11:13:21,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:13:21" (1/1) ... [2022-04-27 11:13:21,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:13:21,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:13:21,484 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-de61.c[368,381] [2022-04-27 11:13:21,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:13:21,515 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:13:21,522 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-de61.c[368,381] [2022-04-27 11:13:21,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:13:21,534 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:13:21,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:21 WrapperNode [2022-04-27 11:13:21,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:13:21,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:13:21,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:13:21,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:13:21,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:21" (1/1) ... [2022-04-27 11:13:21,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:21" (1/1) ... [2022-04-27 11:13:21,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:21" (1/1) ... [2022-04-27 11:13:21,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:21" (1/1) ... [2022-04-27 11:13:21,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:21" (1/1) ... [2022-04-27 11:13:21,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:21" (1/1) ... [2022-04-27 11:13:21,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:21" (1/1) ... [2022-04-27 11:13:21,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:13:21,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:13:21,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:13:21,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:13:21,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:21" (1/1) ... [2022-04-27 11:13:21,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:13:21,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:21,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 11:13:21,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 11:13:21,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:13:21,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:13:21,625 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:13:21,626 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:13:21,627 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:13:21,627 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:13:21,627 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:13:21,627 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:13:21,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:13:21,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 11:13:21,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:13:21,627 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:13:21,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:13:21,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:13:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:13:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:13:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:13:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:13:21,676 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:13:21,677 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:13:21,910 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:13:21,915 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:13:21,915 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-27 11:13:21,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:13:21 BoogieIcfgContainer [2022-04-27 11:13:21,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:13:21,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:13:21,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:13:21,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:13:21,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:13:21" (1/3) ... [2022-04-27 11:13:21,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116e71e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:13:21, skipping insertion in model container [2022-04-27 11:13:21,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:21" (2/3) ... [2022-04-27 11:13:21,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116e71e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:13:21, skipping insertion in model container [2022-04-27 11:13:21,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:13:21" (3/3) ... [2022-04-27 11:13:21,926 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de61.c [2022-04-27 11:13:21,936 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:13:21,937 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:13:21,979 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:13:21,985 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5ed5541d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f8c0d95 [2022-04-27 11:13:21,986 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:13:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:13:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:13:21,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:21,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:21,999 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:22,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:22,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 1 times [2022-04-27 11:13:22,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:22,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502188781] [2022-04-27 11:13:22,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:22,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:22,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:22,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-27 11:13:22,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-27 11:13:22,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-27 11:13:22,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:22,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-27 11:13:22,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-27 11:13:22,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-27 11:13:22,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret17 := main(); {28#true} is VALID [2022-04-27 11:13:22,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28#true} is VALID [2022-04-27 11:13:22,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !(~x~0 % 4294967296 > 0); {28#true} is VALID [2022-04-27 11:13:22,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} ~z~0 := ~y~0; {28#true} is VALID [2022-04-27 11:13:22,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} assume !(~z~0 % 4294967296 > 0); {28#true} is VALID [2022-04-27 11:13:22,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} assume !(~y~0 % 4294967296 > 0); {28#true} is VALID [2022-04-27 11:13:22,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-27 11:13:22,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !(~z~0 % 4294967296 > 0); {29#false} is VALID [2022-04-27 11:13:22,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !(~y~0 % 4294967296 > 0); {29#false} is VALID [2022-04-27 11:13:22,205 INFO L272 TraceCheckUtils]: 13: Hoare triple {29#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29#false} is VALID [2022-04-27 11:13:22,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-27 11:13:22,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-27 11:13:22,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-27 11:13:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:22,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:22,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502188781] [2022-04-27 11:13:22,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502188781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:13:22,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:13:22,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:13:22,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410512260] [2022-04-27 11:13:22,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:22,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:13:22,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:22,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:22,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:13:22,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:22,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:13:22,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:13:22,269 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:22,349 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2022-04-27 11:13:22,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:13:22,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:13:22,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-27 11:13:22,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-27 11:13:22,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-27 11:13:22,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:22,426 INFO L225 Difference]: With dead ends: 43 [2022-04-27 11:13:22,427 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 11:13:22,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:13:22,431 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:22,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 11:13:22,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 11:13:22,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:22,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,450 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,451 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:22,453 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-27 11:13:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-27 11:13:22,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:22,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:22,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 11:13:22,454 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 11:13:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:22,457 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-27 11:13:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-27 11:13:22,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:22,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:22,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:22,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-04-27 11:13:22,461 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-04-27 11:13:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:22,461 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-04-27 11:13:22,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-27 11:13:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:13:22,462 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:22,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:22,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:13:22,462 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:22,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:22,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 1 times [2022-04-27 11:13:22,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:22,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772844107] [2022-04-27 11:13:22,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:22,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:22,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:22,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {152#true} is VALID [2022-04-27 11:13:22,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} assume true; {152#true} is VALID [2022-04-27 11:13:22,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {152#true} {152#true} #94#return; {152#true} is VALID [2022-04-27 11:13:22,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:22,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {152#true} is VALID [2022-04-27 11:13:22,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume true; {152#true} is VALID [2022-04-27 11:13:22,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} #94#return; {152#true} is VALID [2022-04-27 11:13:22,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {152#true} call #t~ret17 := main(); {152#true} is VALID [2022-04-27 11:13:22,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:13:22,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {158#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 11:13:22,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {158#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {159#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:22,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {159#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {159#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:22,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {159#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {159#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:22,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {159#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~x~0 % 4294967296 > 0); {160#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:22,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {160#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {160#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:22,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {160#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {160#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:22,887 INFO L272 TraceCheckUtils]: 13: Hoare triple {160#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:13:22,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {161#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {162#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:13:22,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {162#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {153#false} is VALID [2022-04-27 11:13:22,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-04-27 11:13:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:22,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:22,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772844107] [2022-04-27 11:13:22,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772844107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:13:22,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:13:22,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 11:13:22,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902746835] [2022-04-27 11:13:22,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:22,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:13:22,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:22,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:22,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:13:22,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:22,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:13:22,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:13:22,918 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:23,195 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-27 11:13:23,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:13:23,195 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:13:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-27 11:13:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-27 11:13:23,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-27 11:13:23,258 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-27 11:13:23,261 INFO L225 Difference]: With dead ends: 38 [2022-04-27 11:13:23,261 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 11:13:23,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:13:23,266 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:23,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 36 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:13:23,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 11:13:23,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-27 11:13:23,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:23,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,271 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,272 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:23,274 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-27 11:13:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-27 11:13:23,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:23,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:23,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-27 11:13:23,275 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-27 11:13:23,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:23,276 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-27 11:13:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-27 11:13:23,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:23,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:23,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:23,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-27 11:13:23,278 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 17 [2022-04-27 11:13:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:23,279 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-27 11:13:23,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-27 11:13:23,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 11:13:23,282 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:23,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:23,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:13:23,282 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:23,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:23,283 INFO L85 PathProgramCache]: Analyzing trace with hash -121895178, now seen corresponding path program 1 times [2022-04-27 11:13:23,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:23,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583253823] [2022-04-27 11:13:23,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:23,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:23,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:23,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {295#true} is VALID [2022-04-27 11:13:23,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-27 11:13:23,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {295#true} {295#true} #94#return; {295#true} is VALID [2022-04-27 11:13:23,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} call ULTIMATE.init(); {303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:23,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {295#true} is VALID [2022-04-27 11:13:23,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-27 11:13:23,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295#true} {295#true} #94#return; {295#true} is VALID [2022-04-27 11:13:23,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {295#true} call #t~ret17 := main(); {295#true} is VALID [2022-04-27 11:13:23,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {300#(= main_~y~0 0)} is VALID [2022-04-27 11:13:23,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {300#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:23,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:23,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {302#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:23,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {302#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {296#false} is VALID [2022-04-27 11:13:23,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#false} assume !(~y~0 % 4294967296 > 0); {296#false} is VALID [2022-04-27 11:13:23,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#false} assume !(~x~0 % 4294967296 > 0); {296#false} is VALID [2022-04-27 11:13:23,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#false} assume !(~z~0 % 4294967296 > 0); {296#false} is VALID [2022-04-27 11:13:23,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {296#false} assume !(~y~0 % 4294967296 > 0); {296#false} is VALID [2022-04-27 11:13:23,406 INFO L272 TraceCheckUtils]: 14: Hoare triple {296#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {296#false} is VALID [2022-04-27 11:13:23,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {296#false} ~cond := #in~cond; {296#false} is VALID [2022-04-27 11:13:23,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {296#false} assume 0 == ~cond; {296#false} is VALID [2022-04-27 11:13:23,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-04-27 11:13:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:23,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:23,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583253823] [2022-04-27 11:13:23,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583253823] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:23,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664196082] [2022-04-27 11:13:23,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:23,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:23,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:23,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:13:23,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 11:13:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:23,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:13:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:23,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:23,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} call ULTIMATE.init(); {295#true} is VALID [2022-04-27 11:13:23,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {295#true} is VALID [2022-04-27 11:13:23,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-27 11:13:23,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295#true} {295#true} #94#return; {295#true} is VALID [2022-04-27 11:13:23,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {295#true} call #t~ret17 := main(); {295#true} is VALID [2022-04-27 11:13:23,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {300#(= main_~y~0 0)} is VALID [2022-04-27 11:13:23,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {300#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:23,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:23,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {331#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:23,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {296#false} is VALID [2022-04-27 11:13:23,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#false} assume !(~y~0 % 4294967296 > 0); {296#false} is VALID [2022-04-27 11:13:23,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#false} assume !(~x~0 % 4294967296 > 0); {296#false} is VALID [2022-04-27 11:13:23,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#false} assume !(~z~0 % 4294967296 > 0); {296#false} is VALID [2022-04-27 11:13:23,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {296#false} assume !(~y~0 % 4294967296 > 0); {296#false} is VALID [2022-04-27 11:13:23,730 INFO L272 TraceCheckUtils]: 14: Hoare triple {296#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {296#false} is VALID [2022-04-27 11:13:23,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {296#false} ~cond := #in~cond; {296#false} is VALID [2022-04-27 11:13:23,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {296#false} assume 0 == ~cond; {296#false} is VALID [2022-04-27 11:13:23,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-04-27 11:13:23,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:23,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:23,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-04-27 11:13:23,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {296#false} assume 0 == ~cond; {296#false} is VALID [2022-04-27 11:13:23,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {296#false} ~cond := #in~cond; {296#false} is VALID [2022-04-27 11:13:23,833 INFO L272 TraceCheckUtils]: 14: Hoare triple {296#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {296#false} is VALID [2022-04-27 11:13:23,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {296#false} assume !(~y~0 % 4294967296 > 0); {296#false} is VALID [2022-04-27 11:13:23,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#false} assume !(~z~0 % 4294967296 > 0); {296#false} is VALID [2022-04-27 11:13:23,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#false} assume !(~x~0 % 4294967296 > 0); {296#false} is VALID [2022-04-27 11:13:23,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#false} assume !(~y~0 % 4294967296 > 0); {296#false} is VALID [2022-04-27 11:13:23,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {383#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {296#false} is VALID [2022-04-27 11:13:23,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {387#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {383#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:23,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {387#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {387#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:23,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {394#(< 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; {387#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:23,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {394#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:13:23,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {295#true} call #t~ret17 := main(); {295#true} is VALID [2022-04-27 11:13:23,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295#true} {295#true} #94#return; {295#true} is VALID [2022-04-27 11:13:23,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-27 11:13:23,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {295#true} is VALID [2022-04-27 11:13:23,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} call ULTIMATE.init(); {295#true} is VALID [2022-04-27 11:13:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:23,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664196082] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:23,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:23,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-27 11:13:23,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397266468] [2022-04-27 11:13:23,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:23,842 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 11:13:23,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:23,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:23,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:13:23,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:23,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:13:23,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:13:23,866 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:24,290 INFO L93 Difference]: Finished difference Result 61 states and 98 transitions. [2022-04-27 11:13:24,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:13:24,290 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 11:13:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2022-04-27 11:13:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2022-04-27 11:13:24,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 98 transitions. [2022-04-27 11:13:24,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:24,378 INFO L225 Difference]: With dead ends: 61 [2022-04-27 11:13:24,378 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 11:13:24,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:13:24,379 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 83 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:24,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 45 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:13:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 11:13:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-27 11:13:24,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:24,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,411 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,411 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:24,413 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2022-04-27 11:13:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2022-04-27 11:13:24,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:24,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:24,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-27 11:13:24,414 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-27 11:13:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:24,416 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2022-04-27 11:13:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2022-04-27 11:13:24,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:24,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:24,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:24,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2022-04-27 11:13:24,418 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 18 [2022-04-27 11:13:24,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:24,418 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2022-04-27 11:13:24,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2022-04-27 11:13:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:13:24,419 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:24,419 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-27 11:13:24,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:13:24,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:24,639 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:24,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:24,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1992076293, now seen corresponding path program 1 times [2022-04-27 11:13:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:24,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800300786] [2022-04-27 11:13:24,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:24,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:24,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:24,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {675#true} is VALID [2022-04-27 11:13:24,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume true; {675#true} is VALID [2022-04-27 11:13:24,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {675#true} {675#true} #94#return; {675#true} is VALID [2022-04-27 11:13:24,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {675#true} call ULTIMATE.init(); {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:24,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {675#true} is VALID [2022-04-27 11:13:24,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} assume true; {675#true} is VALID [2022-04-27 11:13:24,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {675#true} {675#true} #94#return; {675#true} is VALID [2022-04-27 11:13:24,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {675#true} call #t~ret17 := main(); {675#true} is VALID [2022-04-27 11:13:24,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {680#(= main_~y~0 0)} is VALID [2022-04-27 11:13:24,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {680#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {681#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:24,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {681#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {681#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:24,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {681#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {682#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:24,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#(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; {683#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:24,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {683#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {683#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:24,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {683#(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; {684#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:24,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {684#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {684#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:24,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {684#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {684#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:24,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {684#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {676#false} is VALID [2022-04-27 11:13:24,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {676#false} assume !(~y~0 % 4294967296 > 0); {676#false} is VALID [2022-04-27 11:13:24,733 INFO L272 TraceCheckUtils]: 16: Hoare triple {676#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {676#false} is VALID [2022-04-27 11:13:24,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {676#false} ~cond := #in~cond; {676#false} is VALID [2022-04-27 11:13:24,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {676#false} assume 0 == ~cond; {676#false} is VALID [2022-04-27 11:13:24,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {676#false} assume !false; {676#false} is VALID [2022-04-27 11:13:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:24,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:24,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800300786] [2022-04-27 11:13:24,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800300786] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:24,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170011294] [2022-04-27 11:13:24,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:24,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:24,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:24,756 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:13:24,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 11:13:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:24,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:13:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:24,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:24,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {675#true} call ULTIMATE.init(); {675#true} is VALID [2022-04-27 11:13:24,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {675#true} is VALID [2022-04-27 11:13:24,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} assume true; {675#true} is VALID [2022-04-27 11:13:24,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {675#true} {675#true} #94#return; {675#true} is VALID [2022-04-27 11:13:24,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {675#true} call #t~ret17 := main(); {675#true} is VALID [2022-04-27 11:13:24,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {675#true} is VALID [2022-04-27 11:13:24,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {675#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:24,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:24,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} ~z~0 := ~y~0; {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:24,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#(< 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; {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:24,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {717#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:24,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {717#(< 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; {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:24,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {717#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:24,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {717#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {676#false} is VALID [2022-04-27 11:13:24,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {676#false} assume !(~z~0 % 4294967296 > 0); {676#false} is VALID [2022-04-27 11:13:24,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {676#false} assume !(~y~0 % 4294967296 > 0); {676#false} is VALID [2022-04-27 11:13:24,898 INFO L272 TraceCheckUtils]: 16: Hoare triple {676#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {676#false} is VALID [2022-04-27 11:13:24,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {676#false} ~cond := #in~cond; {676#false} is VALID [2022-04-27 11:13:24,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {676#false} assume 0 == ~cond; {676#false} is VALID [2022-04-27 11:13:24,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {676#false} assume !false; {676#false} is VALID [2022-04-27 11:13:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:24,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:24,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {676#false} assume !false; {676#false} is VALID [2022-04-27 11:13:24,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {676#false} assume 0 == ~cond; {676#false} is VALID [2022-04-27 11:13:24,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {676#false} ~cond := #in~cond; {676#false} is VALID [2022-04-27 11:13:24,963 INFO L272 TraceCheckUtils]: 16: Hoare triple {676#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {676#false} is VALID [2022-04-27 11:13:24,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {676#false} assume !(~y~0 % 4294967296 > 0); {676#false} is VALID [2022-04-27 11:13:24,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {676#false} assume !(~z~0 % 4294967296 > 0); {676#false} is VALID [2022-04-27 11:13:24,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {717#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {676#false} is VALID [2022-04-27 11:13:24,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {717#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:24,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {717#(< 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; {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:24,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {717#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:24,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#(< 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; {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:24,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} ~z~0 := ~y~0; {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:24,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:24,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {675#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:24,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {675#true} is VALID [2022-04-27 11:13:24,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {675#true} call #t~ret17 := main(); {675#true} is VALID [2022-04-27 11:13:24,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {675#true} {675#true} #94#return; {675#true} is VALID [2022-04-27 11:13:24,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} assume true; {675#true} is VALID [2022-04-27 11:13:24,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {675#true} is VALID [2022-04-27 11:13:24,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {675#true} call ULTIMATE.init(); {675#true} is VALID [2022-04-27 11:13:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:24,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170011294] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:24,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:24,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2022-04-27 11:13:24,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256225165] [2022-04-27 11:13:24,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:24,971 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:13:24,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:24,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:24,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:13:24,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:24,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:13:24,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:13:24,999 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:25,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:25,644 INFO L93 Difference]: Finished difference Result 95 states and 145 transitions. [2022-04-27 11:13:25,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 11:13:25,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:13:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 94 transitions. [2022-04-27 11:13:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 94 transitions. [2022-04-27 11:13:25,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 94 transitions. [2022-04-27 11:13:25,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:25,718 INFO L225 Difference]: With dead ends: 95 [2022-04-27 11:13:25,718 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 11:13:25,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-04-27 11:13:25,719 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 60 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:25,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 58 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:13:25,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 11:13:25,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 54. [2022-04-27 11:13:25,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:25,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:25,744 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:25,744 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:25,746 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2022-04-27 11:13:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2022-04-27 11:13:25,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:25,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:25,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-27 11:13:25,747 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-27 11:13:25,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:25,748 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2022-04-27 11:13:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2022-04-27 11:13:25,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:25,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:25,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:25,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2022-04-27 11:13:25,750 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 20 [2022-04-27 11:13:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:25,751 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2022-04-27 11:13:25,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2022-04-27 11:13:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 11:13:25,755 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:25,755 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:25,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 11:13:25,967 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,SelfDestructingSolverStorable3 [2022-04-27 11:13:25,967 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:25,968 INFO L85 PathProgramCache]: Analyzing trace with hash 830872025, now seen corresponding path program 2 times [2022-04-27 11:13:25,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:25,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18755007] [2022-04-27 11:13:25,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:25,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:26,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:26,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1173#true} is VALID [2022-04-27 11:13:26,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 11:13:26,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #94#return; {1173#true} is VALID [2022-04-27 11:13:26,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:26,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1173#true} is VALID [2022-04-27 11:13:26,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 11:13:26,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #94#return; {1173#true} is VALID [2022-04-27 11:13:26,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret17 := main(); {1173#true} is VALID [2022-04-27 11:13:26,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1178#(= main_~y~0 0)} is VALID [2022-04-27 11:13:26,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {1178#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1179#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:26,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1180#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:26,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {1180#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1181#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:26,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {1181#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:26,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:26,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {1183#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:26,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1174#false} is VALID [2022-04-27 11:13:26,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {1174#false} assume !(~y~0 % 4294967296 > 0); {1174#false} is VALID [2022-04-27 11:13:26,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {1174#false} assume !(~x~0 % 4294967296 > 0); {1174#false} is VALID [2022-04-27 11:13:26,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {1174#false} assume !(~z~0 % 4294967296 > 0); {1174#false} is VALID [2022-04-27 11:13:26,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {1174#false} assume !(~y~0 % 4294967296 > 0); {1174#false} is VALID [2022-04-27 11:13:26,098 INFO L272 TraceCheckUtils]: 17: Hoare triple {1174#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1174#false} is VALID [2022-04-27 11:13:26,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#false} ~cond := #in~cond; {1174#false} is VALID [2022-04-27 11:13:26,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#false} assume 0 == ~cond; {1174#false} is VALID [2022-04-27 11:13:26,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-27 11:13:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:26,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:26,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18755007] [2022-04-27 11:13:26,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18755007] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:26,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390658405] [2022-04-27 11:13:26,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:13:26,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:26,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:26,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:13:26,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 11:13:26,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:13:26,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:26,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 11:13:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:26,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:26,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1173#true} is VALID [2022-04-27 11:13:26,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1173#true} is VALID [2022-04-27 11:13:26,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 11:13:26,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #94#return; {1173#true} is VALID [2022-04-27 11:13:26,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret17 := main(); {1173#true} is VALID [2022-04-27 11:13:26,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1178#(= main_~y~0 0)} is VALID [2022-04-27 11:13:26,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {1178#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1179#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:26,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1180#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:26,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {1180#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1181#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:26,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {1181#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:26,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:26,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {1221#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:13:26,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {1221#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {1174#false} is VALID [2022-04-27 11:13:26,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {1174#false} assume !(~y~0 % 4294967296 > 0); {1174#false} is VALID [2022-04-27 11:13:26,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {1174#false} assume !(~x~0 % 4294967296 > 0); {1174#false} is VALID [2022-04-27 11:13:26,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {1174#false} assume !(~z~0 % 4294967296 > 0); {1174#false} is VALID [2022-04-27 11:13:26,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {1174#false} assume !(~y~0 % 4294967296 > 0); {1174#false} is VALID [2022-04-27 11:13:26,322 INFO L272 TraceCheckUtils]: 17: Hoare triple {1174#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1174#false} is VALID [2022-04-27 11:13:26,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#false} ~cond := #in~cond; {1174#false} is VALID [2022-04-27 11:13:26,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#false} assume 0 == ~cond; {1174#false} is VALID [2022-04-27 11:13:26,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-27 11:13:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:26,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:26,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-27 11:13:26,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#false} assume 0 == ~cond; {1174#false} is VALID [2022-04-27 11:13:26,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#false} ~cond := #in~cond; {1174#false} is VALID [2022-04-27 11:13:26,444 INFO L272 TraceCheckUtils]: 17: Hoare triple {1174#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1174#false} is VALID [2022-04-27 11:13:26,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {1174#false} assume !(~y~0 % 4294967296 > 0); {1174#false} is VALID [2022-04-27 11:13:26,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {1174#false} assume !(~z~0 % 4294967296 > 0); {1174#false} is VALID [2022-04-27 11:13:26,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {1174#false} assume !(~x~0 % 4294967296 > 0); {1174#false} is VALID [2022-04-27 11:13:26,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {1174#false} assume !(~y~0 % 4294967296 > 0); {1174#false} is VALID [2022-04-27 11:13:26,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {1273#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1174#false} is VALID [2022-04-27 11:13:26,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1273#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:26,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {1277#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1277#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:26,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {1284#(< 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; {1277#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:26,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {1288#(< 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; {1284#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:13:26,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {1292#(< 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; {1288#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:13:26,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {1296#(< 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; {1292#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:13:26,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1296#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:13:26,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret17 := main(); {1173#true} is VALID [2022-04-27 11:13:26,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #94#return; {1173#true} is VALID [2022-04-27 11:13:26,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 11:13:26,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1173#true} is VALID [2022-04-27 11:13:26,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1173#true} is VALID [2022-04-27 11:13:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:26,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390658405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:26,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:26,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-27 11:13:26,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037690332] [2022-04-27 11:13:26,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:26,449 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:13:26,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:26,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:26,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:26,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:13:26,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:26,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:13:26,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:13:26,471 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:28,226 INFO L93 Difference]: Finished difference Result 191 states and 311 transitions. [2022-04-27 11:13:28,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 11:13:28,226 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:13:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 198 transitions. [2022-04-27 11:13:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 198 transitions. [2022-04-27 11:13:28,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 198 transitions. [2022-04-27 11:13:28,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:28,461 INFO L225 Difference]: With dead ends: 191 [2022-04-27 11:13:28,461 INFO L226 Difference]: Without dead ends: 176 [2022-04-27 11:13:28,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=416, Invalid=1144, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 11:13:28,462 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 290 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:28,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 80 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:13:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-27 11:13:28,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 111. [2022-04-27 11:13:28,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:28,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 111 states, 106 states have (on average 1.490566037735849) internal successors, (158), 106 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:28,524 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 111 states, 106 states have (on average 1.490566037735849) internal successors, (158), 106 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:28,525 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 111 states, 106 states have (on average 1.490566037735849) internal successors, (158), 106 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:28,529 INFO L93 Difference]: Finished difference Result 176 states and 254 transitions. [2022-04-27 11:13:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 254 transitions. [2022-04-27 11:13:28,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:28,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:28,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.490566037735849) internal successors, (158), 106 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 176 states. [2022-04-27 11:13:28,530 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.490566037735849) internal successors, (158), 106 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 176 states. [2022-04-27 11:13:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:28,535 INFO L93 Difference]: Finished difference Result 176 states and 254 transitions. [2022-04-27 11:13:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 254 transitions. [2022-04-27 11:13:28,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:28,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:28,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:28,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:28,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.490566037735849) internal successors, (158), 106 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2022-04-27 11:13:28,540 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 21 [2022-04-27 11:13:28,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:28,541 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2022-04-27 11:13:28,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2022-04-27 11:13:28,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:13:28,541 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:28,541 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, 1, 1] [2022-04-27 11:13:28,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 11:13:28,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:28,755 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:28,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:28,756 INFO L85 PathProgramCache]: Analyzing trace with hash -353925126, now seen corresponding path program 1 times [2022-04-27 11:13:28,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:28,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364319783] [2022-04-27 11:13:28,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:28,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:29,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:29,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {2115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2102#true} is VALID [2022-04-27 11:13:29,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {2102#true} assume true; {2102#true} is VALID [2022-04-27 11:13:29,022 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2102#true} {2102#true} #94#return; {2102#true} is VALID [2022-04-27 11:13:29,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {2102#true} call ULTIMATE.init(); {2115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:29,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {2115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2102#true} is VALID [2022-04-27 11:13:29,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {2102#true} assume true; {2102#true} is VALID [2022-04-27 11:13:29,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2102#true} {2102#true} #94#return; {2102#true} is VALID [2022-04-27 11:13:29,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {2102#true} call #t~ret17 := main(); {2102#true} is VALID [2022-04-27 11:13:29,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2107#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:13:29,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {2107#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2108#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-27 11:13:29,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {2108#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !(~x~0 % 4294967296 > 0); {2109#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-27 11:13:29,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {2109#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} ~z~0 := ~y~0; {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:29,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:29,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:29,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:29,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:29,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~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; {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:29,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:29,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) 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; {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:29,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:29,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:29,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:29,056 INFO L272 TraceCheckUtils]: 19: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2113#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:13:29,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {2113#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2114#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:13:29,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {2114#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2103#false} is VALID [2022-04-27 11:13:29,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {2103#false} assume !false; {2103#false} is VALID [2022-04-27 11:13:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:29,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:29,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364319783] [2022-04-27 11:13:29,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364319783] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:29,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573050510] [2022-04-27 11:13:29,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:29,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:29,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:29,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:13:29,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 11:13:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:29,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-27 11:13:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:29,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:29,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {2102#true} call ULTIMATE.init(); {2102#true} is VALID [2022-04-27 11:13:29,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {2102#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2102#true} is VALID [2022-04-27 11:13:29,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {2102#true} assume true; {2102#true} is VALID [2022-04-27 11:13:29,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2102#true} {2102#true} #94#return; {2102#true} is VALID [2022-04-27 11:13:29,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {2102#true} call #t~ret17 := main(); {2102#true} is VALID [2022-04-27 11:13:29,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2107#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:13:29,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {2107#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2137#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:13:29,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {2137#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod (+ main_~x~0 1) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {2141#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-27 11:13:29,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {2141#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} ~z~0 := ~y~0; {2145#(and (= (+ main_~x~0 1) main_~n~0) (= main_~z~0 main_~y~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-27 11:13:29,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {2145#(and (= (+ main_~x~0 1) main_~n~0) (= main_~z~0 main_~y~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2149#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:13:29,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {2149#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {2149#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:13:29,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {2149#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2156#(and (= (+ main_~y~0 1) 1) (= main_~z~0 (+ main_~y~0 1)) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:13:29,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {2156#(and (= (+ main_~y~0 1) 1) (= main_~z~0 (+ main_~y~0 1)) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {2156#(and (= (+ main_~y~0 1) 1) (= main_~z~0 (+ main_~y~0 1)) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:13:29,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {2156#(and (= (+ main_~y~0 1) 1) (= main_~z~0 (+ main_~y~0 1)) (<= (mod (+ main_~n~0 4294967295) 4294967296) 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; {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:13:29,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:13:29,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 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; {2170#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-27 11:13:29,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {2170#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} assume !(~z~0 % 4294967296 > 0); {2170#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-27 11:13:29,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {2170#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:13:29,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:13:29,562 INFO L272 TraceCheckUtils]: 19: Hoare triple {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2183#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:29,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {2183#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2187#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:29,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {2187#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2103#false} is VALID [2022-04-27 11:13:29,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {2103#false} assume !false; {2103#false} is VALID [2022-04-27 11:13:29,563 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-27 11:13:29,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:30,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {2103#false} assume !false; {2103#false} is VALID [2022-04-27 11:13:30,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {2187#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2103#false} is VALID [2022-04-27 11:13:30,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {2183#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2187#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:30,061 INFO L272 TraceCheckUtils]: 19: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2183#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:30,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:30,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:30,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:30,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~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; {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:30,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:30,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~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; {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:30,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:30,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~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; {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:30,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:30,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {2234#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:30,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {2238#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {2234#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:30,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {2242#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {2238#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:13:30,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {2246#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (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; {2242#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:13:30,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2246#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:13:30,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {2102#true} call #t~ret17 := main(); {2102#true} is VALID [2022-04-27 11:13:30,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2102#true} {2102#true} #94#return; {2102#true} is VALID [2022-04-27 11:13:30,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {2102#true} assume true; {2102#true} is VALID [2022-04-27 11:13:30,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {2102#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2102#true} is VALID [2022-04-27 11:13:30,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {2102#true} call ULTIMATE.init(); {2102#true} is VALID [2022-04-27 11:13:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:30,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573050510] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:30,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:30,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 25 [2022-04-27 11:13:30,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720952030] [2022-04-27 11:13:30,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:30,077 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:13:30,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:30,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.92) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:30,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:30,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 11:13:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:30,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 11:13:30,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:13:30,131 INFO L87 Difference]: Start difference. First operand 111 states and 162 transitions. Second operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:36,561 INFO L93 Difference]: Finished difference Result 201 states and 294 transitions. [2022-04-27 11:13:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-27 11:13:36,561 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:13:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 131 transitions. [2022-04-27 11:13:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 131 transitions. [2022-04-27 11:13:36,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 131 transitions. [2022-04-27 11:13:36,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:36,788 INFO L225 Difference]: With dead ends: 201 [2022-04-27 11:13:36,788 INFO L226 Difference]: Without dead ends: 190 [2022-04-27 11:13:36,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=681, Invalid=3478, Unknown=1, NotChecked=0, Total=4160 [2022-04-27 11:13:36,789 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 112 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:36,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 82 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 11:13:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-04-27 11:13:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 124. [2022-04-27 11:13:36,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:36,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 124 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 119 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:36,875 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 124 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 119 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:36,875 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 124 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 119 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:36,884 INFO L93 Difference]: Finished difference Result 190 states and 280 transitions. [2022-04-27 11:13:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 280 transitions. [2022-04-27 11:13:36,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:36,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:36,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 119 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 190 states. [2022-04-27 11:13:36,885 INFO L87 Difference]: Start difference. First operand has 124 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 119 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 190 states. [2022-04-27 11:13:36,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:36,889 INFO L93 Difference]: Finished difference Result 190 states and 280 transitions. [2022-04-27 11:13:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 280 transitions. [2022-04-27 11:13:36,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:36,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:36,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:36,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 119 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 187 transitions. [2022-04-27 11:13:36,892 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 187 transitions. Word has length 23 [2022-04-27 11:13:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:36,892 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 187 transitions. [2022-04-27 11:13:36,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 187 transitions. [2022-04-27 11:13:36,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:13:36,896 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:36,896 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:36,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 11:13:37,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:37,097 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:37,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:37,097 INFO L85 PathProgramCache]: Analyzing trace with hash -169119975, now seen corresponding path program 2 times [2022-04-27 11:13:37,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:37,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205932667] [2022-04-27 11:13:37,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:37,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:37,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:37,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {3141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3129#true} is VALID [2022-04-27 11:13:37,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-27 11:13:37,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3129#true} {3129#true} #94#return; {3129#true} is VALID [2022-04-27 11:13:37,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {3129#true} call ULTIMATE.init(); {3141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:37,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {3141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3129#true} is VALID [2022-04-27 11:13:37,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-27 11:13:37,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3129#true} {3129#true} #94#return; {3129#true} is VALID [2022-04-27 11:13:37,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {3129#true} call #t~ret17 := main(); {3129#true} is VALID [2022-04-27 11:13:37,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3134#(= main_~y~0 0)} is VALID [2022-04-27 11:13:37,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {3134#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:37,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {3135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:37,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {3136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {3136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:37,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {3136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {3137#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:37,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {3137#(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; {3138#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:37,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {3138#(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; {3139#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:37,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {3139#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3139#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:37,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {3139#(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; {3138#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:37,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {3138#(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; {3140#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:37,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {3140#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {3140#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:37,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {3140#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {3140#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:37,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {3140#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3130#false} is VALID [2022-04-27 11:13:37,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#false} assume !(~y~0 % 4294967296 > 0); {3130#false} is VALID [2022-04-27 11:13:37,212 INFO L272 TraceCheckUtils]: 19: Hoare triple {3130#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3130#false} is VALID [2022-04-27 11:13:37,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {3130#false} ~cond := #in~cond; {3130#false} is VALID [2022-04-27 11:13:37,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#false} assume 0 == ~cond; {3130#false} is VALID [2022-04-27 11:13:37,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2022-04-27 11:13:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:37,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:37,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205932667] [2022-04-27 11:13:37,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205932667] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:37,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759959637] [2022-04-27 11:13:37,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:13:37,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:37,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:37,214 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:13:37,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 11:13:37,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:13:37,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:37,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:13:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:37,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:37,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {3129#true} call ULTIMATE.init(); {3129#true} is VALID [2022-04-27 11:13:37,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3129#true} is VALID [2022-04-27 11:13:37,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-27 11:13:37,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3129#true} {3129#true} #94#return; {3129#true} is VALID [2022-04-27 11:13:37,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {3129#true} call #t~ret17 := main(); {3129#true} is VALID [2022-04-27 11:13:37,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3129#true} is VALID [2022-04-27 11:13:37,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3163#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:37,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {3163#(< 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; {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:37,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:37,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:37,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#(< 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; {3163#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:37,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {3163#(< 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; {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:37,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:37,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#(< 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; {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:37,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {3180#(< 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; {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:37,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:37,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3130#false} is VALID [2022-04-27 11:13:37,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {3130#false} assume !(~z~0 % 4294967296 > 0); {3130#false} is VALID [2022-04-27 11:13:37,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#false} assume !(~y~0 % 4294967296 > 0); {3130#false} is VALID [2022-04-27 11:13:37,362 INFO L272 TraceCheckUtils]: 19: Hoare triple {3130#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3130#false} is VALID [2022-04-27 11:13:37,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {3130#false} ~cond := #in~cond; {3130#false} is VALID [2022-04-27 11:13:37,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#false} assume 0 == ~cond; {3130#false} is VALID [2022-04-27 11:13:37,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2022-04-27 11:13:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:37,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:37,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2022-04-27 11:13:37,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#false} assume 0 == ~cond; {3130#false} is VALID [2022-04-27 11:13:37,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {3130#false} ~cond := #in~cond; {3130#false} is VALID [2022-04-27 11:13:37,429 INFO L272 TraceCheckUtils]: 19: Hoare triple {3130#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3130#false} is VALID [2022-04-27 11:13:37,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#false} assume !(~y~0 % 4294967296 > 0); {3130#false} is VALID [2022-04-27 11:13:37,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {3130#false} assume !(~z~0 % 4294967296 > 0); {3130#false} is VALID [2022-04-27 11:13:37,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3130#false} is VALID [2022-04-27 11:13:37,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:37,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {3180#(< 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; {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:37,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#(< 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; {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:37,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:37,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {3163#(< 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; {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:37,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#(< 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; {3163#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:37,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:37,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:37,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {3163#(< 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; {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:37,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3163#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:37,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3129#true} is VALID [2022-04-27 11:13:37,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {3129#true} call #t~ret17 := main(); {3129#true} is VALID [2022-04-27 11:13:37,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3129#true} {3129#true} #94#return; {3129#true} is VALID [2022-04-27 11:13:37,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-27 11:13:37,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3129#true} is VALID [2022-04-27 11:13:37,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {3129#true} call ULTIMATE.init(); {3129#true} is VALID [2022-04-27 11:13:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:37,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759959637] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:37,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:37,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2022-04-27 11:13:37,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991465948] [2022-04-27 11:13:37,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:37,435 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:13:37,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:37,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:37,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:37,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:13:37,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:37,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:13:37,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:13:37,460 INFO L87 Difference]: Start difference. First operand 124 states and 187 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:39,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:39,242 INFO L93 Difference]: Finished difference Result 308 states and 469 transitions. [2022-04-27 11:13:39,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-27 11:13:39,243 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:13:39,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 159 transitions. [2022-04-27 11:13:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 159 transitions. [2022-04-27 11:13:39,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 159 transitions. [2022-04-27 11:13:39,384 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-27 11:13:39,388 INFO L225 Difference]: With dead ends: 308 [2022-04-27 11:13:39,388 INFO L226 Difference]: Without dead ends: 267 [2022-04-27 11:13:39,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=1818, Unknown=0, NotChecked=0, Total=2162 [2022-04-27 11:13:39,389 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 145 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:39,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 67 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:13:39,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-27 11:13:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 155. [2022-04-27 11:13:39,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:39,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 155 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 150 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:39,510 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 155 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 150 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:39,510 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 155 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 150 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:39,518 INFO L93 Difference]: Finished difference Result 267 states and 382 transitions. [2022-04-27 11:13:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 382 transitions. [2022-04-27 11:13:39,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:39,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:39,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 150 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-27 11:13:39,519 INFO L87 Difference]: Start difference. First operand has 155 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 150 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-27 11:13:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:39,525 INFO L93 Difference]: Finished difference Result 267 states and 382 transitions. [2022-04-27 11:13:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 382 transitions. [2022-04-27 11:13:39,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:39,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:39,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:39,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 150 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2022-04-27 11:13:39,529 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 23 [2022-04-27 11:13:39,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:39,530 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2022-04-27 11:13:39,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:39,530 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2022-04-27 11:13:39,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 11:13:39,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:39,530 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, 1, 1, 1] [2022-04-27 11:13:39,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 11:13:39,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:39,736 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:39,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:39,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1256652584, now seen corresponding path program 2 times [2022-04-27 11:13:39,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:39,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139329573] [2022-04-27 11:13:39,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:39,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:39,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:39,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {4446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4439#true} is VALID [2022-04-27 11:13:39,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {4439#true} assume true; {4439#true} is VALID [2022-04-27 11:13:39,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4439#true} {4439#true} #94#return; {4439#true} is VALID [2022-04-27 11:13:39,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {4439#true} call ULTIMATE.init(); {4446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:39,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {4446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4439#true} is VALID [2022-04-27 11:13:39,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {4439#true} assume true; {4439#true} is VALID [2022-04-27 11:13:39,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4439#true} {4439#true} #94#return; {4439#true} is VALID [2022-04-27 11:13:39,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {4439#true} call #t~ret17 := main(); {4439#true} is VALID [2022-04-27 11:13:39,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {4439#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4439#true} is VALID [2022-04-27 11:13:39,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {4439#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4439#true} is VALID [2022-04-27 11:13:39,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {4439#true} assume !(~x~0 % 4294967296 > 0); {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:39,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:39,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {4444#(<= 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; {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:39,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:39,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:39,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:39,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {4445#(<= 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; {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:39,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {4444#(<= 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; {4440#false} is VALID [2022-04-27 11:13:39,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {4440#false} assume !(~x~0 % 4294967296 > 0); {4440#false} is VALID [2022-04-27 11:13:39,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {4440#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; {4440#false} is VALID [2022-04-27 11:13:39,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {4440#false} assume !(~z~0 % 4294967296 > 0); {4440#false} is VALID [2022-04-27 11:13:39,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {4440#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4440#false} is VALID [2022-04-27 11:13:39,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {4440#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4440#false} is VALID [2022-04-27 11:13:39,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {4440#false} assume !(~y~0 % 4294967296 > 0); {4440#false} is VALID [2022-04-27 11:13:39,790 INFO L272 TraceCheckUtils]: 21: Hoare triple {4440#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4440#false} is VALID [2022-04-27 11:13:39,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {4440#false} ~cond := #in~cond; {4440#false} is VALID [2022-04-27 11:13:39,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {4440#false} assume 0 == ~cond; {4440#false} is VALID [2022-04-27 11:13:39,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {4440#false} assume !false; {4440#false} is VALID [2022-04-27 11:13:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:13:39,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:39,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139329573] [2022-04-27 11:13:39,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139329573] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:39,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666020121] [2022-04-27 11:13:39,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:13:39,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:39,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:39,795 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:13:39,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 11:13:39,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:13:39,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:39,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:13:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:39,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:40,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {4439#true} call ULTIMATE.init(); {4439#true} is VALID [2022-04-27 11:13:40,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {4439#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4439#true} is VALID [2022-04-27 11:13:40,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {4439#true} assume true; {4439#true} is VALID [2022-04-27 11:13:40,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4439#true} {4439#true} #94#return; {4439#true} is VALID [2022-04-27 11:13:40,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {4439#true} call #t~ret17 := main(); {4439#true} is VALID [2022-04-27 11:13:40,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {4439#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4439#true} is VALID [2022-04-27 11:13:40,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {4439#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4439#true} is VALID [2022-04-27 11:13:40,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {4439#true} assume !(~x~0 % 4294967296 > 0); {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:40,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:40,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {4444#(<= 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; {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:40,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:40,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:40,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:40,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {4445#(<= 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; {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:40,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {4444#(<= 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; {4440#false} is VALID [2022-04-27 11:13:40,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {4440#false} assume !(~x~0 % 4294967296 > 0); {4440#false} is VALID [2022-04-27 11:13:40,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {4440#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; {4440#false} is VALID [2022-04-27 11:13:40,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {4440#false} assume !(~z~0 % 4294967296 > 0); {4440#false} is VALID [2022-04-27 11:13:40,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {4440#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4440#false} is VALID [2022-04-27 11:13:40,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {4440#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4440#false} is VALID [2022-04-27 11:13:40,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {4440#false} assume !(~y~0 % 4294967296 > 0); {4440#false} is VALID [2022-04-27 11:13:40,050 INFO L272 TraceCheckUtils]: 21: Hoare triple {4440#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4440#false} is VALID [2022-04-27 11:13:40,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {4440#false} ~cond := #in~cond; {4440#false} is VALID [2022-04-27 11:13:40,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {4440#false} assume 0 == ~cond; {4440#false} is VALID [2022-04-27 11:13:40,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {4440#false} assume !false; {4440#false} is VALID [2022-04-27 11:13:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:13:40,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:40,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {4440#false} assume !false; {4440#false} is VALID [2022-04-27 11:13:40,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {4440#false} assume 0 == ~cond; {4440#false} is VALID [2022-04-27 11:13:40,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {4440#false} ~cond := #in~cond; {4440#false} is VALID [2022-04-27 11:13:40,145 INFO L272 TraceCheckUtils]: 21: Hoare triple {4440#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4440#false} is VALID [2022-04-27 11:13:40,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {4440#false} assume !(~y~0 % 4294967296 > 0); {4440#false} is VALID [2022-04-27 11:13:40,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {4440#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4440#false} is VALID [2022-04-27 11:13:40,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {4440#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4440#false} is VALID [2022-04-27 11:13:40,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {4440#false} assume !(~z~0 % 4294967296 > 0); {4440#false} is VALID [2022-04-27 11:13:40,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {4440#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; {4440#false} is VALID [2022-04-27 11:13:40,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {4440#false} assume !(~x~0 % 4294967296 > 0); {4440#false} is VALID [2022-04-27 11:13:40,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {4444#(<= 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; {4440#false} is VALID [2022-04-27 11:13:40,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {4445#(<= 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; {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:40,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:40,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:40,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:40,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {4444#(<= 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; {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:40,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:40,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {4439#true} assume !(~x~0 % 4294967296 > 0); {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:40,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {4439#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4439#true} is VALID [2022-04-27 11:13:40,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {4439#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4439#true} is VALID [2022-04-27 11:13:40,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {4439#true} call #t~ret17 := main(); {4439#true} is VALID [2022-04-27 11:13:40,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4439#true} {4439#true} #94#return; {4439#true} is VALID [2022-04-27 11:13:40,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {4439#true} assume true; {4439#true} is VALID [2022-04-27 11:13:40,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {4439#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4439#true} is VALID [2022-04-27 11:13:40,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {4439#true} call ULTIMATE.init(); {4439#true} is VALID [2022-04-27 11:13:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:13:40,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666020121] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:40,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:40,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-27 11:13:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876528643] [2022-04-27 11:13:40,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:40,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:13:40,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:40,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:40,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:40,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:13:40,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:40,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:13:40,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:13:40,170 INFO L87 Difference]: Start difference. First operand 155 states and 230 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:40,465 INFO L93 Difference]: Finished difference Result 245 states and 369 transitions. [2022-04-27 11:13:40,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:13:40,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:13:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-27 11:13:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-27 11:13:40,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-04-27 11:13:40,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:40,507 INFO L225 Difference]: With dead ends: 245 [2022-04-27 11:13:40,507 INFO L226 Difference]: Without dead ends: 182 [2022-04-27 11:13:40,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:13:40,508 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:40,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:40,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-27 11:13:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 152. [2022-04-27 11:13:40,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:40,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 152 states, 147 states have (on average 1.4761904761904763) internal successors, (217), 147 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-27 11:13:40,613 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 152 states, 147 states have (on average 1.4761904761904763) internal successors, (217), 147 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-27 11:13:40,613 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 152 states, 147 states have (on average 1.4761904761904763) internal successors, (217), 147 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-27 11:13:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:40,616 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2022-04-27 11:13:40,616 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 267 transitions. [2022-04-27 11:13:40,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:40,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:40,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.4761904761904763) internal successors, (217), 147 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 182 states. [2022-04-27 11:13:40,617 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.4761904761904763) internal successors, (217), 147 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 182 states. [2022-04-27 11:13:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:40,621 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2022-04-27 11:13:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 267 transitions. [2022-04-27 11:13:40,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:40,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:40,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:40,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.4761904761904763) internal successors, (217), 147 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-27 11:13:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 221 transitions. [2022-04-27 11:13:40,625 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 221 transitions. Word has length 25 [2022-04-27 11:13:40,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:40,625 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 221 transitions. [2022-04-27 11:13:40,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 221 transitions. [2022-04-27 11:13:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 11:13:40,625 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:40,625 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, 1, 1] [2022-04-27 11:13:40,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 11:13:40,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:40,844 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:40,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1462305435, now seen corresponding path program 1 times [2022-04-27 11:13:40,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:40,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131020535] [2022-04-27 11:13:40,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:40,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:40,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:40,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {5450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5439#true} is VALID [2022-04-27 11:13:40,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {5439#true} assume true; {5439#true} is VALID [2022-04-27 11:13:40,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5439#true} {5439#true} #94#return; {5439#true} is VALID [2022-04-27 11:13:40,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {5439#true} call ULTIMATE.init(); {5450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:40,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {5450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5439#true} is VALID [2022-04-27 11:13:40,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {5439#true} assume true; {5439#true} is VALID [2022-04-27 11:13:40,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5439#true} {5439#true} #94#return; {5439#true} is VALID [2022-04-27 11:13:40,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {5439#true} call #t~ret17 := main(); {5439#true} is VALID [2022-04-27 11:13:40,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {5439#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5444#(= main_~y~0 0)} is VALID [2022-04-27 11:13:40,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {5444#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5445#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:40,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {5445#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5446#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:40,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {5446#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:40,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:40,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {5448#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:13:40,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {5448#(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; {5449#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:40,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {5449#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5440#false} is VALID [2022-04-27 11:13:40,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {5440#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5440#false} is VALID [2022-04-27 11:13:40,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {5440#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5440#false} is VALID [2022-04-27 11:13:40,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {5440#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5440#false} is VALID [2022-04-27 11:13:40,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {5440#false} assume !(~y~0 % 4294967296 > 0); {5440#false} is VALID [2022-04-27 11:13:40,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {5440#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; {5440#false} is VALID [2022-04-27 11:13:40,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {5440#false} assume !(~x~0 % 4294967296 > 0); {5440#false} is VALID [2022-04-27 11:13:40,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {5440#false} assume !(~z~0 % 4294967296 > 0); {5440#false} is VALID [2022-04-27 11:13:40,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {5440#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {5440#false} is VALID [2022-04-27 11:13:40,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {5440#false} assume !(~y~0 % 4294967296 > 0); {5440#false} is VALID [2022-04-27 11:13:40,945 INFO L272 TraceCheckUtils]: 22: Hoare triple {5440#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5440#false} is VALID [2022-04-27 11:13:40,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {5440#false} ~cond := #in~cond; {5440#false} is VALID [2022-04-27 11:13:40,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {5440#false} assume 0 == ~cond; {5440#false} is VALID [2022-04-27 11:13:40,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {5440#false} assume !false; {5440#false} is VALID [2022-04-27 11:13:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 11:13:40,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:40,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131020535] [2022-04-27 11:13:40,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131020535] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:40,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146451751] [2022-04-27 11:13:40,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:40,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:40,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:40,947 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:13:40,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 11:13:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:40,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 11:13:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:40,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:41,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {5439#true} call ULTIMATE.init(); {5439#true} is VALID [2022-04-27 11:13:41,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {5439#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5439#true} is VALID [2022-04-27 11:13:41,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {5439#true} assume true; {5439#true} is VALID [2022-04-27 11:13:41,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5439#true} {5439#true} #94#return; {5439#true} is VALID [2022-04-27 11:13:41,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {5439#true} call #t~ret17 := main(); {5439#true} is VALID [2022-04-27 11:13:41,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {5439#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5444#(= main_~y~0 0)} is VALID [2022-04-27 11:13:41,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {5444#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5445#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:41,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {5445#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5446#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:41,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {5446#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:41,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:41,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {5484#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:41,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {5484#(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; {5488#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:13:41,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {5488#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {5440#false} is VALID [2022-04-27 11:13:41,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {5440#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5440#false} is VALID [2022-04-27 11:13:41,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {5440#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5440#false} is VALID [2022-04-27 11:13:41,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {5440#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5440#false} is VALID [2022-04-27 11:13:41,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {5440#false} assume !(~y~0 % 4294967296 > 0); {5440#false} is VALID [2022-04-27 11:13:41,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {5440#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; {5440#false} is VALID [2022-04-27 11:13:41,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {5440#false} assume !(~x~0 % 4294967296 > 0); {5440#false} is VALID [2022-04-27 11:13:41,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {5440#false} assume !(~z~0 % 4294967296 > 0); {5440#false} is VALID [2022-04-27 11:13:41,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {5440#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {5440#false} is VALID [2022-04-27 11:13:41,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {5440#false} assume !(~y~0 % 4294967296 > 0); {5440#false} is VALID [2022-04-27 11:13:41,105 INFO L272 TraceCheckUtils]: 22: Hoare triple {5440#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5440#false} is VALID [2022-04-27 11:13:41,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {5440#false} ~cond := #in~cond; {5440#false} is VALID [2022-04-27 11:13:41,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {5440#false} assume 0 == ~cond; {5440#false} is VALID [2022-04-27 11:13:41,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {5440#false} assume !false; {5440#false} is VALID [2022-04-27 11:13:41,105 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 11:13:41,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:41,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {5440#false} assume !false; {5440#false} is VALID [2022-04-27 11:13:41,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {5440#false} assume 0 == ~cond; {5440#false} is VALID [2022-04-27 11:13:41,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {5440#false} ~cond := #in~cond; {5440#false} is VALID [2022-04-27 11:13:41,223 INFO L272 TraceCheckUtils]: 22: Hoare triple {5440#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5440#false} is VALID [2022-04-27 11:13:41,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {5440#false} assume !(~y~0 % 4294967296 > 0); {5440#false} is VALID [2022-04-27 11:13:41,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {5440#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {5440#false} is VALID [2022-04-27 11:13:41,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {5440#false} assume !(~z~0 % 4294967296 > 0); {5440#false} is VALID [2022-04-27 11:13:41,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {5440#false} assume !(~x~0 % 4294967296 > 0); {5440#false} is VALID [2022-04-27 11:13:41,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {5440#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; {5440#false} is VALID [2022-04-27 11:13:41,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {5440#false} assume !(~y~0 % 4294967296 > 0); {5440#false} is VALID [2022-04-27 11:13:41,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {5440#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5440#false} is VALID [2022-04-27 11:13:41,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {5564#(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; {5440#false} is VALID [2022-04-27 11:13:41,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {5568#(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; {5564#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:13:41,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {5572#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5568#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:13:41,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {5576#(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; {5572#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:13:41,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {5439#true} ~z~0 := ~y~0; {5576#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:13:41,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {5439#true} assume !(~x~0 % 4294967296 > 0); {5439#true} is VALID [2022-04-27 11:13:41,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {5439#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5439#true} is VALID [2022-04-27 11:13:41,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {5439#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5439#true} is VALID [2022-04-27 11:13:41,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {5439#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5439#true} is VALID [2022-04-27 11:13:41,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {5439#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5439#true} is VALID [2022-04-27 11:13:41,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {5439#true} call #t~ret17 := main(); {5439#true} is VALID [2022-04-27 11:13:41,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5439#true} {5439#true} #94#return; {5439#true} is VALID [2022-04-27 11:13:41,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {5439#true} assume true; {5439#true} is VALID [2022-04-27 11:13:41,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {5439#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5439#true} is VALID [2022-04-27 11:13:41,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {5439#true} call ULTIMATE.init(); {5439#true} is VALID [2022-04-27 11:13:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:13:41,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146451751] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:41,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:41,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15 [2022-04-27 11:13:41,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875245709] [2022-04-27 11:13:41,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:41,229 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:13:41,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:41,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:41,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:41,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 11:13:41,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:41,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 11:13:41,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:13:41,254 INFO L87 Difference]: Start difference. First operand 152 states and 221 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:42,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:42,289 INFO L93 Difference]: Finished difference Result 232 states and 339 transitions. [2022-04-27 11:13:42,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 11:13:42,290 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:13:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2022-04-27 11:13:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2022-04-27 11:13:42,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 114 transitions. [2022-04-27 11:13:42,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:42,391 INFO L225 Difference]: With dead ends: 232 [2022-04-27 11:13:42,391 INFO L226 Difference]: Without dead ends: 182 [2022-04-27 11:13:42,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 11:13:42,392 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 91 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:42,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 65 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:13:42,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-27 11:13:42,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 148. [2022-04-27 11:13:42,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:42,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:42,498 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:42,498 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:42,500 INFO L93 Difference]: Finished difference Result 182 states and 261 transitions. [2022-04-27 11:13:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 261 transitions. [2022-04-27 11:13:42,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:42,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:42,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 182 states. [2022-04-27 11:13:42,501 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 182 states. [2022-04-27 11:13:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:42,504 INFO L93 Difference]: Finished difference Result 182 states and 261 transitions. [2022-04-27 11:13:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 261 transitions. [2022-04-27 11:13:42,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:42,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:42,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:42,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2022-04-27 11:13:42,506 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 26 [2022-04-27 11:13:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:42,506 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2022-04-27 11:13:42,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2022-04-27 11:13:42,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 11:13:42,507 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:42,507 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:42,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 11:13:42,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:42,716 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:42,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:42,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2144175877, now seen corresponding path program 3 times [2022-04-27 11:13:42,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:42,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146090063] [2022-04-27 11:13:42,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:42,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:42,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {6487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6473#true} is VALID [2022-04-27 11:13:42,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {6473#true} assume true; {6473#true} is VALID [2022-04-27 11:13:42,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6473#true} {6473#true} #94#return; {6473#true} is VALID [2022-04-27 11:13:42,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {6473#true} call ULTIMATE.init(); {6487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:42,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {6487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6473#true} is VALID [2022-04-27 11:13:42,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {6473#true} assume true; {6473#true} is VALID [2022-04-27 11:13:42,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6473#true} {6473#true} #94#return; {6473#true} is VALID [2022-04-27 11:13:42,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {6473#true} call #t~ret17 := main(); {6473#true} is VALID [2022-04-27 11:13:42,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {6473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6478#(= main_~y~0 0)} is VALID [2022-04-27 11:13:42,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {6478#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:42,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {6479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:42,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {6480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:42,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {6481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:42,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {6481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {6482#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:13:42,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {6482#(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; {6483#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:42,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {6483#(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; {6484#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:42,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {6484#(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; {6485#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:42,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {6485#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6485#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:42,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {6485#(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; {6484#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:42,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {6484#(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; {6483#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:42,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {6483#(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; {6486#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:42,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {6486#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {6486#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:42,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {6486#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {6486#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:42,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {6486#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {6474#false} is VALID [2022-04-27 11:13:42,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {6474#false} assume !(~y~0 % 4294967296 > 0); {6474#false} is VALID [2022-04-27 11:13:42,846 INFO L272 TraceCheckUtils]: 22: Hoare triple {6474#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6474#false} is VALID [2022-04-27 11:13:42,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {6474#false} ~cond := #in~cond; {6474#false} is VALID [2022-04-27 11:13:42,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {6474#false} assume 0 == ~cond; {6474#false} is VALID [2022-04-27 11:13:42,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {6474#false} assume !false; {6474#false} is VALID [2022-04-27 11:13:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:42,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:42,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146090063] [2022-04-27 11:13:42,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146090063] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:42,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306109555] [2022-04-27 11:13:42,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:13:42,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:42,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:42,847 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:13:42,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 11:13:42,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 11:13:42,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:42,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 11:13:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:42,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:42,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {6473#true} call ULTIMATE.init(); {6473#true} is VALID [2022-04-27 11:13:42,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {6473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6473#true} is VALID [2022-04-27 11:13:42,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {6473#true} assume true; {6473#true} is VALID [2022-04-27 11:13:42,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6473#true} {6473#true} #94#return; {6473#true} is VALID [2022-04-27 11:13:42,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {6473#true} call #t~ret17 := main(); {6473#true} is VALID [2022-04-27 11:13:42,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {6473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6473#true} is VALID [2022-04-27 11:13:42,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {6473#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6509#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:42,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {6509#(< 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; {6513#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:42,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {6513#(< 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; {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:42,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:42,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:43,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {6517#(< 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; {6513#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:43,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {6513#(< 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; {6509#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:43,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {6509#(< 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; {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:43,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:43,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {6533#(< 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; {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:43,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {6533#(< 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; {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:43,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {6533#(< 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; {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:43,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:43,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6474#false} is VALID [2022-04-27 11:13:43,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {6474#false} assume !(~z~0 % 4294967296 > 0); {6474#false} is VALID [2022-04-27 11:13:43,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {6474#false} assume !(~y~0 % 4294967296 > 0); {6474#false} is VALID [2022-04-27 11:13:43,003 INFO L272 TraceCheckUtils]: 22: Hoare triple {6474#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6474#false} is VALID [2022-04-27 11:13:43,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {6474#false} ~cond := #in~cond; {6474#false} is VALID [2022-04-27 11:13:43,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {6474#false} assume 0 == ~cond; {6474#false} is VALID [2022-04-27 11:13:43,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {6474#false} assume !false; {6474#false} is VALID [2022-04-27 11:13:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:13:43,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:43,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {6474#false} assume !false; {6474#false} is VALID [2022-04-27 11:13:43,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {6474#false} assume 0 == ~cond; {6474#false} is VALID [2022-04-27 11:13:43,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {6474#false} ~cond := #in~cond; {6474#false} is VALID [2022-04-27 11:13:43,078 INFO L272 TraceCheckUtils]: 22: Hoare triple {6474#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6474#false} is VALID [2022-04-27 11:13:43,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {6474#false} assume !(~y~0 % 4294967296 > 0); {6474#false} is VALID [2022-04-27 11:13:43,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {6474#false} assume !(~z~0 % 4294967296 > 0); {6474#false} is VALID [2022-04-27 11:13:43,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6474#false} is VALID [2022-04-27 11:13:43,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:43,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {6533#(< 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; {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:43,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {6533#(< 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; {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:43,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {6533#(< 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; {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:43,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:43,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {6509#(< 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; {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:43,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {6513#(< 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; {6509#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:43,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {6517#(< 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; {6513#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:43,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:43,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:43,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {6513#(< 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; {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:43,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {6509#(< 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; {6513#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:43,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {6473#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6509#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:43,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {6473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6473#true} is VALID [2022-04-27 11:13:43,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {6473#true} call #t~ret17 := main(); {6473#true} is VALID [2022-04-27 11:13:43,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6473#true} {6473#true} #94#return; {6473#true} is VALID [2022-04-27 11:13:43,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {6473#true} assume true; {6473#true} is VALID [2022-04-27 11:13:43,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {6473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6473#true} is VALID [2022-04-27 11:13:43,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {6473#true} call ULTIMATE.init(); {6473#true} is VALID [2022-04-27 11:13:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:13:43,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306109555] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:43,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:43,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-27 11:13:43,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498440737] [2022-04-27 11:13:43,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:43,093 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:13:43,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:43,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:43,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:43,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:13:43,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:43,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:13:43,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:13:43,124 INFO L87 Difference]: Start difference. First operand 148 states and 216 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:47,031 INFO L93 Difference]: Finished difference Result 360 states and 539 transitions. [2022-04-27 11:13:47,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-27 11:13:47,031 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:13:47,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:47,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 223 transitions. [2022-04-27 11:13:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 223 transitions. [2022-04-27 11:13:47,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 223 transitions. [2022-04-27 11:13:47,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:47,274 INFO L225 Difference]: With dead ends: 360 [2022-04-27 11:13:47,274 INFO L226 Difference]: Without dead ends: 323 [2022-04-27 11:13:47,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1678 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=681, Invalid=4869, Unknown=0, NotChecked=0, Total=5550 [2022-04-27 11:13:47,276 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 186 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:47,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 95 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 11:13:47,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-04-27 11:13:47,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 172. [2022-04-27 11:13:47,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:47,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 323 states. Second operand has 172 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 167 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:47,406 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand has 172 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 167 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:47,406 INFO L87 Difference]: Start difference. First operand 323 states. Second operand has 172 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 167 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:47,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:47,411 INFO L93 Difference]: Finished difference Result 323 states and 453 transitions. [2022-04-27 11:13:47,411 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 453 transitions. [2022-04-27 11:13:47,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:47,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:47,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 167 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 323 states. [2022-04-27 11:13:47,414 INFO L87 Difference]: Start difference. First operand has 172 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 167 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 323 states. [2022-04-27 11:13:47,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:47,420 INFO L93 Difference]: Finished difference Result 323 states and 453 transitions. [2022-04-27 11:13:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 453 transitions. [2022-04-27 11:13:47,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:47,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:47,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:47,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 167 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 252 transitions. [2022-04-27 11:13:47,423 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 252 transitions. Word has length 26 [2022-04-27 11:13:47,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:47,423 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 252 transitions. [2022-04-27 11:13:47,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:47,423 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 252 transitions. [2022-04-27 11:13:47,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 11:13:47,424 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:47,424 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:47,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 11:13:47,643 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,SelfDestructingSolverStorable9 [2022-04-27 11:13:47,644 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:47,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:47,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1353656475, now seen corresponding path program 2 times [2022-04-27 11:13:47,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:47,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112297450] [2022-04-27 11:13:47,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:47,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:47,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:47,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {8057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8044#true} is VALID [2022-04-27 11:13:47,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {8044#true} assume true; {8044#true} is VALID [2022-04-27 11:13:47,771 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8044#true} {8044#true} #94#return; {8044#true} is VALID [2022-04-27 11:13:47,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {8044#true} call ULTIMATE.init(); {8057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:47,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {8057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8044#true} is VALID [2022-04-27 11:13:47,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {8044#true} assume true; {8044#true} is VALID [2022-04-27 11:13:47,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8044#true} {8044#true} #94#return; {8044#true} is VALID [2022-04-27 11:13:47,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {8044#true} call #t~ret17 := main(); {8044#true} is VALID [2022-04-27 11:13:47,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {8044#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8049#(= main_~y~0 0)} is VALID [2022-04-27 11:13:47,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {8049#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8050#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:47,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {8050#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:47,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {8051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8052#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:47,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {8052#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8053#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:47,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {8053#(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; {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:47,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:47,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {8055#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:13:47,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {8055#(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; {8056#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:47,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {8056#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {8045#false} is VALID [2022-04-27 11:13:47,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {8045#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8045#false} is VALID [2022-04-27 11:13:47,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {8045#false} assume !(~y~0 % 4294967296 > 0); {8045#false} is VALID [2022-04-27 11:13:47,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {8045#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; {8045#false} is VALID [2022-04-27 11:13:47,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {8045#false} assume !(~x~0 % 4294967296 > 0); {8045#false} is VALID [2022-04-27 11:13:47,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {8045#false} assume !(~z~0 % 4294967296 > 0); {8045#false} is VALID [2022-04-27 11:13:47,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {8045#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {8045#false} is VALID [2022-04-27 11:13:47,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {8045#false} assume !(~y~0 % 4294967296 > 0); {8045#false} is VALID [2022-04-27 11:13:47,777 INFO L272 TraceCheckUtils]: 22: Hoare triple {8045#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8045#false} is VALID [2022-04-27 11:13:47,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {8045#false} ~cond := #in~cond; {8045#false} is VALID [2022-04-27 11:13:47,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {8045#false} assume 0 == ~cond; {8045#false} is VALID [2022-04-27 11:13:47,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {8045#false} assume !false; {8045#false} is VALID [2022-04-27 11:13:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:47,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:47,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112297450] [2022-04-27 11:13:47,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112297450] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:47,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387157116] [2022-04-27 11:13:47,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:13:47,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:47,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:47,778 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:13:47,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 11:13:47,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:13:47,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:47,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 11:13:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:47,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:48,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {8044#true} call ULTIMATE.init(); {8044#true} is VALID [2022-04-27 11:13:48,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {8044#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8044#true} is VALID [2022-04-27 11:13:48,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {8044#true} assume true; {8044#true} is VALID [2022-04-27 11:13:48,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8044#true} {8044#true} #94#return; {8044#true} is VALID [2022-04-27 11:13:48,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {8044#true} call #t~ret17 := main(); {8044#true} is VALID [2022-04-27 11:13:48,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {8044#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8049#(= main_~y~0 0)} is VALID [2022-04-27 11:13:48,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {8049#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8050#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:48,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {8050#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:48,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {8051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8052#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:48,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {8052#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8053#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:48,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {8053#(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; {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:48,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:48,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {8055#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:13:48,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {8055#(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; {8100#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:13:48,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {8100#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {8045#false} is VALID [2022-04-27 11:13:48,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {8045#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8045#false} is VALID [2022-04-27 11:13:48,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {8045#false} assume !(~y~0 % 4294967296 > 0); {8045#false} is VALID [2022-04-27 11:13:48,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {8045#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; {8045#false} is VALID [2022-04-27 11:13:48,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {8045#false} assume !(~x~0 % 4294967296 > 0); {8045#false} is VALID [2022-04-27 11:13:48,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {8045#false} assume !(~z~0 % 4294967296 > 0); {8045#false} is VALID [2022-04-27 11:13:48,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {8045#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {8045#false} is VALID [2022-04-27 11:13:48,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {8045#false} assume !(~y~0 % 4294967296 > 0); {8045#false} is VALID [2022-04-27 11:13:48,047 INFO L272 TraceCheckUtils]: 22: Hoare triple {8045#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8045#false} is VALID [2022-04-27 11:13:48,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {8045#false} ~cond := #in~cond; {8045#false} is VALID [2022-04-27 11:13:48,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {8045#false} assume 0 == ~cond; {8045#false} is VALID [2022-04-27 11:13:48,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {8045#false} assume !false; {8045#false} is VALID [2022-04-27 11:13:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:48,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:48,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {8045#false} assume !false; {8045#false} is VALID [2022-04-27 11:13:48,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {8045#false} assume 0 == ~cond; {8045#false} is VALID [2022-04-27 11:13:48,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {8045#false} ~cond := #in~cond; {8045#false} is VALID [2022-04-27 11:13:48,202 INFO L272 TraceCheckUtils]: 22: Hoare triple {8045#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8045#false} is VALID [2022-04-27 11:13:48,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {8045#false} assume !(~y~0 % 4294967296 > 0); {8045#false} is VALID [2022-04-27 11:13:48,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {8045#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {8045#false} is VALID [2022-04-27 11:13:48,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {8045#false} assume !(~z~0 % 4294967296 > 0); {8045#false} is VALID [2022-04-27 11:13:48,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {8045#false} assume !(~x~0 % 4294967296 > 0); {8045#false} is VALID [2022-04-27 11:13:48,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {8045#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; {8045#false} is VALID [2022-04-27 11:13:48,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {8045#false} assume !(~y~0 % 4294967296 > 0); {8045#false} is VALID [2022-04-27 11:13:48,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {8045#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8045#false} is VALID [2022-04-27 11:13:48,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {8170#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8045#false} is VALID [2022-04-27 11:13:48,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {8174#(< 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; {8170#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:48,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {8178#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {8174#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:48,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {8178#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {8178#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:48,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {8185#(< 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; {8178#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:48,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {8189#(< 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; {8185#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:48,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {8193#(< 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; {8189#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:13:48,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {8197#(< 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; {8193#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:13:48,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {8201#(< 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; {8197#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:13:48,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {8044#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8201#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:13:48,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {8044#true} call #t~ret17 := main(); {8044#true} is VALID [2022-04-27 11:13:48,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8044#true} {8044#true} #94#return; {8044#true} is VALID [2022-04-27 11:13:48,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {8044#true} assume true; {8044#true} is VALID [2022-04-27 11:13:48,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {8044#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8044#true} is VALID [2022-04-27 11:13:48,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {8044#true} call ULTIMATE.init(); {8044#true} is VALID [2022-04-27 11:13:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:48,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387157116] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:48,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:48,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-27 11:13:48,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235653120] [2022-04-27 11:13:48,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:48,211 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:13:48,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:48,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:48,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:48,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 11:13:48,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:48,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 11:13:48,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-27 11:13:48,235 INFO L87 Difference]: Start difference. First operand 172 states and 252 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:53,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:53,519 INFO L93 Difference]: Finished difference Result 414 states and 648 transitions. [2022-04-27 11:13:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-27 11:13:53,519 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:13:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 305 transitions. [2022-04-27 11:13:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 305 transitions. [2022-04-27 11:13:53,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 305 transitions. [2022-04-27 11:13:54,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 305 edges. 305 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:54,120 INFO L225 Difference]: With dead ends: 414 [2022-04-27 11:13:54,120 INFO L226 Difference]: Without dead ends: 348 [2022-04-27 11:13:54,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2196 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1524, Invalid=4956, Unknown=0, NotChecked=0, Total=6480 [2022-04-27 11:13:54,122 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 436 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:54,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 93 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 11:13:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-27 11:13:54,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 213. [2022-04-27 11:13:54,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:54,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 213 states, 208 states have (on average 1.4663461538461537) internal successors, (305), 208 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:54,284 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 213 states, 208 states have (on average 1.4663461538461537) internal successors, (305), 208 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:54,285 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 213 states, 208 states have (on average 1.4663461538461537) internal successors, (305), 208 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:54,290 INFO L93 Difference]: Finished difference Result 348 states and 499 transitions. [2022-04-27 11:13:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 499 transitions. [2022-04-27 11:13:54,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:54,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:54,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 208 states have (on average 1.4663461538461537) internal successors, (305), 208 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 348 states. [2022-04-27 11:13:54,291 INFO L87 Difference]: Start difference. First operand has 213 states, 208 states have (on average 1.4663461538461537) internal successors, (305), 208 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 348 states. [2022-04-27 11:13:54,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:54,297 INFO L93 Difference]: Finished difference Result 348 states and 499 transitions. [2022-04-27 11:13:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 499 transitions. [2022-04-27 11:13:54,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:54,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:54,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:54,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.4663461538461537) internal successors, (305), 208 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2022-04-27 11:13:54,300 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 26 [2022-04-27 11:13:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:54,300 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2022-04-27 11:13:54,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2022-04-27 11:13:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:13:54,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:54,301 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:54,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 11:13:54,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:54,518 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:54,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:54,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1990704551, now seen corresponding path program 3 times [2022-04-27 11:13:54,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:54,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432473810] [2022-04-27 11:13:54,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:54,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:54,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {9802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9794#true} is VALID [2022-04-27 11:13:54,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {9794#true} assume true; {9794#true} is VALID [2022-04-27 11:13:54,583 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9794#true} {9794#true} #94#return; {9794#true} is VALID [2022-04-27 11:13:54,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {9794#true} call ULTIMATE.init(); {9802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:54,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {9802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9794#true} is VALID [2022-04-27 11:13:54,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {9794#true} assume true; {9794#true} is VALID [2022-04-27 11:13:54,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9794#true} {9794#true} #94#return; {9794#true} is VALID [2022-04-27 11:13:54,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {9794#true} call #t~ret17 := main(); {9794#true} is VALID [2022-04-27 11:13:54,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {9794#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9794#true} is VALID [2022-04-27 11:13:54,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {9794#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9794#true} is VALID [2022-04-27 11:13:54,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {9794#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:54,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:54,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:54,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {9799#(<= 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; {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:54,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:54,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:54,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:54,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:54,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:54,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:54,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {9795#false} is VALID [2022-04-27 11:13:54,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {9795#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; {9795#false} is VALID [2022-04-27 11:13:54,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {9795#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; {9795#false} is VALID [2022-04-27 11:13:54,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {9795#false} assume !(~z~0 % 4294967296 > 0); {9795#false} is VALID [2022-04-27 11:13:54,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {9795#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9795#false} is VALID [2022-04-27 11:13:54,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {9795#false} assume !(~y~0 % 4294967296 > 0); {9795#false} is VALID [2022-04-27 11:13:54,604 INFO L272 TraceCheckUtils]: 23: Hoare triple {9795#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9795#false} is VALID [2022-04-27 11:13:54,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {9795#false} ~cond := #in~cond; {9795#false} is VALID [2022-04-27 11:13:54,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {9795#false} assume 0 == ~cond; {9795#false} is VALID [2022-04-27 11:13:54,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {9795#false} assume !false; {9795#false} is VALID [2022-04-27 11:13:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 11:13:54,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:54,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432473810] [2022-04-27 11:13:54,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432473810] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:54,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151641841] [2022-04-27 11:13:54,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:13:54,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:54,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:54,615 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:13:54,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 11:13:54,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 11:13:54,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:54,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:13:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:54,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:54,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {9794#true} call ULTIMATE.init(); {9794#true} is VALID [2022-04-27 11:13:54,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {9794#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9794#true} is VALID [2022-04-27 11:13:54,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {9794#true} assume true; {9794#true} is VALID [2022-04-27 11:13:54,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9794#true} {9794#true} #94#return; {9794#true} is VALID [2022-04-27 11:13:54,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {9794#true} call #t~ret17 := main(); {9794#true} is VALID [2022-04-27 11:13:54,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {9794#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9794#true} is VALID [2022-04-27 11:13:54,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {9794#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9794#true} is VALID [2022-04-27 11:13:54,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {9794#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:54,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:54,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:54,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {9799#(<= 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; {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:54,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:54,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:54,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:54,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:54,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:54,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:54,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {9795#false} is VALID [2022-04-27 11:13:54,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {9795#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; {9795#false} is VALID [2022-04-27 11:13:54,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {9795#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; {9795#false} is VALID [2022-04-27 11:13:54,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {9795#false} assume !(~z~0 % 4294967296 > 0); {9795#false} is VALID [2022-04-27 11:13:54,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {9795#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9795#false} is VALID [2022-04-27 11:13:54,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {9795#false} assume !(~y~0 % 4294967296 > 0); {9795#false} is VALID [2022-04-27 11:13:54,871 INFO L272 TraceCheckUtils]: 23: Hoare triple {9795#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9795#false} is VALID [2022-04-27 11:13:54,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {9795#false} ~cond := #in~cond; {9795#false} is VALID [2022-04-27 11:13:54,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {9795#false} assume 0 == ~cond; {9795#false} is VALID [2022-04-27 11:13:54,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {9795#false} assume !false; {9795#false} is VALID [2022-04-27 11:13:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 11:13:54,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:55,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {9795#false} assume !false; {9795#false} is VALID [2022-04-27 11:13:55,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {9795#false} assume 0 == ~cond; {9795#false} is VALID [2022-04-27 11:13:55,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {9795#false} ~cond := #in~cond; {9795#false} is VALID [2022-04-27 11:13:55,067 INFO L272 TraceCheckUtils]: 23: Hoare triple {9795#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9795#false} is VALID [2022-04-27 11:13:55,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {9795#false} assume !(~y~0 % 4294967296 > 0); {9795#false} is VALID [2022-04-27 11:13:55,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {9795#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9795#false} is VALID [2022-04-27 11:13:55,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {9795#false} assume !(~z~0 % 4294967296 > 0); {9795#false} is VALID [2022-04-27 11:13:55,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {9795#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; {9795#false} is VALID [2022-04-27 11:13:55,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {9795#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; {9795#false} is VALID [2022-04-27 11:13:55,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {9795#false} is VALID [2022-04-27 11:13:55,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:55,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:55,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:55,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:55,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:55,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:55,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {9799#(<= 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; {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:55,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:55,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:55,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {9794#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:55,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {9794#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9794#true} is VALID [2022-04-27 11:13:55,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {9794#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9794#true} is VALID [2022-04-27 11:13:55,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {9794#true} call #t~ret17 := main(); {9794#true} is VALID [2022-04-27 11:13:55,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9794#true} {9794#true} #94#return; {9794#true} is VALID [2022-04-27 11:13:55,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {9794#true} assume true; {9794#true} is VALID [2022-04-27 11:13:55,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {9794#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9794#true} is VALID [2022-04-27 11:13:55,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {9794#true} call ULTIMATE.init(); {9794#true} is VALID [2022-04-27 11:13:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 11:13:55,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151641841] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:55,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:55,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-27 11:13:55,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281936897] [2022-04-27 11:13:55,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:55,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 11:13:55,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:55,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:55,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:55,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:13:55,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:55,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:13:55,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:13:55,091 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:55,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:55,592 INFO L93 Difference]: Finished difference Result 316 states and 451 transitions. [2022-04-27 11:13:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:13:55,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 11:13:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-27 11:13:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-27 11:13:55,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2022-04-27 11:13:55,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:55,664 INFO L225 Difference]: With dead ends: 316 [2022-04-27 11:13:55,664 INFO L226 Difference]: Without dead ends: 303 [2022-04-27 11:13:55,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:13:55,665 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 44 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:55,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 47 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:13:55,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-27 11:13:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 222. [2022-04-27 11:13:55,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:55,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 222 states, 217 states have (on average 1.456221198156682) internal successors, (316), 217 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:55,859 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 222 states, 217 states have (on average 1.456221198156682) internal successors, (316), 217 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:55,859 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 222 states, 217 states have (on average 1.456221198156682) internal successors, (316), 217 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:55,863 INFO L93 Difference]: Finished difference Result 303 states and 434 transitions. [2022-04-27 11:13:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 434 transitions. [2022-04-27 11:13:55,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:55,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:55,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.456221198156682) internal successors, (316), 217 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 303 states. [2022-04-27 11:13:55,864 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.456221198156682) internal successors, (316), 217 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 303 states. [2022-04-27 11:13:55,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:55,869 INFO L93 Difference]: Finished difference Result 303 states and 434 transitions. [2022-04-27 11:13:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 434 transitions. [2022-04-27 11:13:55,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:55,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:55,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:55,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.456221198156682) internal successors, (316), 217 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 320 transitions. [2022-04-27 11:13:55,872 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 320 transitions. Word has length 27 [2022-04-27 11:13:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:55,872 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 320 transitions. [2022-04-27 11:13:55,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 320 transitions. [2022-04-27 11:13:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 11:13:55,873 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:55,873 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:55,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 11:13:56,089 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,SelfDestructingSolverStorable11 [2022-04-27 11:13:56,089 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:56,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:56,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1554538282, now seen corresponding path program 3 times [2022-04-27 11:13:56,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:56,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422023068] [2022-04-27 11:13:56,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:56,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:56,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:56,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {11244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11226#true} is VALID [2022-04-27 11:13:56,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {11226#true} assume true; {11226#true} is VALID [2022-04-27 11:13:56,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11226#true} {11226#true} #94#return; {11226#true} is VALID [2022-04-27 11:13:56,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {11226#true} call ULTIMATE.init(); {11244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:56,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {11244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11226#true} is VALID [2022-04-27 11:13:56,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {11226#true} assume true; {11226#true} is VALID [2022-04-27 11:13:56,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11226#true} {11226#true} #94#return; {11226#true} is VALID [2022-04-27 11:13:56,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {11226#true} call #t~ret17 := main(); {11226#true} is VALID [2022-04-27 11:13:56,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {11226#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11231#(= main_~y~0 0)} is VALID [2022-04-27 11:13:56,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {11231#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:56,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {11232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11233#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:56,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {11233#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:56,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {11234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11235#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:56,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {11235#(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; {11236#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:56,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {11236#(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; {11237#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:13:56,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {11237#(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; {11238#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:13:56,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {11238#(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; {11239#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:13:56,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {11239#(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; {11240#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:13:56,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {11240#(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; {11241#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:13:56,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {11241#(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; {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:13:56,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:13:56,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {11243#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-27 11:13:56,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {11243#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11227#false} is VALID [2022-04-27 11:13:56,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {11227#false} assume !(~y~0 % 4294967296 > 0); {11227#false} is VALID [2022-04-27 11:13:56,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {11227#false} assume !(~x~0 % 4294967296 > 0); {11227#false} is VALID [2022-04-27 11:13:56,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {11227#false} assume !(~z~0 % 4294967296 > 0); {11227#false} is VALID [2022-04-27 11:13:56,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {11227#false} assume !(~y~0 % 4294967296 > 0); {11227#false} is VALID [2022-04-27 11:13:56,298 INFO L272 TraceCheckUtils]: 24: Hoare triple {11227#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11227#false} is VALID [2022-04-27 11:13:56,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {11227#false} ~cond := #in~cond; {11227#false} is VALID [2022-04-27 11:13:56,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {11227#false} assume 0 == ~cond; {11227#false} is VALID [2022-04-27 11:13:56,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {11227#false} assume !false; {11227#false} is VALID [2022-04-27 11:13:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:56,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:56,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422023068] [2022-04-27 11:13:56,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422023068] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:56,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49860516] [2022-04-27 11:13:56,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:13:56,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:56,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:56,303 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:13:56,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 11:13:56,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-04-27 11:13:56,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:56,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-27 11:13:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:56,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:56,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {11226#true} call ULTIMATE.init(); {11226#true} is VALID [2022-04-27 11:13:56,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {11226#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11226#true} is VALID [2022-04-27 11:13:56,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {11226#true} assume true; {11226#true} is VALID [2022-04-27 11:13:56,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11226#true} {11226#true} #94#return; {11226#true} is VALID [2022-04-27 11:13:56,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {11226#true} call #t~ret17 := main(); {11226#true} is VALID [2022-04-27 11:13:56,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {11226#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11231#(= main_~y~0 0)} is VALID [2022-04-27 11:13:56,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {11231#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:56,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {11232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11233#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:56,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {11233#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:56,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {11234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11235#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:56,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {11235#(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; {11236#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:56,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {11236#(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; {11237#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:13:56,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {11237#(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; {11238#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:13:56,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {11238#(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; {11239#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:13:56,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {11239#(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; {11240#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:13:56,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {11240#(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; {11241#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:13:56,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {11241#(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; {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:13:56,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:13:56,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {11302#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:13:56,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {11302#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11227#false} is VALID [2022-04-27 11:13:56,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {11227#false} assume !(~y~0 % 4294967296 > 0); {11227#false} is VALID [2022-04-27 11:13:56,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {11227#false} assume !(~x~0 % 4294967296 > 0); {11227#false} is VALID [2022-04-27 11:13:56,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {11227#false} assume !(~z~0 % 4294967296 > 0); {11227#false} is VALID [2022-04-27 11:13:56,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {11227#false} assume !(~y~0 % 4294967296 > 0); {11227#false} is VALID [2022-04-27 11:13:56,661 INFO L272 TraceCheckUtils]: 24: Hoare triple {11227#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11227#false} is VALID [2022-04-27 11:13:56,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {11227#false} ~cond := #in~cond; {11227#false} is VALID [2022-04-27 11:13:56,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {11227#false} assume 0 == ~cond; {11227#false} is VALID [2022-04-27 11:13:56,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {11227#false} assume !false; {11227#false} is VALID [2022-04-27 11:13:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:56,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:56,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {11227#false} assume !false; {11227#false} is VALID [2022-04-27 11:13:56,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {11227#false} assume 0 == ~cond; {11227#false} is VALID [2022-04-27 11:13:56,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {11227#false} ~cond := #in~cond; {11227#false} is VALID [2022-04-27 11:13:56,973 INFO L272 TraceCheckUtils]: 24: Hoare triple {11227#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11227#false} is VALID [2022-04-27 11:13:56,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {11227#false} assume !(~y~0 % 4294967296 > 0); {11227#false} is VALID [2022-04-27 11:13:56,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {11227#false} assume !(~z~0 % 4294967296 > 0); {11227#false} is VALID [2022-04-27 11:13:56,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {11227#false} assume !(~x~0 % 4294967296 > 0); {11227#false} is VALID [2022-04-27 11:13:56,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {11227#false} assume !(~y~0 % 4294967296 > 0); {11227#false} is VALID [2022-04-27 11:13:56,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {11354#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11227#false} is VALID [2022-04-27 11:13:56,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {11358#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {11354#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:56,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {11358#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11358#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:56,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {11365#(< 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; {11358#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:56,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {11369#(< 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; {11365#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:13:56,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {11373#(< 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; {11369#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:13:56,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {11377#(< 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; {11373#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:13:56,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {11381#(< 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; {11377#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:13:56,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {11385#(< 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; {11381#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:13:56,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {11389#(< 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; {11385#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:13:56,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {11393#(< 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; {11389#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:13:56,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {11397#(< 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; {11393#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:13:56,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {11401#(< 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; {11397#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:13:56,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {11405#(< 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; {11401#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:13:56,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {11226#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11405#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:13:56,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {11226#true} call #t~ret17 := main(); {11226#true} is VALID [2022-04-27 11:13:56,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11226#true} {11226#true} #94#return; {11226#true} is VALID [2022-04-27 11:13:56,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {11226#true} assume true; {11226#true} is VALID [2022-04-27 11:13:56,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {11226#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11226#true} is VALID [2022-04-27 11:13:56,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {11226#true} call ULTIMATE.init(); {11226#true} is VALID [2022-04-27 11:13:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:56,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49860516] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:56,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:56,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-27 11:13:56,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214686789] [2022-04-27 11:13:56,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:56,984 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 11:13:56,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:56,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:57,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:57,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 11:13:57,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:57,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 11:13:57,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2022-04-27 11:13:57,011 INFO L87 Difference]: Start difference. First operand 222 states and 320 transitions. Second operand has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:29,339 INFO L93 Difference]: Finished difference Result 774 states and 1227 transitions. [2022-04-27 11:14:29,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-27 11:14:29,339 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 11:14:29,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 423 transitions. [2022-04-27 11:14:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:29,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 423 transitions. [2022-04-27 11:14:29,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 423 transitions. [2022-04-27 11:14:32,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:32,624 INFO L225 Difference]: With dead ends: 774 [2022-04-27 11:14:32,624 INFO L226 Difference]: Without dead ends: 719 [2022-04-27 11:14:32,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=1980, Invalid=5676, Unknown=0, NotChecked=0, Total=7656 [2022-04-27 11:14:32,629 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 1346 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:32,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 138 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-27 11:14:32,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-04-27 11:14:33,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 360. [2022-04-27 11:14:33,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:33,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 719 states. Second operand has 360 states, 355 states have (on average 1.4873239436619718) internal successors, (528), 355 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:33,064 INFO L74 IsIncluded]: Start isIncluded. First operand 719 states. Second operand has 360 states, 355 states have (on average 1.4873239436619718) internal successors, (528), 355 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:33,064 INFO L87 Difference]: Start difference. First operand 719 states. Second operand has 360 states, 355 states have (on average 1.4873239436619718) internal successors, (528), 355 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:33,079 INFO L93 Difference]: Finished difference Result 719 states and 1032 transitions. [2022-04-27 11:14:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1032 transitions. [2022-04-27 11:14:33,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:33,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:33,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 360 states, 355 states have (on average 1.4873239436619718) internal successors, (528), 355 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 719 states. [2022-04-27 11:14:33,081 INFO L87 Difference]: Start difference. First operand has 360 states, 355 states have (on average 1.4873239436619718) internal successors, (528), 355 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 719 states. [2022-04-27 11:14:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:33,095 INFO L93 Difference]: Finished difference Result 719 states and 1032 transitions. [2022-04-27 11:14:33,095 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1032 transitions. [2022-04-27 11:14:33,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:33,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:33,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:33,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 355 states have (on average 1.4873239436619718) internal successors, (528), 355 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 532 transitions. [2022-04-27 11:14:33,101 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 532 transitions. Word has length 28 [2022-04-27 11:14:33,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:33,101 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 532 transitions. [2022-04-27 11:14:33,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 532 transitions. [2022-04-27 11:14:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 11:14:33,102 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:33,102 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:33,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 11:14:33,306 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,SelfDestructingSolverStorable12 [2022-04-27 11:14:33,306 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:33,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:33,306 INFO L85 PathProgramCache]: Analyzing trace with hash 939274105, now seen corresponding path program 4 times [2022-04-27 11:14:33,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:33,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821958633] [2022-04-27 11:14:33,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:33,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:33,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:33,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {14363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14348#true} is VALID [2022-04-27 11:14:33,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {14348#true} assume true; {14348#true} is VALID [2022-04-27 11:14:33,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14348#true} {14348#true} #94#return; {14348#true} is VALID [2022-04-27 11:14:33,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {14348#true} call ULTIMATE.init(); {14363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:33,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {14363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14348#true} is VALID [2022-04-27 11:14:33,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {14348#true} assume true; {14348#true} is VALID [2022-04-27 11:14:33,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14348#true} {14348#true} #94#return; {14348#true} is VALID [2022-04-27 11:14:33,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {14348#true} call #t~ret17 := main(); {14348#true} is VALID [2022-04-27 11:14:33,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {14348#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14353#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:14:33,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {14353#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14354#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:33,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {14354#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14355#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-27 11:14:33,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {14355#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} assume !(~x~0 % 4294967296 > 0); {14356#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:33,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {14356#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:14:33,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-27 11:14:33,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) 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; {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-27 11:14:33,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-27 11:14:33,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) 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; {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-27 11:14:33,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) 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; {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:14:33,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !(~y~0 % 4294967296 > 0); {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:14:33,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~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; {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:14:33,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~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; {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:14:33,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !(~x~0 % 4294967296 > 0); {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:14:33,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~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; {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-27 11:14:33,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) 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; {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-27 11:14:33,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-27 11:14:33,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-27 11:14:33,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:33,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:33,675 INFO L272 TraceCheckUtils]: 25: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14361#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:14:33,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {14361#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {14362#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:14:33,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {14362#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14349#false} is VALID [2022-04-27 11:14:33,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {14349#false} assume !false; {14349#false} is VALID [2022-04-27 11:14:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:14:33,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:33,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821958633] [2022-04-27 11:14:33,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821958633] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:33,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430502940] [2022-04-27 11:14:33,676 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:14:33,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:33,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:33,677 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:14:33,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 11:14:33,761 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:14:33,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:33,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-27 11:14:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:33,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:04,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {14348#true} call ULTIMATE.init(); {14348#true} is VALID [2022-04-27 11:15:04,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {14348#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14348#true} is VALID [2022-04-27 11:15:04,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {14348#true} assume true; {14348#true} is VALID [2022-04-27 11:15:04,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14348#true} {14348#true} #94#return; {14348#true} is VALID [2022-04-27 11:15:04,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {14348#true} call #t~ret17 := main(); {14348#true} is VALID [2022-04-27 11:15:04,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {14348#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14353#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:15:04,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {14353#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14354#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:04,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {14354#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14388#(and (<= 2 main_~y~0) (<= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:15:04,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {14388#(and (<= 2 main_~y~0) (<= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !(~x~0 % 4294967296 > 0); {14392#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= (mod main_~x~0 4294967296) 0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:15:04,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {14392#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= (mod main_~x~0 4294967296) 0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} ~z~0 := ~y~0; {14396#(and (<= main_~z~0 2) (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (mod main_~x~0 4294967296) 0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:04,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {14396#(and (<= main_~z~0 2) (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (mod main_~x~0 4294967296) 0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= 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; {14400#(and (<= main_~z~0 1) (<= main_~x~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= 1 main_~z~0) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 11:15:04,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {14400#(and (<= main_~z~0 1) (<= main_~x~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= 1 main_~z~0) (<= (+ main_~z~0 main_~x~0) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14404#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:04,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {14404#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {14404#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:04,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {14404#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (+ main_~z~0 main_~x~0) main_~n~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; {14411#(and (<= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (<= main_~x~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967295)) (<= main_~z~0 1) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:04,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {14411#(and (<= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (<= main_~x~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967295)) (<= main_~z~0 1) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14415#(and (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~z~0 2) (<= (+ main_~z~0 main_~x~0) (+ main_~n~0 2)) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:04,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {14415#(and (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~z~0 2) (<= (+ main_~z~0 main_~x~0) (+ main_~n~0 2)) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {14415#(and (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~z~0 2) (<= (+ main_~z~0 main_~x~0) (+ main_~n~0 2)) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:04,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {14415#(and (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~z~0 2) (<= (+ main_~z~0 main_~x~0) (+ main_~n~0 2)) (<= 2 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:15:04,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~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; {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:15:04,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !(~x~0 % 4294967296 > 0); {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:15:04,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~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; {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-27 11:15:04,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) 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; {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-27 11:15:04,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-27 11:15:04,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-27 11:15:04,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:15:04,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !(~y~0 % 4294967296 > 0); {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:15:04,194 INFO L272 TraceCheckUtils]: 25: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14449#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:15:04,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {14449#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14453#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:15:04,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {14453#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14349#false} is VALID [2022-04-27 11:15:04,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {14349#false} assume !false; {14349#false} is VALID [2022-04-27 11:15:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:15:04,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:04,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {14349#false} assume !false; {14349#false} is VALID [2022-04-27 11:15:04,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {14453#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14349#false} is VALID [2022-04-27 11:15:04,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {14449#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14453#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:15:04,900 INFO L272 TraceCheckUtils]: 25: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14449#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:15:04,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:15:04,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:15:04,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:15:04,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:15:04,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (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; {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:15:04,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~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; {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:15:04,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:15:04,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~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; {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:15:04,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~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; {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:15:04,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:15:04,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~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; {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:15:04,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 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; {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:15:04,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:15:04,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:15:04,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {14516#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:15:04,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {14520#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {14516#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:15:04,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {14524#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {14520#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:15:04,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {14528#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (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; {14524#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:15:04,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {14532#(or (<= (mod (+ main_~y~0 2) 4294967296) 0) (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14528#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:15:04,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {14348#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14532#(or (<= (mod (+ main_~y~0 2) 4294967296) 0) (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:15:04,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {14348#true} call #t~ret17 := main(); {14348#true} is VALID [2022-04-27 11:15:04,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14348#true} {14348#true} #94#return; {14348#true} is VALID [2022-04-27 11:15:04,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {14348#true} assume true; {14348#true} is VALID [2022-04-27 11:15:04,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {14348#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14348#true} is VALID [2022-04-27 11:15:04,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {14348#true} call ULTIMATE.init(); {14348#true} is VALID [2022-04-27 11:15:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:15:04,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430502940] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:04,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:04,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 12] total 29 [2022-04-27 11:15:04,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124480187] [2022-04-27 11:15:04,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:04,917 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 26 states have internal predecessors, (57), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 11:15:04,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:04,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 26 states have internal predecessors, (57), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:05,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:05,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-27 11:15:05,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:05,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-27 11:15:05,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2022-04-27 11:15:05,055 INFO L87 Difference]: Start difference. First operand 360 states and 532 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 26 states have internal predecessors, (57), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:19,755 INFO L93 Difference]: Finished difference Result 520 states and 719 transitions. [2022-04-27 11:15:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-27 11:15:19,756 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 26 states have internal predecessors, (57), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 11:15:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 26 states have internal predecessors, (57), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 123 transitions. [2022-04-27 11:15:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 26 states have internal predecessors, (57), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 123 transitions. [2022-04-27 11:15:19,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 123 transitions. [2022-04-27 11:15:20,308 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-27 11:15:20,317 INFO L225 Difference]: With dead ends: 520 [2022-04-27 11:15:20,318 INFO L226 Difference]: Without dead ends: 508 [2022-04-27 11:15:20,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1562 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=682, Invalid=4720, Unknown=0, NotChecked=0, Total=5402 [2022-04-27 11:15:20,319 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 107 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:20,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 83 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 11:15:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-04-27 11:15:20,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 373. [2022-04-27 11:15:20,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:20,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 508 states. Second operand has 373 states, 368 states have (on average 1.4809782608695652) internal successors, (545), 368 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:20,771 INFO L74 IsIncluded]: Start isIncluded. First operand 508 states. Second operand has 373 states, 368 states have (on average 1.4809782608695652) internal successors, (545), 368 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:20,771 INFO L87 Difference]: Start difference. First operand 508 states. Second operand has 373 states, 368 states have (on average 1.4809782608695652) internal successors, (545), 368 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:20,780 INFO L93 Difference]: Finished difference Result 508 states and 705 transitions. [2022-04-27 11:15:20,780 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 705 transitions. [2022-04-27 11:15:20,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:20,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:20,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 373 states, 368 states have (on average 1.4809782608695652) internal successors, (545), 368 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 508 states. [2022-04-27 11:15:20,781 INFO L87 Difference]: Start difference. First operand has 373 states, 368 states have (on average 1.4809782608695652) internal successors, (545), 368 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 508 states. [2022-04-27 11:15:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:20,790 INFO L93 Difference]: Finished difference Result 508 states and 705 transitions. [2022-04-27 11:15:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 705 transitions. [2022-04-27 11:15:20,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:20,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:20,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:20,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 368 states have (on average 1.4809782608695652) internal successors, (545), 368 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 549 transitions. [2022-04-27 11:15:20,796 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 549 transitions. Word has length 29 [2022-04-27 11:15:20,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:20,796 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 549 transitions. [2022-04-27 11:15:20,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 26 states have internal predecessors, (57), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 549 transitions. [2022-04-27 11:15:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 11:15:20,797 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:20,797 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:20,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 11:15:21,003 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,SelfDestructingSolverStorable13 [2022-04-27 11:15:21,003 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:21,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1025176473, now seen corresponding path program 4 times [2022-04-27 11:15:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:21,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64800795] [2022-04-27 11:15:21,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:21,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:21,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {16753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16737#true} is VALID [2022-04-27 11:15:21,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {16737#true} assume true; {16737#true} is VALID [2022-04-27 11:15:21,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16737#true} {16737#true} #94#return; {16737#true} is VALID [2022-04-27 11:15:21,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {16737#true} call ULTIMATE.init(); {16753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:21,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {16753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16737#true} is VALID [2022-04-27 11:15:21,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {16737#true} assume true; {16737#true} is VALID [2022-04-27 11:15:21,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16737#true} {16737#true} #94#return; {16737#true} is VALID [2022-04-27 11:15:21,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {16737#true} call #t~ret17 := main(); {16737#true} is VALID [2022-04-27 11:15:21,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {16737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16742#(= main_~y~0 0)} is VALID [2022-04-27 11:15:21,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {16742#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:21,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {16743#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16744#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:21,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {16744#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16745#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:21,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {16745#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:21,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {16746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:21,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {16746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {16747#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:15:21,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {16747#(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; {16748#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:21,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {16748#(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; {16749#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:21,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {16749#(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; {16750#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:21,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {16750#(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; {16751#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:21,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {16751#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {16751#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:21,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {16751#(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; {16750#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:21,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {16750#(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; {16749#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:21,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {16749#(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; {16748#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:21,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {16748#(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; {16752#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:15:21,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {16752#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {16752#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:15:21,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {16752#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {16752#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:15:21,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {16752#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {16738#false} is VALID [2022-04-27 11:15:21,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {16738#false} assume !(~y~0 % 4294967296 > 0); {16738#false} is VALID [2022-04-27 11:15:21,205 INFO L272 TraceCheckUtils]: 25: Hoare triple {16738#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16738#false} is VALID [2022-04-27 11:15:21,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {16738#false} ~cond := #in~cond; {16738#false} is VALID [2022-04-27 11:15:21,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {16738#false} assume 0 == ~cond; {16738#false} is VALID [2022-04-27 11:15:21,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {16738#false} assume !false; {16738#false} is VALID [2022-04-27 11:15:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:21,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:21,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64800795] [2022-04-27 11:15:21,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64800795] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:21,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115532936] [2022-04-27 11:15:21,205 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:15:21,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:21,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:21,206 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:15:21,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 11:15:21,245 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:15:21,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:21,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 11:15:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:21,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:21,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {16737#true} call ULTIMATE.init(); {16737#true} is VALID [2022-04-27 11:15:21,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {16737#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16737#true} is VALID [2022-04-27 11:15:21,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {16737#true} assume true; {16737#true} is VALID [2022-04-27 11:15:21,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16737#true} {16737#true} #94#return; {16737#true} is VALID [2022-04-27 11:15:21,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {16737#true} call #t~ret17 := main(); {16737#true} is VALID [2022-04-27 11:15:21,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {16737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16737#true} is VALID [2022-04-27 11:15:21,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {16737#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16775#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:21,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {16775#(< 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; {16779#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:21,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {16779#(< 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; {16783#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:21,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {16783#(< 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; {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:21,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:21,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:21,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {16787#(< 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; {16783#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:21,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {16783#(< 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; {16779#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:21,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {16779#(< 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; {16775#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:21,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {16775#(< 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; {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:21,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:21,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {16806#(< 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; {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:21,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {16806#(< 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; {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:21,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {16806#(< 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; {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:21,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {16806#(< 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; {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:21,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:21,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16738#false} is VALID [2022-04-27 11:15:21,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {16738#false} assume !(~z~0 % 4294967296 > 0); {16738#false} is VALID [2022-04-27 11:15:21,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {16738#false} assume !(~y~0 % 4294967296 > 0); {16738#false} is VALID [2022-04-27 11:15:21,393 INFO L272 TraceCheckUtils]: 25: Hoare triple {16738#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16738#false} is VALID [2022-04-27 11:15:21,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {16738#false} ~cond := #in~cond; {16738#false} is VALID [2022-04-27 11:15:21,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {16738#false} assume 0 == ~cond; {16738#false} is VALID [2022-04-27 11:15:21,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {16738#false} assume !false; {16738#false} is VALID [2022-04-27 11:15:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:15:21,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:21,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {16738#false} assume !false; {16738#false} is VALID [2022-04-27 11:15:21,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {16738#false} assume 0 == ~cond; {16738#false} is VALID [2022-04-27 11:15:21,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {16738#false} ~cond := #in~cond; {16738#false} is VALID [2022-04-27 11:15:21,475 INFO L272 TraceCheckUtils]: 25: Hoare triple {16738#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16738#false} is VALID [2022-04-27 11:15:21,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {16738#false} assume !(~y~0 % 4294967296 > 0); {16738#false} is VALID [2022-04-27 11:15:21,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {16738#false} assume !(~z~0 % 4294967296 > 0); {16738#false} is VALID [2022-04-27 11:15:21,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16738#false} is VALID [2022-04-27 11:15:21,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:21,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {16806#(< 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; {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:21,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {16806#(< 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; {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:21,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {16806#(< 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; {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:21,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {16806#(< 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; {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:21,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:21,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {16775#(< 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; {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:21,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {16779#(< 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; {16775#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:21,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {16783#(< 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; {16779#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:21,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {16787#(< 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; {16783#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:21,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:21,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:21,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {16783#(< 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; {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:21,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {16779#(< 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; {16783#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:21,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {16775#(< 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; {16779#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:21,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {16737#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16775#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:21,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {16737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16737#true} is VALID [2022-04-27 11:15:21,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {16737#true} call #t~ret17 := main(); {16737#true} is VALID [2022-04-27 11:15:21,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16737#true} {16737#true} #94#return; {16737#true} is VALID [2022-04-27 11:15:21,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {16737#true} assume true; {16737#true} is VALID [2022-04-27 11:15:21,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {16737#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16737#true} is VALID [2022-04-27 11:15:21,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {16737#true} call ULTIMATE.init(); {16737#true} is VALID [2022-04-27 11:15:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:15:21,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115532936] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:21,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:21,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-27 11:15:21,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822676802] [2022-04-27 11:15:21,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:21,498 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 11:15:21,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:21,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:21,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:21,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 11:15:21,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:21,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 11:15:21,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:15:21,530 INFO L87 Difference]: Start difference. First operand 373 states and 549 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:31,997 INFO L93 Difference]: Finished difference Result 972 states and 1402 transitions. [2022-04-27 11:15:31,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-04-27 11:15:31,997 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 11:15:31,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 342 transitions. [2022-04-27 11:15:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 342 transitions. [2022-04-27 11:15:32,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 342 transitions. [2022-04-27 11:15:32,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 342 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:32,518 INFO L225 Difference]: With dead ends: 972 [2022-04-27 11:15:32,518 INFO L226 Difference]: Without dead ends: 900 [2022-04-27 11:15:32,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6101 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1543, Invalid=15227, Unknown=0, NotChecked=0, Total=16770 [2022-04-27 11:15:32,521 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 343 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 609 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 609 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:32,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 108 Invalid, 2142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [609 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-27 11:15:32,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2022-04-27 11:15:33,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 425. [2022-04-27 11:15:33,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:33,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 900 states. Second operand has 425 states, 420 states have (on average 1.4952380952380953) internal successors, (628), 420 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:33,035 INFO L74 IsIncluded]: Start isIncluded. First operand 900 states. Second operand has 425 states, 420 states have (on average 1.4952380952380953) internal successors, (628), 420 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:33,035 INFO L87 Difference]: Start difference. First operand 900 states. Second operand has 425 states, 420 states have (on average 1.4952380952380953) internal successors, (628), 420 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:33,057 INFO L93 Difference]: Finished difference Result 900 states and 1218 transitions. [2022-04-27 11:15:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1218 transitions. [2022-04-27 11:15:33,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:33,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:33,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 425 states, 420 states have (on average 1.4952380952380953) internal successors, (628), 420 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 900 states. [2022-04-27 11:15:33,059 INFO L87 Difference]: Start difference. First operand has 425 states, 420 states have (on average 1.4952380952380953) internal successors, (628), 420 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 900 states. [2022-04-27 11:15:33,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:33,081 INFO L93 Difference]: Finished difference Result 900 states and 1218 transitions. [2022-04-27 11:15:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1218 transitions. [2022-04-27 11:15:33,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:33,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:33,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:33,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 420 states have (on average 1.4952380952380953) internal successors, (628), 420 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 632 transitions. [2022-04-27 11:15:33,089 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 632 transitions. Word has length 29 [2022-04-27 11:15:33,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:33,089 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 632 transitions. [2022-04-27 11:15:33,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:33,089 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 632 transitions. [2022-04-27 11:15:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 11:15:33,090 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:33,090 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:33,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-27 11:15:33,303 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,SelfDestructingSolverStorable14 [2022-04-27 11:15:33,303 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1167289689, now seen corresponding path program 5 times [2022-04-27 11:15:33,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:33,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422179216] [2022-04-27 11:15:33,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:33,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:33,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:33,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {20588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20580#true} is VALID [2022-04-27 11:15:33,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {20580#true} assume true; {20580#true} is VALID [2022-04-27 11:15:33,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20580#true} {20580#true} #94#return; {20580#true} is VALID [2022-04-27 11:15:33,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {20580#true} call ULTIMATE.init(); {20588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:33,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {20588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20580#true} is VALID [2022-04-27 11:15:33,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {20580#true} assume true; {20580#true} is VALID [2022-04-27 11:15:33,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20580#true} {20580#true} #94#return; {20580#true} is VALID [2022-04-27 11:15:33,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {20580#true} call #t~ret17 := main(); {20580#true} is VALID [2022-04-27 11:15:33,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {20580#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20580#true} is VALID [2022-04-27 11:15:33,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {20580#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20580#true} is VALID [2022-04-27 11:15:33,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {20580#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20580#true} is VALID [2022-04-27 11:15:33,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {20580#true} assume !(~x~0 % 4294967296 > 0); {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:33,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:33,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {20585#(<= 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; {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:15:33,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {20586#(<= 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; {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:33,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:33,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:33,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:33,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:33,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {20587#(<= 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; {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:15:33,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {20586#(<= 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; {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:33,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {20585#(<= 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; {20581#false} is VALID [2022-04-27 11:15:33,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {20581#false} assume !(~x~0 % 4294967296 > 0); {20581#false} is VALID [2022-04-27 11:15:33,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {20581#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; {20581#false} is VALID [2022-04-27 11:15:33,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {20581#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; {20581#false} is VALID [2022-04-27 11:15:33,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {20581#false} assume !(~z~0 % 4294967296 > 0); {20581#false} is VALID [2022-04-27 11:15:33,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {20581#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {20581#false} is VALID [2022-04-27 11:15:33,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {20581#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {20581#false} is VALID [2022-04-27 11:15:33,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {20581#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {20581#false} is VALID [2022-04-27 11:15:33,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {20581#false} assume !(~y~0 % 4294967296 > 0); {20581#false} is VALID [2022-04-27 11:15:33,377 INFO L272 TraceCheckUtils]: 27: Hoare triple {20581#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20581#false} is VALID [2022-04-27 11:15:33,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {20581#false} ~cond := #in~cond; {20581#false} is VALID [2022-04-27 11:15:33,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {20581#false} assume 0 == ~cond; {20581#false} is VALID [2022-04-27 11:15:33,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {20581#false} assume !false; {20581#false} is VALID [2022-04-27 11:15:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:15:33,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:33,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422179216] [2022-04-27 11:15:33,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422179216] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:33,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639234391] [2022-04-27 11:15:33,378 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:15:33,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:33,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:33,379 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:15:33,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 11:15:33,432 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-04-27 11:15:33,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:33,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 11:15:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:33,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:33,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {20580#true} call ULTIMATE.init(); {20580#true} is VALID [2022-04-27 11:15:33,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {20580#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20580#true} is VALID [2022-04-27 11:15:33,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {20580#true} assume true; {20580#true} is VALID [2022-04-27 11:15:33,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20580#true} {20580#true} #94#return; {20580#true} is VALID [2022-04-27 11:15:33,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {20580#true} call #t~ret17 := main(); {20580#true} is VALID [2022-04-27 11:15:33,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {20580#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20580#true} is VALID [2022-04-27 11:15:33,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {20580#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20580#true} is VALID [2022-04-27 11:15:33,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {20580#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20580#true} is VALID [2022-04-27 11:15:33,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {20580#true} assume !(~x~0 % 4294967296 > 0); {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:33,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:33,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {20585#(<= 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; {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:15:33,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {20586#(<= 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; {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:33,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:33,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:33,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:33,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:33,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {20587#(<= 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; {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:15:33,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {20586#(<= 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; {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:33,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {20585#(<= 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; {20581#false} is VALID [2022-04-27 11:15:33,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {20581#false} assume !(~x~0 % 4294967296 > 0); {20581#false} is VALID [2022-04-27 11:15:33,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {20581#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; {20581#false} is VALID [2022-04-27 11:15:33,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {20581#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; {20581#false} is VALID [2022-04-27 11:15:33,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {20581#false} assume !(~z~0 % 4294967296 > 0); {20581#false} is VALID [2022-04-27 11:15:33,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {20581#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {20581#false} is VALID [2022-04-27 11:15:33,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {20581#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {20581#false} is VALID [2022-04-27 11:15:33,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {20581#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {20581#false} is VALID [2022-04-27 11:15:33,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {20581#false} assume !(~y~0 % 4294967296 > 0); {20581#false} is VALID [2022-04-27 11:15:33,522 INFO L272 TraceCheckUtils]: 27: Hoare triple {20581#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20581#false} is VALID [2022-04-27 11:15:33,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {20581#false} ~cond := #in~cond; {20581#false} is VALID [2022-04-27 11:15:33,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {20581#false} assume 0 == ~cond; {20581#false} is VALID [2022-04-27 11:15:33,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {20581#false} assume !false; {20581#false} is VALID [2022-04-27 11:15:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:15:33,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:33,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {20581#false} assume !false; {20581#false} is VALID [2022-04-27 11:15:33,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {20581#false} assume 0 == ~cond; {20581#false} is VALID [2022-04-27 11:15:33,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {20581#false} ~cond := #in~cond; {20581#false} is VALID [2022-04-27 11:15:33,626 INFO L272 TraceCheckUtils]: 27: Hoare triple {20581#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20581#false} is VALID [2022-04-27 11:15:33,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {20581#false} assume !(~y~0 % 4294967296 > 0); {20581#false} is VALID [2022-04-27 11:15:33,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {20581#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {20581#false} is VALID [2022-04-27 11:15:33,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {20581#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {20581#false} is VALID [2022-04-27 11:15:33,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {20581#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {20581#false} is VALID [2022-04-27 11:15:33,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {20581#false} assume !(~z~0 % 4294967296 > 0); {20581#false} is VALID [2022-04-27 11:15:33,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {20581#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; {20581#false} is VALID [2022-04-27 11:15:33,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {20581#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; {20581#false} is VALID [2022-04-27 11:15:33,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {20581#false} assume !(~x~0 % 4294967296 > 0); {20581#false} is VALID [2022-04-27 11:15:33,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {20585#(<= 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; {20581#false} is VALID [2022-04-27 11:15:33,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {20586#(<= 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; {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:33,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {20587#(<= 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; {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:15:33,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:33,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:33,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:33,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:33,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {20586#(<= 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; {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:33,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {20585#(<= 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; {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:15:33,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:33,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {20580#true} assume !(~x~0 % 4294967296 > 0); {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:33,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {20580#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20580#true} is VALID [2022-04-27 11:15:33,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {20580#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20580#true} is VALID [2022-04-27 11:15:33,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {20580#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20580#true} is VALID [2022-04-27 11:15:33,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {20580#true} call #t~ret17 := main(); {20580#true} is VALID [2022-04-27 11:15:33,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20580#true} {20580#true} #94#return; {20580#true} is VALID [2022-04-27 11:15:33,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {20580#true} assume true; {20580#true} is VALID [2022-04-27 11:15:33,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {20580#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20580#true} is VALID [2022-04-27 11:15:33,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {20580#true} call ULTIMATE.init(); {20580#true} is VALID [2022-04-27 11:15:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:15:33,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639234391] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:33,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:33,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-27 11:15:33,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692300146] [2022-04-27 11:15:33,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:33,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 11:15:33,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:33,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:33,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:33,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:15:33,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:33,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:15:33,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:15:33,654 INFO L87 Difference]: Start difference. First operand 425 states and 632 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:34,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:34,510 INFO L93 Difference]: Finished difference Result 667 states and 980 transitions. [2022-04-27 11:15:34,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:15:34,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 11:15:34,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-27 11:15:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-27 11:15:34,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-04-27 11:15:34,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:34,568 INFO L225 Difference]: With dead ends: 667 [2022-04-27 11:15:34,568 INFO L226 Difference]: Without dead ends: 522 [2022-04-27 11:15:34,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:15:34,568 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 35 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:34,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 55 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:15:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-04-27 11:15:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 390. [2022-04-27 11:15:35,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:35,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 522 states. Second operand has 390 states, 385 states have (on average 1.4805194805194806) internal successors, (570), 385 states have internal predecessors, (570), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:35,065 INFO L74 IsIncluded]: Start isIncluded. First operand 522 states. Second operand has 390 states, 385 states have (on average 1.4805194805194806) internal successors, (570), 385 states have internal predecessors, (570), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:35,066 INFO L87 Difference]: Start difference. First operand 522 states. Second operand has 390 states, 385 states have (on average 1.4805194805194806) internal successors, (570), 385 states have internal predecessors, (570), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:35,074 INFO L93 Difference]: Finished difference Result 522 states and 754 transitions. [2022-04-27 11:15:35,074 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 754 transitions. [2022-04-27 11:15:35,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:35,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:35,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 390 states, 385 states have (on average 1.4805194805194806) internal successors, (570), 385 states have internal predecessors, (570), 3 states have call successors, (3), 3 states 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-27 11:15:35,075 INFO L87 Difference]: Start difference. First operand has 390 states, 385 states have (on average 1.4805194805194806) internal successors, (570), 385 states have internal predecessors, (570), 3 states have call successors, (3), 3 states 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-27 11:15:35,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:35,084 INFO L93 Difference]: Finished difference Result 522 states and 754 transitions. [2022-04-27 11:15:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 754 transitions. [2022-04-27 11:15:35,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:35,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:35,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:35,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.4805194805194806) internal successors, (570), 385 states have internal predecessors, (570), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 574 transitions. [2022-04-27 11:15:35,090 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 574 transitions. Word has length 31 [2022-04-27 11:15:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:35,091 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 574 transitions. [2022-04-27 11:15:35,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 574 transitions. [2022-04-27 11:15:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 11:15:35,091 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:35,091 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, 1, 1, 1] [2022-04-27 11:15:35,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 11:15:35,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:35,307 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:35,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:35,308 INFO L85 PathProgramCache]: Analyzing trace with hash -379865510, now seen corresponding path program 6 times [2022-04-27 11:15:35,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:35,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811099743] [2022-04-27 11:15:35,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:35,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:35,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:35,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {23089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23077#true} is VALID [2022-04-27 11:15:35,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {23077#true} assume true; {23077#true} is VALID [2022-04-27 11:15:35,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23077#true} {23077#true} #94#return; {23077#true} is VALID [2022-04-27 11:15:35,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {23077#true} call ULTIMATE.init(); {23089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:35,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {23089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23077#true} is VALID [2022-04-27 11:15:35,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {23077#true} assume true; {23077#true} is VALID [2022-04-27 11:15:35,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23077#true} {23077#true} #94#return; {23077#true} is VALID [2022-04-27 11:15:35,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {23077#true} call #t~ret17 := main(); {23077#true} is VALID [2022-04-27 11:15:35,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {23077#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23077#true} is VALID [2022-04-27 11:15:35,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {23077#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23082#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:35,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {23082#(<= 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; {23083#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-27 11:15:35,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {23083#(<= 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; {23084#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:15:35,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {23084#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {23084#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:15:35,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {23084#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {23084#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:15:35,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {23084#(<= (* 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; {23085#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:15:35,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {23085#(<= (+ (* (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; {23086#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:15:35,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {23086#(<= (+ 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; {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:35,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:35,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {23087#(<= (+ 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; {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:35,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {23087#(<= (+ 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; {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:35,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {23087#(<= (+ 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; {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:35,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:35,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23088#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:35,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {23088#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {23078#false} is VALID [2022-04-27 11:15:35,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {23078#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; {23078#false} is VALID [2022-04-27 11:15:35,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {23078#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; {23078#false} is VALID [2022-04-27 11:15:35,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {23078#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; {23078#false} is VALID [2022-04-27 11:15:35,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {23078#false} assume !(~z~0 % 4294967296 > 0); {23078#false} is VALID [2022-04-27 11:15:35,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {23078#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {23078#false} is VALID [2022-04-27 11:15:35,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {23078#false} assume !(~y~0 % 4294967296 > 0); {23078#false} is VALID [2022-04-27 11:15:35,421 INFO L272 TraceCheckUtils]: 27: Hoare triple {23078#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23078#false} is VALID [2022-04-27 11:15:35,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {23078#false} ~cond := #in~cond; {23078#false} is VALID [2022-04-27 11:15:35,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {23078#false} assume 0 == ~cond; {23078#false} is VALID [2022-04-27 11:15:35,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {23078#false} assume !false; {23078#false} is VALID [2022-04-27 11:15:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 11:15:35,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:35,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811099743] [2022-04-27 11:15:35,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811099743] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:35,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872980302] [2022-04-27 11:15:35,421 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:15:35,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:35,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:35,422 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:15:35,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 11:15:35,466 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-27 11:15:35,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:35,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 11:15:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:35,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:35,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {23077#true} call ULTIMATE.init(); {23077#true} is VALID [2022-04-27 11:15:35,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {23077#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23077#true} is VALID [2022-04-27 11:15:35,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {23077#true} assume true; {23077#true} is VALID [2022-04-27 11:15:35,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23077#true} {23077#true} #94#return; {23077#true} is VALID [2022-04-27 11:15:35,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {23077#true} call #t~ret17 := main(); {23077#true} is VALID [2022-04-27 11:15:35,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {23077#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23077#true} is VALID [2022-04-27 11:15:35,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {23077#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23077#true} is VALID [2022-04-27 11:15:35,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {23077#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23082#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:35,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {23082#(<= 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; {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:35,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:35,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:35,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {23117#(<= 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; {23082#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:35,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {23082#(<= 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; {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {23078#false} is VALID [2022-04-27 11:15:35,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {23078#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; {23078#false} is VALID [2022-04-27 11:15:35,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {23078#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; {23078#false} is VALID [2022-04-27 11:15:35,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {23078#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; {23078#false} is VALID [2022-04-27 11:15:35,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {23078#false} assume !(~z~0 % 4294967296 > 0); {23078#false} is VALID [2022-04-27 11:15:35,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {23078#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {23078#false} is VALID [2022-04-27 11:15:35,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {23078#false} assume !(~y~0 % 4294967296 > 0); {23078#false} is VALID [2022-04-27 11:15:35,701 INFO L272 TraceCheckUtils]: 27: Hoare triple {23078#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23078#false} is VALID [2022-04-27 11:15:35,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {23078#false} ~cond := #in~cond; {23078#false} is VALID [2022-04-27 11:15:35,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {23078#false} assume 0 == ~cond; {23078#false} is VALID [2022-04-27 11:15:35,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {23078#false} assume !false; {23078#false} is VALID [2022-04-27 11:15:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 11:15:35,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:35,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {23078#false} assume !false; {23078#false} is VALID [2022-04-27 11:15:35,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {23078#false} assume 0 == ~cond; {23078#false} is VALID [2022-04-27 11:15:35,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {23078#false} ~cond := #in~cond; {23078#false} is VALID [2022-04-27 11:15:35,798 INFO L272 TraceCheckUtils]: 27: Hoare triple {23078#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23078#false} is VALID [2022-04-27 11:15:35,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {23078#false} assume !(~y~0 % 4294967296 > 0); {23078#false} is VALID [2022-04-27 11:15:35,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {23078#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {23078#false} is VALID [2022-04-27 11:15:35,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {23078#false} assume !(~z~0 % 4294967296 > 0); {23078#false} is VALID [2022-04-27 11:15:35,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {23078#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; {23078#false} is VALID [2022-04-27 11:15:35,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {23078#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; {23078#false} is VALID [2022-04-27 11:15:35,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {23078#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; {23078#false} is VALID [2022-04-27 11:15:35,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {23078#false} is VALID [2022-04-27 11:15:35,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {23082#(<= 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; {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:35,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {23117#(<= 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; {23082#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:35,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:35,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:35,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {23082#(<= 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; {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:35,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {23077#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23082#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:35,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {23077#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23077#true} is VALID [2022-04-27 11:15:35,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {23077#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23077#true} is VALID [2022-04-27 11:15:35,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {23077#true} call #t~ret17 := main(); {23077#true} is VALID [2022-04-27 11:15:35,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23077#true} {23077#true} #94#return; {23077#true} is VALID [2022-04-27 11:15:35,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {23077#true} assume true; {23077#true} is VALID [2022-04-27 11:15:35,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {23077#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23077#true} is VALID [2022-04-27 11:15:35,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {23077#true} call ULTIMATE.init(); {23077#true} is VALID [2022-04-27 11:15:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 11:15:35,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872980302] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:35,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:35,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 13 [2022-04-27 11:15:35,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908631629] [2022-04-27 11:15:35,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:35,808 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 11:15:35,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:35,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:35,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:35,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:15:35,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:35,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:15:35,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:15:35,842 INFO L87 Difference]: Start difference. First operand 390 states and 574 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:37,136 INFO L93 Difference]: Finished difference Result 640 states and 921 transitions. [2022-04-27 11:15:37,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 11:15:37,136 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 11:15:37,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:37,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 94 transitions. [2022-04-27 11:15:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 94 transitions. [2022-04-27 11:15:37,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 94 transitions. [2022-04-27 11:15:37,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:37,250 INFO L225 Difference]: With dead ends: 640 [2022-04-27 11:15:37,250 INFO L226 Difference]: Without dead ends: 611 [2022-04-27 11:15:37,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:15:37,251 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 104 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:37,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 71 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:15:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-04-27 11:15:37,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 412. [2022-04-27 11:15:37,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:37,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 611 states. Second operand has 412 states, 407 states have (on average 1.452088452088452) internal successors, (591), 407 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:37,774 INFO L74 IsIncluded]: Start isIncluded. First operand 611 states. Second operand has 412 states, 407 states have (on average 1.452088452088452) internal successors, (591), 407 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:37,774 INFO L87 Difference]: Start difference. First operand 611 states. Second operand has 412 states, 407 states have (on average 1.452088452088452) internal successors, (591), 407 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:37,787 INFO L93 Difference]: Finished difference Result 611 states and 874 transitions. [2022-04-27 11:15:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 874 transitions. [2022-04-27 11:15:37,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:37,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:37,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 412 states, 407 states have (on average 1.452088452088452) internal successors, (591), 407 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 611 states. [2022-04-27 11:15:37,789 INFO L87 Difference]: Start difference. First operand has 412 states, 407 states have (on average 1.452088452088452) internal successors, (591), 407 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 611 states. [2022-04-27 11:15:37,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:37,799 INFO L93 Difference]: Finished difference Result 611 states and 874 transitions. [2022-04-27 11:15:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 874 transitions. [2022-04-27 11:15:37,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:37,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:37,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:37,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 407 states have (on average 1.452088452088452) internal successors, (591), 407 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 595 transitions. [2022-04-27 11:15:37,806 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 595 transitions. Word has length 31 [2022-04-27 11:15:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:37,807 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 595 transitions. [2022-04-27 11:15:37,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 595 transitions. [2022-04-27 11:15:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:15:37,807 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:37,807 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:37,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 11:15:38,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 11:15:38,024 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:38,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:38,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1500175867, now seen corresponding path program 5 times [2022-04-27 11:15:38,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:38,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329396143] [2022-04-27 11:15:38,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:38,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:38,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:38,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {25786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25768#true} is VALID [2022-04-27 11:15:38,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {25768#true} assume true; {25768#true} is VALID [2022-04-27 11:15:38,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25768#true} {25768#true} #94#return; {25768#true} is VALID [2022-04-27 11:15:38,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {25768#true} call ULTIMATE.init(); {25786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:38,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {25786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25768#true} is VALID [2022-04-27 11:15:38,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {25768#true} assume true; {25768#true} is VALID [2022-04-27 11:15:38,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25768#true} {25768#true} #94#return; {25768#true} is VALID [2022-04-27 11:15:38,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {25768#true} call #t~ret17 := main(); {25768#true} is VALID [2022-04-27 11:15:38,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {25768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25773#(= main_~y~0 0)} is VALID [2022-04-27 11:15:38,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {25773#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:38,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {25774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25775#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:38,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {25775#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25776#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:38,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {25776#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25777#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:38,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {25777#(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; {25778#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:15:38,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {25778#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {25778#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:15:38,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {25778#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {25779#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:15:38,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {25779#(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; {25780#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:15:38,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {25780#(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; {25781#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:38,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {25781#(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; {25782#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:38,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {25782#(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; {25783#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:38,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {25783#(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; {25784#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:38,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {25784#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {25784#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:38,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {25784#(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; {25783#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:38,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {25783#(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; {25782#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:38,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {25782#(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; {25781#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:38,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {25781#(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; {25780#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:15:38,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {25780#(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; {25785#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:15:38,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {25785#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {25785#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:15:38,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {25785#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {25785#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:15:38,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {25785#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {25769#false} is VALID [2022-04-27 11:15:38,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {25769#false} assume !(~y~0 % 4294967296 > 0); {25769#false} is VALID [2022-04-27 11:15:38,265 INFO L272 TraceCheckUtils]: 28: Hoare triple {25769#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25769#false} is VALID [2022-04-27 11:15:38,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {25769#false} ~cond := #in~cond; {25769#false} is VALID [2022-04-27 11:15:38,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {25769#false} assume 0 == ~cond; {25769#false} is VALID [2022-04-27 11:15:38,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {25769#false} assume !false; {25769#false} is VALID [2022-04-27 11:15:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:38,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:38,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329396143] [2022-04-27 11:15:38,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329396143] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:38,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63501676] [2022-04-27 11:15:38,266 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:15:38,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:38,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:38,267 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:15:38,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 11:15:38,469 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 11:15:38,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:38,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 11:15:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:38,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:38,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {25768#true} call ULTIMATE.init(); {25768#true} is VALID [2022-04-27 11:15:38,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {25768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25768#true} is VALID [2022-04-27 11:15:38,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {25768#true} assume true; {25768#true} is VALID [2022-04-27 11:15:38,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25768#true} {25768#true} #94#return; {25768#true} is VALID [2022-04-27 11:15:38,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {25768#true} call #t~ret17 := main(); {25768#true} is VALID [2022-04-27 11:15:38,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {25768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25768#true} is VALID [2022-04-27 11:15:38,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {25768#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25808#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:38,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {25808#(< 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; {25812#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:38,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {25812#(< 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; {25816#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:38,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {25816#(< 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; {25820#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:38,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {25820#(< 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; {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:15:38,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:15:38,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:15:38,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {25824#(< 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; {25820#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:38,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {25820#(< 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; {25816#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:38,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {25816#(< 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; {25812#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:38,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {25812#(< 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; {25808#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:38,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {25808#(< 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; {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {25846#(< 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; {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {25846#(< 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; {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {25846#(< 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; {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {25846#(< 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; {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {25846#(< 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; {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {25769#false} is VALID [2022-04-27 11:15:38,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {25769#false} assume !(~z~0 % 4294967296 > 0); {25769#false} is VALID [2022-04-27 11:15:38,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {25769#false} assume !(~y~0 % 4294967296 > 0); {25769#false} is VALID [2022-04-27 11:15:38,660 INFO L272 TraceCheckUtils]: 28: Hoare triple {25769#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25769#false} is VALID [2022-04-27 11:15:38,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {25769#false} ~cond := #in~cond; {25769#false} is VALID [2022-04-27 11:15:38,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {25769#false} assume 0 == ~cond; {25769#false} is VALID [2022-04-27 11:15:38,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {25769#false} assume !false; {25769#false} is VALID [2022-04-27 11:15:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:15:38,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:38,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {25769#false} assume !false; {25769#false} is VALID [2022-04-27 11:15:38,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {25769#false} assume 0 == ~cond; {25769#false} is VALID [2022-04-27 11:15:38,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {25769#false} ~cond := #in~cond; {25769#false} is VALID [2022-04-27 11:15:38,754 INFO L272 TraceCheckUtils]: 28: Hoare triple {25769#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25769#false} is VALID [2022-04-27 11:15:38,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {25769#false} assume !(~y~0 % 4294967296 > 0); {25769#false} is VALID [2022-04-27 11:15:38,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {25769#false} assume !(~z~0 % 4294967296 > 0); {25769#false} is VALID [2022-04-27 11:15:38,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {25769#false} is VALID [2022-04-27 11:15:38,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {25846#(< 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; {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {25846#(< 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; {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {25846#(< 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; {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {25846#(< 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; {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {25846#(< 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; {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {25808#(< 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; {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:38,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {25812#(< 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; {25808#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:38,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {25816#(< 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; {25812#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:38,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {25820#(< 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; {25816#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:38,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {25824#(< 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; {25820#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:38,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:15:38,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:15:38,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {25820#(< 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; {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:15:38,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {25816#(< 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; {25820#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:38,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {25812#(< 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; {25816#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:38,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {25808#(< 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; {25812#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:38,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {25768#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25808#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:38,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {25768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25768#true} is VALID [2022-04-27 11:15:38,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {25768#true} call #t~ret17 := main(); {25768#true} is VALID [2022-04-27 11:15:38,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25768#true} {25768#true} #94#return; {25768#true} is VALID [2022-04-27 11:15:38,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {25768#true} assume true; {25768#true} is VALID [2022-04-27 11:15:38,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {25768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25768#true} is VALID [2022-04-27 11:15:38,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {25768#true} call ULTIMATE.init(); {25768#true} is VALID [2022-04-27 11:15:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:15:38,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63501676] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:38,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:38,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-27 11:15:38,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975607230] [2022-04-27 11:15:38,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:38,764 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:15:38,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:38,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:38,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:38,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 11:15:38,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:38,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 11:15:38,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:15:38,799 INFO L87 Difference]: Start difference. First operand 412 states and 595 transitions. Second operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:58,240 INFO L93 Difference]: Finished difference Result 1100 states and 1569 transitions. [2022-04-27 11:15:58,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2022-04-27 11:15:58,241 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:15:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 429 transitions. [2022-04-27 11:15:58,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 429 transitions. [2022-04-27 11:15:58,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 429 transitions. [2022-04-27 11:15:58,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:58,950 INFO L225 Difference]: With dead ends: 1100 [2022-04-27 11:15:58,950 INFO L226 Difference]: Without dead ends: 1025 [2022-04-27 11:15:58,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11145 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2268, Invalid=27144, Unknown=0, NotChecked=0, Total=29412 [2022-04-27 11:15:58,953 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 390 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 661 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 661 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:58,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 129 Invalid, 3040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [661 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-27 11:15:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2022-04-27 11:15:59,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 487. [2022-04-27 11:15:59,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:59,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1025 states. Second operand has 487 states, 482 states have (on average 1.4481327800829875) internal successors, (698), 482 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:59,536 INFO L74 IsIncluded]: Start isIncluded. First operand 1025 states. Second operand has 487 states, 482 states have (on average 1.4481327800829875) internal successors, (698), 482 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:59,536 INFO L87 Difference]: Start difference. First operand 1025 states. Second operand has 487 states, 482 states have (on average 1.4481327800829875) internal successors, (698), 482 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:59,585 INFO L93 Difference]: Finished difference Result 1025 states and 1369 transitions. [2022-04-27 11:15:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1369 transitions. [2022-04-27 11:15:59,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:59,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:59,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 487 states, 482 states have (on average 1.4481327800829875) internal successors, (698), 482 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1025 states. [2022-04-27 11:15:59,588 INFO L87 Difference]: Start difference. First operand has 487 states, 482 states have (on average 1.4481327800829875) internal successors, (698), 482 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1025 states. [2022-04-27 11:15:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:59,616 INFO L93 Difference]: Finished difference Result 1025 states and 1369 transitions. [2022-04-27 11:15:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1369 transitions. [2022-04-27 11:15:59,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:59,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:59,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:59,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 482 states have (on average 1.4481327800829875) internal successors, (698), 482 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 702 transitions. [2022-04-27 11:15:59,625 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 702 transitions. Word has length 32 [2022-04-27 11:15:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:59,626 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 702 transitions. [2022-04-27 11:15:59,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:59,626 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 702 transitions. [2022-04-27 11:15:59,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 11:15:59,626 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:59,626 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:59,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-27 11:15:59,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 11:15:59,831 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:59,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:59,831 INFO L85 PathProgramCache]: Analyzing trace with hash 289220232, now seen corresponding path program 3 times [2022-04-27 11:15:59,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:59,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947480066] [2022-04-27 11:15:59,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:59,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:00,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:16:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:00,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {30187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30167#true} is VALID [2022-04-27 11:16:00,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {30167#true} assume true; {30167#true} is VALID [2022-04-27 11:16:00,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30167#true} {30167#true} #94#return; {30167#true} is VALID [2022-04-27 11:16:00,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {30167#true} call ULTIMATE.init(); {30187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:16:00,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {30187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30167#true} is VALID [2022-04-27 11:16:00,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {30167#true} assume true; {30167#true} is VALID [2022-04-27 11:16:00,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30167#true} {30167#true} #94#return; {30167#true} is VALID [2022-04-27 11:16:00,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {30167#true} call #t~ret17 := main(); {30167#true} is VALID [2022-04-27 11:16:00,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {30167#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30172#(= main_~y~0 0)} is VALID [2022-04-27 11:16:00,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {30172#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30173#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:00,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {30173#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30174#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:00,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {30174#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30175#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:00,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {30175#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30176#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:00,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {30176#(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; {30177#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:16:00,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {30177#(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; {30178#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:00,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {30178#(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; {30179#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:16:00,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {30179#(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; {30180#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:16:00,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {30180#(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; {30181#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:16:00,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {30181#(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; {30182#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:16:00,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {30182#(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; {30183#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:16:00,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {30183#(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; {30184#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:16:00,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {30184#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {30184#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:16:00,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {30184#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {30185#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:16:00,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {30185#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30186#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-27 11:16:00,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {30186#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {30168#false} is VALID [2022-04-27 11:16:00,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {30168#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30168#false} is VALID [2022-04-27 11:16:00,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {30168#false} assume !(~y~0 % 4294967296 > 0); {30168#false} is VALID [2022-04-27 11:16:00,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {30168#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; {30168#false} is VALID [2022-04-27 11:16:00,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {30168#false} assume !(~x~0 % 4294967296 > 0); {30168#false} is VALID [2022-04-27 11:16:00,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {30168#false} assume !(~z~0 % 4294967296 > 0); {30168#false} is VALID [2022-04-27 11:16:00,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {30168#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {30168#false} is VALID [2022-04-27 11:16:00,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {30168#false} assume !(~y~0 % 4294967296 > 0); {30168#false} is VALID [2022-04-27 11:16:00,062 INFO L272 TraceCheckUtils]: 29: Hoare triple {30168#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30168#false} is VALID [2022-04-27 11:16:00,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {30168#false} ~cond := #in~cond; {30168#false} is VALID [2022-04-27 11:16:00,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {30168#false} assume 0 == ~cond; {30168#false} is VALID [2022-04-27 11:16:00,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {30168#false} assume !false; {30168#false} is VALID [2022-04-27 11:16:00,063 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:16:00,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:16:00,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947480066] [2022-04-27 11:16:00,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947480066] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:16:00,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889232635] [2022-04-27 11:16:00,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:16:00,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:00,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:16:00,068 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:16:00,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 11:16:00,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 11:16:00,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:16:00,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:16:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:00,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:16:00,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {30167#true} call ULTIMATE.init(); {30167#true} is VALID [2022-04-27 11:16:00,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {30167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30167#true} is VALID [2022-04-27 11:16:00,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {30167#true} assume true; {30167#true} is VALID [2022-04-27 11:16:00,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30167#true} {30167#true} #94#return; {30167#true} is VALID [2022-04-27 11:16:00,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {30167#true} call #t~ret17 := main(); {30167#true} is VALID [2022-04-27 11:16:00,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {30167#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30167#true} is VALID [2022-04-27 11:16:00,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {30167#true} assume !(~x~0 % 4294967296 > 0); {30167#true} is VALID [2022-04-27 11:16:00,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {30167#true} ~z~0 := ~y~0; {30248#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:16:00,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {30248#(= 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; {30252#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:16:00,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {30252#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {30252#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:16:00,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {30252#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30259#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-27 11:16:00,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {30259#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} assume !(~y~0 % 4294967296 > 0); {30259#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-27 11:16:00,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {30259#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~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; {30266#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:00,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {30266#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {30266#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:00,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {30266#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {30168#false} is VALID [2022-04-27 11:16:00,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {30168#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {30168#false} is VALID [2022-04-27 11:16:00,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {30168#false} assume !(~y~0 % 4294967296 > 0); {30168#false} is VALID [2022-04-27 11:16:00,254 INFO L272 TraceCheckUtils]: 29: Hoare triple {30168#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30168#false} is VALID [2022-04-27 11:16:00,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {30168#false} ~cond := #in~cond; {30168#false} is VALID [2022-04-27 11:16:00,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {30168#false} assume 0 == ~cond; {30168#false} is VALID [2022-04-27 11:16:00,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {30168#false} assume !false; {30168#false} is VALID [2022-04-27 11:16:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-27 11:16:00,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:16:00,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {30168#false} assume !false; {30168#false} is VALID [2022-04-27 11:16:00,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {30168#false} assume 0 == ~cond; {30168#false} is VALID [2022-04-27 11:16:00,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {30168#false} ~cond := #in~cond; {30168#false} is VALID [2022-04-27 11:16:00,341 INFO L272 TraceCheckUtils]: 29: Hoare triple {30168#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30168#false} is VALID [2022-04-27 11:16:00,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {30168#false} assume !(~y~0 % 4294967296 > 0); {30168#false} is VALID [2022-04-27 11:16:00,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {30168#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {30168#false} is VALID [2022-04-27 11:16:00,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {30266#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {30168#false} is VALID [2022-04-27 11:16:00,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {30266#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {30266#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:00,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {30266#(< 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; {30266#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:00,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {30266#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {30266#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:00,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {30321#(< 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; {30266#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:00,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {30321#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {30321#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-27 11:16:00,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {30167#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30321#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-27 11:16:00,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {30167#true} ~z~0 := ~y~0; {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {30167#true} assume !(~x~0 % 4294967296 > 0); {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {30167#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {30167#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {30167#true} call #t~ret17 := main(); {30167#true} is VALID [2022-04-27 11:16:00,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30167#true} {30167#true} #94#return; {30167#true} is VALID [2022-04-27 11:16:00,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {30167#true} assume true; {30167#true} is VALID [2022-04-27 11:16:00,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {30167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30167#true} is VALID [2022-04-27 11:16:00,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {30167#true} call ULTIMATE.init(); {30167#true} is VALID [2022-04-27 11:16:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-04-27 11:16:00,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889232635] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:16:00,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:16:00,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 4] total 23 [2022-04-27 11:16:00,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082566401] [2022-04-27 11:16:00,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:16:00,346 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 11:16:00,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:16:00,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:00,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:00,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 11:16:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:16:00,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 11:16:00,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2022-04-27 11:16:00,380 INFO L87 Difference]: Start difference. First operand 487 states and 702 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:07,954 INFO L93 Difference]: Finished difference Result 840 states and 1237 transitions. [2022-04-27 11:16:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-04-27 11:16:07,954 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 11:16:07,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:16:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 344 transitions. [2022-04-27 11:16:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:07,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 344 transitions. [2022-04-27 11:16:07,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 344 transitions. [2022-04-27 11:16:08,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 344 edges. 344 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:08,265 INFO L225 Difference]: With dead ends: 840 [2022-04-27 11:16:08,265 INFO L226 Difference]: Without dead ends: 776 [2022-04-27 11:16:08,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2789 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=737, Invalid=8965, Unknown=0, NotChecked=0, Total=9702 [2022-04-27 11:16:08,266 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 198 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3479 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 3826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 3479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:16:08,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 140 Invalid, 3826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 3479 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-27 11:16:08,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-04-27 11:16:08,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 591. [2022-04-27 11:16:08,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:16:08,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 776 states. Second operand has 591 states, 586 states have (on average 1.4215017064846416) internal successors, (833), 586 states have internal predecessors, (833), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:08,961 INFO L74 IsIncluded]: Start isIncluded. First operand 776 states. Second operand has 591 states, 586 states have (on average 1.4215017064846416) internal successors, (833), 586 states have internal predecessors, (833), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:08,961 INFO L87 Difference]: Start difference. First operand 776 states. Second operand has 591 states, 586 states have (on average 1.4215017064846416) internal successors, (833), 586 states have internal predecessors, (833), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:08,978 INFO L93 Difference]: Finished difference Result 776 states and 1068 transitions. [2022-04-27 11:16:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1068 transitions. [2022-04-27 11:16:08,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:08,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:08,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 591 states, 586 states have (on average 1.4215017064846416) internal successors, (833), 586 states have internal predecessors, (833), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 776 states. [2022-04-27 11:16:08,979 INFO L87 Difference]: Start difference. First operand has 591 states, 586 states have (on average 1.4215017064846416) internal successors, (833), 586 states have internal predecessors, (833), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 776 states. [2022-04-27 11:16:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:08,999 INFO L93 Difference]: Finished difference Result 776 states and 1068 transitions. [2022-04-27 11:16:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1068 transitions. [2022-04-27 11:16:08,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:08,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:08,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:16:08,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:16:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 586 states have (on average 1.4215017064846416) internal successors, (833), 586 states have internal predecessors, (833), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 837 transitions. [2022-04-27 11:16:09,011 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 837 transitions. Word has length 33 [2022-04-27 11:16:09,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:16:09,012 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 837 transitions. [2022-04-27 11:16:09,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 837 transitions. [2022-04-27 11:16:09,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:16:09,012 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:16:09,012 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:16:09,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 11:16:09,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:09,223 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:16:09,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:16:09,224 INFO L85 PathProgramCache]: Analyzing trace with hash 289270042, now seen corresponding path program 7 times [2022-04-27 11:16:09,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:16:09,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70198450] [2022-04-27 11:16:09,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:16:09,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:16:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:09,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:16:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:09,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {33783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33765#true} is VALID [2022-04-27 11:16:09,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {33765#true} assume true; {33765#true} is VALID [2022-04-27 11:16:09,613 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33765#true} {33765#true} #94#return; {33765#true} is VALID [2022-04-27 11:16:09,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {33765#true} call ULTIMATE.init(); {33783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:16:09,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {33783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33765#true} is VALID [2022-04-27 11:16:09,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {33765#true} assume true; {33765#true} is VALID [2022-04-27 11:16:09,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33765#true} {33765#true} #94#return; {33765#true} is VALID [2022-04-27 11:16:09,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {33765#true} call #t~ret17 := main(); {33765#true} is VALID [2022-04-27 11:16:09,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {33765#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33770#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:16:09,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {33770#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33771#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:09,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {33771#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33772#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:16:09,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {33772#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 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; {33773#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-27 11:16:09,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {33773#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {33774#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-27 11:16:09,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {33774#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} ~z~0 := ~y~0; {33775#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-27 11:16:09,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {33775#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 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; {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:16:09,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 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; {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-27 11:16:09,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= 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; {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:09,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:09,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~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; {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-27 11:16:09,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:16:09,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 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; {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:09,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:09,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~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; {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:09,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~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; {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:09,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~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; {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:09,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:09,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 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; {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:16:09,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 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; {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-27 11:16:09,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~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; {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:09,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:09,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-27 11:16:09,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:16:09,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {33780#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:09,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {33780#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {33780#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:09,637 INFO L272 TraceCheckUtils]: 31: Hoare triple {33780#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:16:09,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {33781#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33782#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:16:09,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {33782#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33766#false} is VALID [2022-04-27 11:16:09,638 INFO L290 TraceCheckUtils]: 34: Hoare triple {33766#false} assume !false; {33766#false} is VALID [2022-04-27 11:16:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:16:09,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:16:09,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70198450] [2022-04-27 11:16:09,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70198450] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:16:09,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545700861] [2022-04-27 11:16:09,639 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:16:09,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:09,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:16:09,640 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:16:09,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-27 11:16:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:09,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-27 11:16:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:09,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:16:14,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {33765#true} call ULTIMATE.init(); {33765#true} is VALID [2022-04-27 11:16:14,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {33765#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33765#true} is VALID [2022-04-27 11:16:14,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {33765#true} assume true; {33765#true} is VALID [2022-04-27 11:16:14,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33765#true} {33765#true} #94#return; {33765#true} is VALID [2022-04-27 11:16:14,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {33765#true} call #t~ret17 := main(); {33765#true} is VALID [2022-04-27 11:16:14,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {33765#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33770#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:16:14,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {33770#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33771#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:14,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {33771#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33808#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:16:14,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {33808#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 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; {33812#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:14,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {33812#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {33816#(and (<= main_~y~0 3) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3)) 4294967296)))} is VALID [2022-04-27 11:16:14,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {33816#(and (<= main_~y~0 3) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3)) 4294967296)))} ~z~0 := ~y~0; {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:14,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~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; {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:16:14,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 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; {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-27 11:16:14,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= 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; {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:14,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:14,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~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; {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-27 11:16:14,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:16:14,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 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; {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:14,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:14,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~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; {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:14,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~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; {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:14,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~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; {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:14,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:14,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 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; {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:16:14,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 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; {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-27 11:16:14,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~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; {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:14,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:14,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-27 11:16:14,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:16:14,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:14,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:16:14,059 INFO L272 TraceCheckUtils]: 31: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33883#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:16:14,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {33883#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33887#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:16:14,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {33887#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33766#false} is VALID [2022-04-27 11:16:14,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {33766#false} assume !false; {33766#false} is VALID [2022-04-27 11:16:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:16:14,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:16:14,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {33766#false} assume !false; {33766#false} is VALID [2022-04-27 11:16:14,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {33887#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33766#false} is VALID [2022-04-27 11:16:14,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {33883#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33887#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:16:14,890 INFO L272 TraceCheckUtils]: 31: Hoare triple {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33883#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:16:14,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:14,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:14,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {33914#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:16:14,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {33918#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {33914#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-27 11:16:14,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {33918#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} assume !(~z~0 % 4294967296 > 0); {33918#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-27 11:16:14,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {33914#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 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; {33918#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-27 11:16:14,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 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; {33914#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-27 11:16:14,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 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; {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:16:14,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:14,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {33903#(= (mod main_~n~0 4294967296) (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; {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:14,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {33903#(= (mod main_~n~0 4294967296) (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; {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:14,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {33903#(= (mod main_~n~0 4294967296) (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; {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:14,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:14,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:14,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {33914#(= (mod main_~n~0 4294967296) (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; {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:16:14,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {33918#(= (mod main_~n~0 4294967296) (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; {33914#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-27 11:16:14,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {33918#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} assume !(~z~0 % 4294967296 > 0); {33918#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-27 11:16:14,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {33914#(= (mod main_~n~0 4294967296) (mod (+ main_~z~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; {33918#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-27 11:16:14,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33914#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-27 11:16:14,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:16:14,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {33970#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:14,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {33974#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {33970#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:16:14,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {33978#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (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; {33974#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:16:14,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {33982#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (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; {33978#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-27 11:16:14,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {33986#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33982#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-27 11:16:14,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {33765#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33986#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:16:14,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {33765#true} call #t~ret17 := main(); {33765#true} is VALID [2022-04-27 11:16:14,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33765#true} {33765#true} #94#return; {33765#true} is VALID [2022-04-27 11:16:14,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {33765#true} assume true; {33765#true} is VALID [2022-04-27 11:16:14,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {33765#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33765#true} is VALID [2022-04-27 11:16:14,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {33765#true} call ULTIMATE.init(); {33765#true} is VALID [2022-04-27 11:16:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:16:14,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545700861] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:16:14,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:16:14,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 30 [2022-04-27 11:16:14,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032540577] [2022-04-27 11:16:14,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:16:14,917 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:16:14,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:16:14,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.1) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:15,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:15,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 11:16:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:16:15,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 11:16:15,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2022-04-27 11:16:15,016 INFO L87 Difference]: Start difference. First operand 591 states and 837 transitions. Second operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:21,807 INFO L93 Difference]: Finished difference Result 760 states and 1026 transitions. [2022-04-27 11:16:21,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-27 11:16:21,808 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:16:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:16:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 101 transitions. [2022-04-27 11:16:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 101 transitions. [2022-04-27 11:16:21,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 101 transitions. [2022-04-27 11:16:22,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:22,411 INFO L225 Difference]: With dead ends: 760 [2022-04-27 11:16:22,411 INFO L226 Difference]: Without dead ends: 747 [2022-04-27 11:16:22,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=571, Invalid=4685, Unknown=0, NotChecked=0, Total=5256 [2022-04-27 11:16:22,412 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 94 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:16:22,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 97 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-27 11:16:22,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-04-27 11:16:23,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 601. [2022-04-27 11:16:23,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:16:23,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 747 states. Second operand has 601 states, 596 states have (on average 1.4144295302013423) internal successors, (843), 596 states have internal predecessors, (843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:23,148 INFO L74 IsIncluded]: Start isIncluded. First operand 747 states. Second operand has 601 states, 596 states have (on average 1.4144295302013423) internal successors, (843), 596 states have internal predecessors, (843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:23,149 INFO L87 Difference]: Start difference. First operand 747 states. Second operand has 601 states, 596 states have (on average 1.4144295302013423) internal successors, (843), 596 states have internal predecessors, (843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:23,162 INFO L93 Difference]: Finished difference Result 747 states and 1012 transitions. [2022-04-27 11:16:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1012 transitions. [2022-04-27 11:16:23,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:23,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:23,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 596 states have (on average 1.4144295302013423) internal successors, (843), 596 states have internal predecessors, (843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 747 states. [2022-04-27 11:16:23,164 INFO L87 Difference]: Start difference. First operand has 601 states, 596 states have (on average 1.4144295302013423) internal successors, (843), 596 states have internal predecessors, (843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 747 states. [2022-04-27 11:16:23,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:23,178 INFO L93 Difference]: Finished difference Result 747 states and 1012 transitions. [2022-04-27 11:16:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1012 transitions. [2022-04-27 11:16:23,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:23,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:23,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:16:23,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:16:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 596 states have (on average 1.4144295302013423) internal successors, (843), 596 states have internal predecessors, (843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 847 transitions. [2022-04-27 11:16:23,191 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 847 transitions. Word has length 35 [2022-04-27 11:16:23,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:16:23,191 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 847 transitions. [2022-04-27 11:16:23,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 847 transitions. [2022-04-27 11:16:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:16:23,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:16:23,192 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:16:23,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-27 11:16:23,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:23,408 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:16:23,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:16:23,409 INFO L85 PathProgramCache]: Analyzing trace with hash -53610471, now seen corresponding path program 6 times [2022-04-27 11:16:23,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:16:23,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865608390] [2022-04-27 11:16:23,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:16:23,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:16:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:23,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:16:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:23,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {37192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37172#true} is VALID [2022-04-27 11:16:23,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {37172#true} assume true; {37172#true} is VALID [2022-04-27 11:16:23,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37172#true} {37172#true} #94#return; {37172#true} is VALID [2022-04-27 11:16:23,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {37172#true} call ULTIMATE.init(); {37192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:16:23,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {37192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37172#true} is VALID [2022-04-27 11:16:23,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {37172#true} assume true; {37172#true} is VALID [2022-04-27 11:16:23,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37172#true} {37172#true} #94#return; {37172#true} is VALID [2022-04-27 11:16:23,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {37172#true} call #t~ret17 := main(); {37172#true} is VALID [2022-04-27 11:16:23,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {37172#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37177#(= main_~y~0 0)} is VALID [2022-04-27 11:16:23,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {37177#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37178#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:23,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {37178#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37179#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:23,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {37179#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37180#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:23,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {37180#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37181#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:23,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {37181#(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; {37182#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:16:23,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {37182#(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; {37183#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:23,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {37183#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {37183#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:23,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {37183#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {37184#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:16:23,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {37184#(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; {37185#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:16:23,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {37185#(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; {37186#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:16:23,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {37186#(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; {37187#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:16:23,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {37187#(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; {37188#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:16:23,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {37188#(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; {37189#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:16:23,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {37189#(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; {37190#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:16:23,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {37190#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {37190#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:16:23,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {37190#(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; {37189#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:16:23,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {37189#(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; {37188#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:16:23,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {37188#(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; {37187#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:16:23,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {37187#(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; {37186#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:16:23,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {37186#(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; {37185#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:16:23,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {37185#(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; {37191#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-27 11:16:23,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {37191#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {37191#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-27 11:16:23,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {37191#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {37191#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-27 11:16:23,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {37191#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {37173#false} is VALID [2022-04-27 11:16:23,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {37173#false} assume !(~y~0 % 4294967296 > 0); {37173#false} is VALID [2022-04-27 11:16:23,672 INFO L272 TraceCheckUtils]: 31: Hoare triple {37173#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37173#false} is VALID [2022-04-27 11:16:23,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {37173#false} ~cond := #in~cond; {37173#false} is VALID [2022-04-27 11:16:23,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {37173#false} assume 0 == ~cond; {37173#false} is VALID [2022-04-27 11:16:23,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {37173#false} assume !false; {37173#false} is VALID [2022-04-27 11:16:23,673 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-27 11:16:23,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:16:23,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865608390] [2022-04-27 11:16:23,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865608390] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:16:23,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146821872] [2022-04-27 11:16:23,673 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:16:23,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:23,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:16:23,674 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:16:23,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-27 11:16:23,733 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-27 11:16:23,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:16:23,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 11:16:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:23,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:16:23,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {37172#true} call ULTIMATE.init(); {37172#true} is VALID [2022-04-27 11:16:23,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {37172#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37172#true} is VALID [2022-04-27 11:16:23,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {37172#true} assume true; {37172#true} is VALID [2022-04-27 11:16:23,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37172#true} {37172#true} #94#return; {37172#true} is VALID [2022-04-27 11:16:23,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {37172#true} call #t~ret17 := main(); {37172#true} is VALID [2022-04-27 11:16:23,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {37172#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37172#true} is VALID [2022-04-27 11:16:23,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {37172#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37214#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:16:23,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {37214#(< 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; {37218#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:16:23,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {37218#(< 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; {37222#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:16:23,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {37222#(< 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; {37226#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:16:23,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {37226#(< 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; {37230#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:16:23,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {37230#(< 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; {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:16:23,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:16:23,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:16:23,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {37234#(< 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; {37230#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:16:23,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {37230#(< 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; {37226#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:16:23,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {37226#(< 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; {37222#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:16:23,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {37222#(< 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; {37218#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:16:23,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {37218#(< 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; {37214#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:16:23,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {37214#(< 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; {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:23,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:23,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {37259#(< 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; {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:23,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {37259#(< 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; {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:23,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {37259#(< 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; {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:23,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {37259#(< 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; {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:23,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {37259#(< 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; {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:23,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {37259#(< 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; {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:23,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:23,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {37173#false} is VALID [2022-04-27 11:16:23,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {37173#false} assume !(~z~0 % 4294967296 > 0); {37173#false} is VALID [2022-04-27 11:16:23,996 INFO L290 TraceCheckUtils]: 30: Hoare triple {37173#false} assume !(~y~0 % 4294967296 > 0); {37173#false} is VALID [2022-04-27 11:16:23,996 INFO L272 TraceCheckUtils]: 31: Hoare triple {37173#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37173#false} is VALID [2022-04-27 11:16:23,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {37173#false} ~cond := #in~cond; {37173#false} is VALID [2022-04-27 11:16:23,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {37173#false} assume 0 == ~cond; {37173#false} is VALID [2022-04-27 11:16:23,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {37173#false} assume !false; {37173#false} is VALID [2022-04-27 11:16:23,997 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-27 11:16:23,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:16:24,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {37173#false} assume !false; {37173#false} is VALID [2022-04-27 11:16:24,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {37173#false} assume 0 == ~cond; {37173#false} is VALID [2022-04-27 11:16:24,145 INFO L290 TraceCheckUtils]: 32: Hoare triple {37173#false} ~cond := #in~cond; {37173#false} is VALID [2022-04-27 11:16:24,145 INFO L272 TraceCheckUtils]: 31: Hoare triple {37173#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37173#false} is VALID [2022-04-27 11:16:24,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {37173#false} assume !(~y~0 % 4294967296 > 0); {37173#false} is VALID [2022-04-27 11:16:24,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {37173#false} assume !(~z~0 % 4294967296 > 0); {37173#false} is VALID [2022-04-27 11:16:24,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {37173#false} is VALID [2022-04-27 11:16:24,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:24,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {37259#(< 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; {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:24,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {37259#(< 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; {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:24,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {37259#(< 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; {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:24,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {37259#(< 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; {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:24,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {37259#(< 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; {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:24,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {37259#(< 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; {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:24,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:24,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {37214#(< 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; {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:24,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {37218#(< 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; {37214#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:16:24,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {37222#(< 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; {37218#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:16:24,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {37226#(< 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; {37222#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:16:24,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {37230#(< 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; {37226#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:16:24,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {37234#(< 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; {37230#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:16:24,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:16:24,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:16:24,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {37230#(< 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; {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:16:24,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {37226#(< 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; {37230#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:16:24,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {37222#(< 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; {37226#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:16:24,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {37218#(< 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; {37222#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:16:24,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {37214#(< 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; {37218#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:16:24,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {37172#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37214#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:16:24,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {37172#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37172#true} is VALID [2022-04-27 11:16:24,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {37172#true} call #t~ret17 := main(); {37172#true} is VALID [2022-04-27 11:16:24,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37172#true} {37172#true} #94#return; {37172#true} is VALID [2022-04-27 11:16:24,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {37172#true} assume true; {37172#true} is VALID [2022-04-27 11:16:24,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {37172#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37172#true} is VALID [2022-04-27 11:16:24,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {37172#true} call ULTIMATE.init(); {37172#true} is VALID [2022-04-27 11:16:24,157 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-27 11:16:24,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146821872] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:16:24,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:16:24,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-27 11:16:24,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370044871] [2022-04-27 11:16:24,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:16:24,159 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:16:24,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:16:24,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:24,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:24,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 11:16:24,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:16:24,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 11:16:24,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:16:24,197 INFO L87 Difference]: Start difference. First operand 601 states and 847 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:12,701 INFO L93 Difference]: Finished difference Result 1623 states and 2244 transitions. [2022-04-27 11:17:12,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2022-04-27 11:17:12,702 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:17:12,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 636 transitions. [2022-04-27 11:17:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 636 transitions. [2022-04-27 11:17:12,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 636 transitions. [2022-04-27 11:17:14,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 636 edges. 636 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:14,289 INFO L225 Difference]: With dead ends: 1623 [2022-04-27 11:17:14,289 INFO L226 Difference]: Without dead ends: 1526 [2022-04-27 11:17:14,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32189 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=4568, Invalid=72994, Unknown=0, NotChecked=0, Total=77562 [2022-04-27 11:17:14,293 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 573 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 3722 mSolverCounterSat, 1104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 4826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1104 IncrementalHoareTripleChecker+Valid, 3722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:14,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 142 Invalid, 4826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1104 Valid, 3722 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2022-04-27 11:17:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2022-04-27 11:17:15,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 655. [2022-04-27 11:17:15,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:15,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1526 states. Second operand has 655 states, 650 states have (on average 1.4230769230769231) internal successors, (925), 650 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:15,118 INFO L74 IsIncluded]: Start isIncluded. First operand 1526 states. Second operand has 655 states, 650 states have (on average 1.4230769230769231) internal successors, (925), 650 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:15,118 INFO L87 Difference]: Start difference. First operand 1526 states. Second operand has 655 states, 650 states have (on average 1.4230769230769231) internal successors, (925), 650 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:15,173 INFO L93 Difference]: Finished difference Result 1526 states and 1997 transitions. [2022-04-27 11:17:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1997 transitions. [2022-04-27 11:17:15,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:15,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:15,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 655 states, 650 states have (on average 1.4230769230769231) internal successors, (925), 650 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1526 states. [2022-04-27 11:17:15,175 INFO L87 Difference]: Start difference. First operand has 655 states, 650 states have (on average 1.4230769230769231) internal successors, (925), 650 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1526 states. [2022-04-27 11:17:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:15,230 INFO L93 Difference]: Finished difference Result 1526 states and 1997 transitions. [2022-04-27 11:17:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1997 transitions. [2022-04-27 11:17:15,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:15,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:15,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:15,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.4230769230769231) internal successors, (925), 650 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 929 transitions. [2022-04-27 11:17:15,244 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 929 transitions. Word has length 35 [2022-04-27 11:17:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:15,244 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 929 transitions. [2022-04-27 11:17:15,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 929 transitions. [2022-04-27 11:17:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:17:15,245 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:15,245 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:15,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-27 11:17:15,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:15,446 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:15,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1314298438, now seen corresponding path program 8 times [2022-04-27 11:17:15,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:15,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089045090] [2022-04-27 11:17:15,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:15,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:15,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:15,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {43563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43542#true} is VALID [2022-04-27 11:17:15,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {43542#true} assume true; {43542#true} is VALID [2022-04-27 11:17:15,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43542#true} {43542#true} #94#return; {43542#true} is VALID [2022-04-27 11:17:15,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {43542#true} call ULTIMATE.init(); {43563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:15,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {43563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43542#true} is VALID [2022-04-27 11:17:15,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {43542#true} assume true; {43542#true} is VALID [2022-04-27 11:17:15,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43542#true} {43542#true} #94#return; {43542#true} is VALID [2022-04-27 11:17:15,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {43542#true} call #t~ret17 := main(); {43542#true} is VALID [2022-04-27 11:17:15,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {43542#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43547#(= main_~y~0 0)} is VALID [2022-04-27 11:17:15,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {43547#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43548#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:15,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {43548#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43549#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:15,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {43549#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43550#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:15,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {43550#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43551#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:15,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {43551#(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; {43552#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:15,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {43552#(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; {43553#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:15,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {43553#(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; {43554#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:17:15,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {43554#(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; {43555#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:17:15,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {43555#(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; {43556#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:17:15,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {43556#(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; {43557#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:17:15,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {43557#(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; {43558#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:17:15,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {43558#(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; {43559#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:17:15,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {43559#(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; {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:17:15,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:17:15,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {43561#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:17:15,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {43561#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43562#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-27 11:17:15,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {43562#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {43543#false} is VALID [2022-04-27 11:17:15,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {43543#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43543#false} is VALID [2022-04-27 11:17:15,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {43543#false} assume !(~y~0 % 4294967296 > 0); {43543#false} is VALID [2022-04-27 11:17:15,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {43543#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; {43543#false} is VALID [2022-04-27 11:17:15,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {43543#false} assume !(~x~0 % 4294967296 > 0); {43543#false} is VALID [2022-04-27 11:17:15,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {43543#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; {43543#false} is VALID [2022-04-27 11:17:15,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {43543#false} assume !(~z~0 % 4294967296 > 0); {43543#false} is VALID [2022-04-27 11:17:15,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {43543#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {43543#false} is VALID [2022-04-27 11:17:15,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {43543#false} assume !(~y~0 % 4294967296 > 0); {43543#false} is VALID [2022-04-27 11:17:15,715 INFO L272 TraceCheckUtils]: 31: Hoare triple {43543#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43543#false} is VALID [2022-04-27 11:17:15,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {43543#false} ~cond := #in~cond; {43543#false} is VALID [2022-04-27 11:17:15,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {43543#false} assume 0 == ~cond; {43543#false} is VALID [2022-04-27 11:17:15,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {43543#false} assume !false; {43543#false} is VALID [2022-04-27 11:17:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:17:15,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:15,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089045090] [2022-04-27 11:17:15,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089045090] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:15,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784541627] [2022-04-27 11:17:15,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:17:15,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:15,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:15,717 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:17:15,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-27 11:17:15,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:17:15,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:17:15,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 11:17:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:15,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:16,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {43542#true} call ULTIMATE.init(); {43542#true} is VALID [2022-04-27 11:17:16,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {43542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43542#true} is VALID [2022-04-27 11:17:16,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {43542#true} assume true; {43542#true} is VALID [2022-04-27 11:17:16,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43542#true} {43542#true} #94#return; {43542#true} is VALID [2022-04-27 11:17:16,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {43542#true} call #t~ret17 := main(); {43542#true} is VALID [2022-04-27 11:17:16,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {43542#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43547#(= main_~y~0 0)} is VALID [2022-04-27 11:17:16,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {43547#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43548#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:16,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {43548#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43549#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:16,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {43549#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43550#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:16,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {43550#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43551#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:16,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {43551#(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; {43552#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:16,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {43552#(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; {43553#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:16,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {43553#(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; {43554#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:17:16,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {43554#(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; {43555#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:17:16,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {43555#(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; {43556#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:17:16,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {43556#(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; {43557#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:17:16,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {43557#(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; {43558#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:17:16,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {43558#(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; {43559#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:17:16,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {43559#(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; {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:17:16,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:17:16,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {43561#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:17:16,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {43561#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43630#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:17:16,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {43630#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {43543#false} is VALID [2022-04-27 11:17:16,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {43543#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43543#false} is VALID [2022-04-27 11:17:16,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {43543#false} assume !(~y~0 % 4294967296 > 0); {43543#false} is VALID [2022-04-27 11:17:16,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {43543#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; {43543#false} is VALID [2022-04-27 11:17:16,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {43543#false} assume !(~x~0 % 4294967296 > 0); {43543#false} is VALID [2022-04-27 11:17:16,034 INFO L290 TraceCheckUtils]: 27: Hoare triple {43543#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; {43543#false} is VALID [2022-04-27 11:17:16,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {43543#false} assume !(~z~0 % 4294967296 > 0); {43543#false} is VALID [2022-04-27 11:17:16,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {43543#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {43543#false} is VALID [2022-04-27 11:17:16,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {43543#false} assume !(~y~0 % 4294967296 > 0); {43543#false} is VALID [2022-04-27 11:17:16,034 INFO L272 TraceCheckUtils]: 31: Hoare triple {43543#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43543#false} is VALID [2022-04-27 11:17:16,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {43543#false} ~cond := #in~cond; {43543#false} is VALID [2022-04-27 11:17:16,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {43543#false} assume 0 == ~cond; {43543#false} is VALID [2022-04-27 11:17:16,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {43543#false} assume !false; {43543#false} is VALID [2022-04-27 11:17:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:17:16,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:16,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {43543#false} assume !false; {43543#false} is VALID [2022-04-27 11:17:16,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {43543#false} assume 0 == ~cond; {43543#false} is VALID [2022-04-27 11:17:16,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {43543#false} ~cond := #in~cond; {43543#false} is VALID [2022-04-27 11:17:16,453 INFO L272 TraceCheckUtils]: 31: Hoare triple {43543#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43543#false} is VALID [2022-04-27 11:17:16,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {43543#false} assume !(~y~0 % 4294967296 > 0); {43543#false} is VALID [2022-04-27 11:17:16,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {43543#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {43543#false} is VALID [2022-04-27 11:17:16,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {43543#false} assume !(~z~0 % 4294967296 > 0); {43543#false} is VALID [2022-04-27 11:17:16,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {43543#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; {43543#false} is VALID [2022-04-27 11:17:16,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {43543#false} assume !(~x~0 % 4294967296 > 0); {43543#false} is VALID [2022-04-27 11:17:16,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {43543#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; {43543#false} is VALID [2022-04-27 11:17:16,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {43543#false} assume !(~y~0 % 4294967296 > 0); {43543#false} is VALID [2022-04-27 11:17:16,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {43543#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43543#false} is VALID [2022-04-27 11:17:16,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {43706#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {43543#false} is VALID [2022-04-27 11:17:16,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {43710#(< 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; {43706#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:17:16,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {43714#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {43710#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:17:16,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {43714#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {43714#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:17:16,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {43721#(< 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; {43714#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:17:16,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {43725#(< 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; {43721#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:17:16,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {43729#(< 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; {43725#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:17:16,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {43733#(< 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; {43729#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:17:16,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {43737#(< 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; {43733#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:17:16,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {43741#(< 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; {43737#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:17:16,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {43745#(< 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; {43741#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:16,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {43749#(< 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; {43745#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:17:16,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {43753#(< 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; {43749#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:16,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {43757#(< 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; {43753#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:17:16,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {43761#(< 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; {43757#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:17:16,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {43765#(< 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; {43761#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:17:16,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {43769#(< 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; {43765#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:17:16,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {43542#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43769#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-27 11:17:16,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {43542#true} call #t~ret17 := main(); {43542#true} is VALID [2022-04-27 11:17:16,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43542#true} {43542#true} #94#return; {43542#true} is VALID [2022-04-27 11:17:16,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {43542#true} assume true; {43542#true} is VALID [2022-04-27 11:17:16,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {43542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43542#true} is VALID [2022-04-27 11:17:16,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {43542#true} call ULTIMATE.init(); {43542#true} is VALID [2022-04-27 11:17:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:17:16,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784541627] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:16,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:16,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-27 11:17:16,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446133011] [2022-04-27 11:17:16,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:16,465 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:17:16,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:16,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:16,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:16,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-27 11:17:16,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:16,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-27 11:17:16,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 11:17:16,502 INFO L87 Difference]: Start difference. First operand 655 states and 929 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:36,320 WARN L232 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:17:46,249 WARN L232 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:17:59,979 WARN L232 SmtUtils]: Spent 6.43s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:18:08,004 WARN L232 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:20:13,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:20:50,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:20:50,030 INFO L93 Difference]: Finished difference Result 1623 states and 2457 transitions. [2022-04-27 11:20:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-04-27 11:20:50,030 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:20:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:20:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 658 transitions. [2022-04-27 11:20:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 658 transitions. [2022-04-27 11:20:50,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 658 transitions. [2022-04-27 11:21:08,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 658 edges. 654 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:08,981 INFO L225 Difference]: With dead ends: 1623 [2022-04-27 11:21:08,981 INFO L226 Difference]: Without dead ends: 1503 [2022-04-27 11:21:08,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11900 ImplicationChecksByTransitivity, 165.1s TimeCoverageRelationStatistics Valid=7227, Invalid=23222, Unknown=1, NotChecked=0, Total=30450 [2022-04-27 11:21:08,983 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1725 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2716 mSolverCounterSat, 1929 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 4645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1929 IncrementalHoareTripleChecker+Valid, 2716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:21:08,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1725 Valid, 175 Invalid, 4645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1929 Valid, 2716 Invalid, 0 Unknown, 0 Unchecked, 23.0s Time] [2022-04-27 11:21:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-04-27 11:21:09,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 667. [2022-04-27 11:21:09,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:21:09,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1503 states. Second operand has 667 states, 662 states have (on average 1.460725075528701) internal successors, (967), 662 states have internal predecessors, (967), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:09,930 INFO L74 IsIncluded]: Start isIncluded. First operand 1503 states. Second operand has 667 states, 662 states have (on average 1.460725075528701) internal successors, (967), 662 states have internal predecessors, (967), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:09,931 INFO L87 Difference]: Start difference. First operand 1503 states. Second operand has 667 states, 662 states have (on average 1.460725075528701) internal successors, (967), 662 states have internal predecessors, (967), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:09,982 INFO L93 Difference]: Finished difference Result 1503 states and 2073 transitions. [2022-04-27 11:21:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2073 transitions. [2022-04-27 11:21:09,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:09,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:09,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 667 states, 662 states have (on average 1.460725075528701) internal successors, (967), 662 states have internal predecessors, (967), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1503 states. [2022-04-27 11:21:09,984 INFO L87 Difference]: Start difference. First operand has 667 states, 662 states have (on average 1.460725075528701) internal successors, (967), 662 states have internal predecessors, (967), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1503 states. [2022-04-27 11:21:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:10,045 INFO L93 Difference]: Finished difference Result 1503 states and 2073 transitions. [2022-04-27 11:21:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2073 transitions. [2022-04-27 11:21:10,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:10,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:10,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:21:10,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:21:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 662 states have (on average 1.460725075528701) internal successors, (967), 662 states have internal predecessors, (967), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 971 transitions. [2022-04-27 11:21:10,060 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 971 transitions. Word has length 35 [2022-04-27 11:21:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:21:10,060 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 971 transitions. [2022-04-27 11:21:10,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 971 transitions. [2022-04-27 11:21:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 11:21:10,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:21:10,061 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:21:10,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-27 11:21:10,261 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,SelfDestructingSolverStorable21 [2022-04-27 11:21:10,262 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:21:10,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:21:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash -122316104, now seen corresponding path program 9 times [2022-04-27 11:21:10,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:21:10,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131533074] [2022-04-27 11:21:10,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:21:10,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:21:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:10,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:21:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:10,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {49748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49739#true} is VALID [2022-04-27 11:21:10,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {49739#true} assume true; {49739#true} is VALID [2022-04-27 11:21:10,343 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49739#true} {49739#true} #94#return; {49739#true} is VALID [2022-04-27 11:21:10,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {49739#true} call ULTIMATE.init(); {49748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:21:10,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {49748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49739#true} is VALID [2022-04-27 11:21:10,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {49739#true} assume true; {49739#true} is VALID [2022-04-27 11:21:10,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49739#true} {49739#true} #94#return; {49739#true} is VALID [2022-04-27 11:21:10,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {49739#true} call #t~ret17 := main(); {49739#true} is VALID [2022-04-27 11:21:10,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {49739#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49739#true} is VALID [2022-04-27 11:21:10,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {49739#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49739#true} is VALID [2022-04-27 11:21:10,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {49739#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49739#true} is VALID [2022-04-27 11:21:10,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {49739#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49739#true} is VALID [2022-04-27 11:21:10,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {49739#true} assume !(~x~0 % 4294967296 > 0); {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:10,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:10,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {49744#(<= 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; {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:21:10,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {49745#(<= 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; {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {49746#(<= 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; {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {49747#(<= 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; {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {49747#(<= 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; {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {49747#(<= 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; {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {49747#(<= 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; {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {49746#(<= 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; {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:21:10,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {49745#(<= 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; {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:10,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {49744#(<= 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; {49740#false} is VALID [2022-04-27 11:21:10,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {49740#false} assume !(~x~0 % 4294967296 > 0); {49740#false} is VALID [2022-04-27 11:21:10,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {49740#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; {49740#false} is VALID [2022-04-27 11:21:10,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {49740#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; {49740#false} is VALID [2022-04-27 11:21:10,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {49740#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; {49740#false} is VALID [2022-04-27 11:21:10,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {49740#false} assume !(~z~0 % 4294967296 > 0); {49740#false} is VALID [2022-04-27 11:21:10,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {49740#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {49740#false} is VALID [2022-04-27 11:21:10,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {49740#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {49740#false} is VALID [2022-04-27 11:21:10,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {49740#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {49740#false} is VALID [2022-04-27 11:21:10,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {49740#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {49740#false} is VALID [2022-04-27 11:21:10,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {49740#false} assume !(~y~0 % 4294967296 > 0); {49740#false} is VALID [2022-04-27 11:21:10,354 INFO L272 TraceCheckUtils]: 33: Hoare triple {49740#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {49740#false} is VALID [2022-04-27 11:21:10,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {49740#false} ~cond := #in~cond; {49740#false} is VALID [2022-04-27 11:21:10,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {49740#false} assume 0 == ~cond; {49740#false} is VALID [2022-04-27 11:21:10,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {49740#false} assume !false; {49740#false} is VALID [2022-04-27 11:21:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:21:10,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:21:10,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131533074] [2022-04-27 11:21:10,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131533074] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:21:10,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125227116] [2022-04-27 11:21:10,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:21:10,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:21:10,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:21:10,356 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:21:10,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-27 11:21:10,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 11:21:10,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:21:10,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:21:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:10,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:21:10,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {49739#true} call ULTIMATE.init(); {49739#true} is VALID [2022-04-27 11:21:10,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {49739#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49739#true} is VALID [2022-04-27 11:21:10,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {49739#true} assume true; {49739#true} is VALID [2022-04-27 11:21:10,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49739#true} {49739#true} #94#return; {49739#true} is VALID [2022-04-27 11:21:10,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {49739#true} call #t~ret17 := main(); {49739#true} is VALID [2022-04-27 11:21:10,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {49739#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49739#true} is VALID [2022-04-27 11:21:10,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {49739#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49739#true} is VALID [2022-04-27 11:21:10,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {49739#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49739#true} is VALID [2022-04-27 11:21:10,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {49739#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49739#true} is VALID [2022-04-27 11:21:10,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {49739#true} assume !(~x~0 % 4294967296 > 0); {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:10,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:10,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {49744#(<= 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; {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:21:10,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {49745#(<= 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; {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {49746#(<= 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; {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {49747#(<= 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; {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {49747#(<= 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; {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {49747#(<= 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; {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {49747#(<= 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; {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {49746#(<= 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; {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:21:10,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {49745#(<= 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; {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:10,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {49744#(<= 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; {49740#false} is VALID [2022-04-27 11:21:10,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {49740#false} assume !(~x~0 % 4294967296 > 0); {49740#false} is VALID [2022-04-27 11:21:10,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {49740#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; {49740#false} is VALID [2022-04-27 11:21:10,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {49740#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; {49740#false} is VALID [2022-04-27 11:21:10,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {49740#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; {49740#false} is VALID [2022-04-27 11:21:10,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {49740#false} assume !(~z~0 % 4294967296 > 0); {49740#false} is VALID [2022-04-27 11:21:10,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {49740#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {49740#false} is VALID [2022-04-27 11:21:10,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {49740#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {49740#false} is VALID [2022-04-27 11:21:10,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {49740#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {49740#false} is VALID [2022-04-27 11:21:10,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {49740#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {49740#false} is VALID [2022-04-27 11:21:10,660 INFO L290 TraceCheckUtils]: 32: Hoare triple {49740#false} assume !(~y~0 % 4294967296 > 0); {49740#false} is VALID [2022-04-27 11:21:10,661 INFO L272 TraceCheckUtils]: 33: Hoare triple {49740#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {49740#false} is VALID [2022-04-27 11:21:10,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {49740#false} ~cond := #in~cond; {49740#false} is VALID [2022-04-27 11:21:10,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {49740#false} assume 0 == ~cond; {49740#false} is VALID [2022-04-27 11:21:10,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {49740#false} assume !false; {49740#false} is VALID [2022-04-27 11:21:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:21:10,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:21:10,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {49740#false} assume !false; {49740#false} is VALID [2022-04-27 11:21:10,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {49740#false} assume 0 == ~cond; {49740#false} is VALID [2022-04-27 11:21:10,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {49740#false} ~cond := #in~cond; {49740#false} is VALID [2022-04-27 11:21:10,851 INFO L272 TraceCheckUtils]: 33: Hoare triple {49740#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {49740#false} is VALID [2022-04-27 11:21:10,851 INFO L290 TraceCheckUtils]: 32: Hoare triple {49740#false} assume !(~y~0 % 4294967296 > 0); {49740#false} is VALID [2022-04-27 11:21:10,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {49740#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {49740#false} is VALID [2022-04-27 11:21:10,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {49740#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {49740#false} is VALID [2022-04-27 11:21:10,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {49740#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {49740#false} is VALID [2022-04-27 11:21:10,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {49740#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {49740#false} is VALID [2022-04-27 11:21:10,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {49740#false} assume !(~z~0 % 4294967296 > 0); {49740#false} is VALID [2022-04-27 11:21:10,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {49740#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; {49740#false} is VALID [2022-04-27 11:21:10,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {49740#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; {49740#false} is VALID [2022-04-27 11:21:10,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {49740#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; {49740#false} is VALID [2022-04-27 11:21:10,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {49740#false} assume !(~x~0 % 4294967296 > 0); {49740#false} is VALID [2022-04-27 11:21:10,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {49744#(<= 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; {49740#false} is VALID [2022-04-27 11:21:10,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {49745#(<= 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; {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:10,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {49746#(<= 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; {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:21:10,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {49747#(<= 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; {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {49747#(<= 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; {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {49747#(<= 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; {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {49747#(<= 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; {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {49746#(<= 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; {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {49745#(<= 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; {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:10,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {49744#(<= 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; {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:21:10,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:10,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {49739#true} assume !(~x~0 % 4294967296 > 0); {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:10,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {49739#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49739#true} is VALID [2022-04-27 11:21:10,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {49739#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49739#true} is VALID [2022-04-27 11:21:10,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {49739#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49739#true} is VALID [2022-04-27 11:21:10,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {49739#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49739#true} is VALID [2022-04-27 11:21:10,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {49739#true} call #t~ret17 := main(); {49739#true} is VALID [2022-04-27 11:21:10,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49739#true} {49739#true} #94#return; {49739#true} is VALID [2022-04-27 11:21:10,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {49739#true} assume true; {49739#true} is VALID [2022-04-27 11:21:10,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {49739#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49739#true} is VALID [2022-04-27 11:21:10,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {49739#true} call ULTIMATE.init(); {49739#true} is VALID [2022-04-27 11:21:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:21:10,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125227116] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:21:10,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:21:10,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-27 11:21:10,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619437874] [2022-04-27 11:21:10,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:21:10,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 11:21:10,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:21:10,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:10,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:10,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:21:10,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:21:10,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:21:10,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:21:10,883 INFO L87 Difference]: Start difference. First operand 667 states and 971 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:12,423 INFO L93 Difference]: Finished difference Result 1079 states and 1532 transitions. [2022-04-27 11:21:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:21:12,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 11:21:12,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:21:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-27 11:21:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-27 11:21:12,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-04-27 11:21:12,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:12,507 INFO L225 Difference]: With dead ends: 1079 [2022-04-27 11:21:12,507 INFO L226 Difference]: Without dead ends: 887 [2022-04-27 11:21:12,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:21:12,508 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:21:12,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 67 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:21:12,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-04-27 11:21:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 608. [2022-04-27 11:21:13,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:21:13,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 887 states. Second operand has 608 states, 603 states have (on average 1.4593698175787728) internal successors, (880), 603 states have internal predecessors, (880), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:13,419 INFO L74 IsIncluded]: Start isIncluded. First operand 887 states. Second operand has 608 states, 603 states have (on average 1.4593698175787728) internal successors, (880), 603 states have internal predecessors, (880), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:13,420 INFO L87 Difference]: Start difference. First operand 887 states. Second operand has 608 states, 603 states have (on average 1.4593698175787728) internal successors, (880), 603 states have internal predecessors, (880), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:13,446 INFO L93 Difference]: Finished difference Result 887 states and 1239 transitions. [2022-04-27 11:21:13,446 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1239 transitions. [2022-04-27 11:21:13,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:13,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:13,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 608 states, 603 states have (on average 1.4593698175787728) internal successors, (880), 603 states have internal predecessors, (880), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 887 states. [2022-04-27 11:21:13,448 INFO L87 Difference]: Start difference. First operand has 608 states, 603 states have (on average 1.4593698175787728) internal successors, (880), 603 states have internal predecessors, (880), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 887 states. [2022-04-27 11:21:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:13,468 INFO L93 Difference]: Finished difference Result 887 states and 1239 transitions. [2022-04-27 11:21:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1239 transitions. [2022-04-27 11:21:13,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:13,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:13,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:21:13,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:21:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 603 states have (on average 1.4593698175787728) internal successors, (880), 603 states have internal predecessors, (880), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 884 transitions. [2022-04-27 11:21:13,481 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 884 transitions. Word has length 37 [2022-04-27 11:21:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:21:13,481 INFO L495 AbstractCegarLoop]: Abstraction has 608 states and 884 transitions. [2022-04-27 11:21:13,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 884 transitions. [2022-04-27 11:21:13,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 11:21:13,481 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:21:13,481 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:21:13,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-27 11:21:13,682 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,SelfDestructingSolverStorable22 [2022-04-27 11:21:13,682 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:21:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:21:13,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1034985127, now seen corresponding path program 10 times [2022-04-27 11:21:13,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:21:13,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189073426] [2022-04-27 11:21:13,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:21:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:21:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:13,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:21:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:13,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {53727#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53715#true} is VALID [2022-04-27 11:21:13,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {53715#true} assume true; {53715#true} is VALID [2022-04-27 11:21:13,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53715#true} {53715#true} #94#return; {53715#true} is VALID [2022-04-27 11:21:13,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {53715#true} call ULTIMATE.init(); {53727#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:21:13,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {53727#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53715#true} is VALID [2022-04-27 11:21:13,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {53715#true} assume true; {53715#true} is VALID [2022-04-27 11:21:13,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53715#true} {53715#true} #94#return; {53715#true} is VALID [2022-04-27 11:21:13,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {53715#true} call #t~ret17 := main(); {53715#true} is VALID [2022-04-27 11:21:13,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {53715#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53715#true} is VALID [2022-04-27 11:21:13,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {53715#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53715#true} is VALID [2022-04-27 11:21:13,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {53715#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53715#true} is VALID [2022-04-27 11:21:13,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {53715#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53715#true} is VALID [2022-04-27 11:21:13,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {53715#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53715#true} is VALID [2022-04-27 11:21:13,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {53715#true} assume !(~x~0 % 4294967296 > 0); {53720#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:21:13,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {53720#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {53720#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:21:13,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {53720#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53721#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:21:13,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {53721#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53722#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:21:13,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {53722#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53723#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:21:13,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {53723#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:21:13,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:21:13,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:21:13,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:21:13,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:21:13,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:21:13,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:21:13,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {53725#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:21:13,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {53725#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {53726#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:21:13,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {53726#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {53716#false} is VALID [2022-04-27 11:21:13,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {53716#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; {53716#false} is VALID [2022-04-27 11:21:13,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {53716#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; {53716#false} is VALID [2022-04-27 11:21:13,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {53716#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; {53716#false} is VALID [2022-04-27 11:21:13,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {53716#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; {53716#false} is VALID [2022-04-27 11:21:13,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {53716#false} assume !(~z~0 % 4294967296 > 0); {53716#false} is VALID [2022-04-27 11:21:13,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {53716#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {53716#false} is VALID [2022-04-27 11:21:13,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {53716#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {53716#false} is VALID [2022-04-27 11:21:13,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {53716#false} assume !(~y~0 % 4294967296 > 0); {53716#false} is VALID [2022-04-27 11:21:13,815 INFO L272 TraceCheckUtils]: 33: Hoare triple {53716#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53716#false} is VALID [2022-04-27 11:21:13,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {53716#false} ~cond := #in~cond; {53716#false} is VALID [2022-04-27 11:21:13,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {53716#false} assume 0 == ~cond; {53716#false} is VALID [2022-04-27 11:21:13,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {53716#false} assume !false; {53716#false} is VALID [2022-04-27 11:21:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-27 11:21:13,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:21:13,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189073426] [2022-04-27 11:21:13,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189073426] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:21:13,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687305797] [2022-04-27 11:21:13,816 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:21:13,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:21:13,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:21:13,817 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:21:13,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-27 11:21:13,880 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:21:13,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:21:13,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 11:21:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:13,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:21:14,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {53715#true} call ULTIMATE.init(); {53715#true} is VALID [2022-04-27 11:21:14,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {53715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53715#true} is VALID [2022-04-27 11:21:14,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {53715#true} assume true; {53715#true} is VALID [2022-04-27 11:21:14,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53715#true} {53715#true} #94#return; {53715#true} is VALID [2022-04-27 11:21:14,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {53715#true} call #t~ret17 := main(); {53715#true} is VALID [2022-04-27 11:21:14,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {53715#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53715#true} is VALID [2022-04-27 11:21:14,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {53715#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53715#true} is VALID [2022-04-27 11:21:14,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {53715#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53715#true} is VALID [2022-04-27 11:21:14,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {53715#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53755#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:21:14,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {53755#(< 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; {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:21:14,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:21:14,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:21:14,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {53759#(< 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; {53755#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:21:14,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {53755#(< 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; {53772#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:21:14,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {53772#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:14,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:14,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:14,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:14,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:14,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:14,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:14,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !(~y~0 % 4294967296 > 0); {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:14,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:14,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {53772#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:21:14,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {53772#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {53716#false} is VALID [2022-04-27 11:21:14,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {53716#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; {53716#false} is VALID [2022-04-27 11:21:14,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {53716#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; {53716#false} is VALID [2022-04-27 11:21:14,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {53716#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; {53716#false} is VALID [2022-04-27 11:21:14,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {53716#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; {53716#false} is VALID [2022-04-27 11:21:14,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {53716#false} assume !(~z~0 % 4294967296 > 0); {53716#false} is VALID [2022-04-27 11:21:14,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {53716#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {53716#false} is VALID [2022-04-27 11:21:14,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {53716#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {53716#false} is VALID [2022-04-27 11:21:14,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {53716#false} assume !(~y~0 % 4294967296 > 0); {53716#false} is VALID [2022-04-27 11:21:14,072 INFO L272 TraceCheckUtils]: 33: Hoare triple {53716#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53716#false} is VALID [2022-04-27 11:21:14,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {53716#false} ~cond := #in~cond; {53716#false} is VALID [2022-04-27 11:21:14,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {53716#false} assume 0 == ~cond; {53716#false} is VALID [2022-04-27 11:21:14,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {53716#false} assume !false; {53716#false} is VALID [2022-04-27 11:21:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 11:21:14,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:21:14,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {53716#false} assume !false; {53716#false} is VALID [2022-04-27 11:21:14,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {53716#false} assume 0 == ~cond; {53716#false} is VALID [2022-04-27 11:21:14,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {53716#false} ~cond := #in~cond; {53716#false} is VALID [2022-04-27 11:21:14,176 INFO L272 TraceCheckUtils]: 33: Hoare triple {53716#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53716#false} is VALID [2022-04-27 11:21:14,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {53716#false} assume !(~y~0 % 4294967296 > 0); {53716#false} is VALID [2022-04-27 11:21:14,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {53716#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {53716#false} is VALID [2022-04-27 11:21:14,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {53716#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {53716#false} is VALID [2022-04-27 11:21:14,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {53716#false} assume !(~z~0 % 4294967296 > 0); {53716#false} is VALID [2022-04-27 11:21:14,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {53716#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; {53716#false} is VALID [2022-04-27 11:21:14,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {53716#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; {53716#false} is VALID [2022-04-27 11:21:14,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {53716#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; {53716#false} is VALID [2022-04-27 11:21:14,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {53716#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; {53716#false} is VALID [2022-04-27 11:21:14,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {53772#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {53716#false} is VALID [2022-04-27 11:21:14,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {53772#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:21:14,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:14,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !(~y~0 % 4294967296 > 0); {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:14,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:14,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:14,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:14,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:14,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:14,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:14,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {53772#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:14,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {53755#(< 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; {53772#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:21:14,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {53759#(< 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; {53755#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:21:14,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:21:14,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:21:14,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {53755#(< 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; {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:21:14,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {53715#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53755#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:21:14,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {53715#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53715#true} is VALID [2022-04-27 11:21:14,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {53715#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53715#true} is VALID [2022-04-27 11:21:14,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {53715#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53715#true} is VALID [2022-04-27 11:21:14,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {53715#true} call #t~ret17 := main(); {53715#true} is VALID [2022-04-27 11:21:14,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53715#true} {53715#true} #94#return; {53715#true} is VALID [2022-04-27 11:21:14,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {53715#true} assume true; {53715#true} is VALID [2022-04-27 11:21:14,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {53715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53715#true} is VALID [2022-04-27 11:21:14,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {53715#true} call ULTIMATE.init(); {53715#true} is VALID [2022-04-27 11:21:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 11:21:14,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687305797] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:21:14,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:21:14,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-04-27 11:21:14,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949626068] [2022-04-27 11:21:14,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:21:14,186 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 11:21:14,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:21:14,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:14,218 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-27 11:21:14,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 11:21:14,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:21:14,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 11:21:14,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:21:14,219 INFO L87 Difference]: Start difference. First operand 608 states and 884 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:16,846 INFO L93 Difference]: Finished difference Result 1380 states and 2003 transitions. [2022-04-27 11:21:16,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 11:21:16,846 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 11:21:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:21:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 153 transitions. [2022-04-27 11:21:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 153 transitions. [2022-04-27 11:21:16,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 153 transitions. [2022-04-27 11:21:17,041 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-27 11:21:17,085 INFO L225 Difference]: With dead ends: 1380 [2022-04-27 11:21:17,085 INFO L226 Difference]: Without dead ends: 1175 [2022-04-27 11:21:17,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:21:17,086 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 287 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:21:17,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 73 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:21:17,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2022-04-27 11:21:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 660. [2022-04-27 11:21:18,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:21:18,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1175 states. Second operand has 660 states, 655 states have (on average 1.451908396946565) internal successors, (951), 655 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:18,227 INFO L74 IsIncluded]: Start isIncluded. First operand 1175 states. Second operand has 660 states, 655 states have (on average 1.451908396946565) internal successors, (951), 655 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:18,228 INFO L87 Difference]: Start difference. First operand 1175 states. Second operand has 660 states, 655 states have (on average 1.451908396946565) internal successors, (951), 655 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:18,260 INFO L93 Difference]: Finished difference Result 1175 states and 1668 transitions. [2022-04-27 11:21:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1668 transitions. [2022-04-27 11:21:18,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:18,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:18,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 660 states, 655 states have (on average 1.451908396946565) internal successors, (951), 655 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1175 states. [2022-04-27 11:21:18,262 INFO L87 Difference]: Start difference. First operand has 660 states, 655 states have (on average 1.451908396946565) internal successors, (951), 655 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1175 states. [2022-04-27 11:21:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:18,295 INFO L93 Difference]: Finished difference Result 1175 states and 1668 transitions. [2022-04-27 11:21:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1668 transitions. [2022-04-27 11:21:18,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:18,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:18,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:21:18,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:21:18,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 655 states have (on average 1.451908396946565) internal successors, (951), 655 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 955 transitions. [2022-04-27 11:21:18,310 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 955 transitions. Word has length 37 [2022-04-27 11:21:18,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:21:18,310 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 955 transitions. [2022-04-27 11:21:18,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:18,310 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 955 transitions. [2022-04-27 11:21:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 11:21:18,311 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:21:18,311 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:21:18,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-27 11:21:18,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:21:18,515 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:21:18,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:21:18,516 INFO L85 PathProgramCache]: Analyzing trace with hash 350902887, now seen corresponding path program 7 times [2022-04-27 11:21:18,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:21:18,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755799791] [2022-04-27 11:21:18,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:21:18,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:21:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:18,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:21:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:18,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {58737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58716#true} is VALID [2022-04-27 11:21:18,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {58716#true} assume true; {58716#true} is VALID [2022-04-27 11:21:18,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58716#true} {58716#true} #94#return; {58716#true} is VALID [2022-04-27 11:21:18,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {58716#true} call ULTIMATE.init(); {58737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:21:18,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {58737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58716#true} is VALID [2022-04-27 11:21:18,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {58716#true} assume true; {58716#true} is VALID [2022-04-27 11:21:18,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58716#true} {58716#true} #94#return; {58716#true} is VALID [2022-04-27 11:21:18,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {58716#true} call #t~ret17 := main(); {58716#true} is VALID [2022-04-27 11:21:18,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {58716#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58721#(= main_~y~0 0)} is VALID [2022-04-27 11:21:18,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {58721#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58722#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:21:18,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {58722#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58723#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:21:18,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {58723#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58724#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:21:18,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {58724#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58725#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:21:18,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {58725#(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; {58726#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:21:18,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {58726#(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; {58727#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:21:18,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {58727#(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; {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:21:18,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:21:18,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {58729#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:21:18,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {58729#(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; {58730#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:21:18,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {58730#(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; {58731#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:21:18,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {58731#(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; {58732#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:21:18,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {58732#(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; {58733#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:21:18,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {58733#(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; {58734#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:21:18,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {58734#(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; {58735#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:21:18,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {58735#(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; {58736#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:21:18,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {58736#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58717#false} is VALID [2022-04-27 11:21:18,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {58717#false} assume !(~z~0 % 4294967296 > 0); {58717#false} is VALID [2022-04-27 11:21:18,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {58717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58717#false} is VALID [2022-04-27 11:21:18,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {58717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58717#false} is VALID [2022-04-27 11:21:18,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {58717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58717#false} is VALID [2022-04-27 11:21:18,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {58717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58717#false} is VALID [2022-04-27 11:21:18,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {58717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58717#false} is VALID [2022-04-27 11:21:18,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {58717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58717#false} is VALID [2022-04-27 11:21:18,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {58717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58717#false} is VALID [2022-04-27 11:21:18,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {58717#false} assume !(~y~0 % 4294967296 > 0); {58717#false} is VALID [2022-04-27 11:21:18,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {58717#false} assume !(~x~0 % 4294967296 > 0); {58717#false} is VALID [2022-04-27 11:21:18,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {58717#false} assume !(~z~0 % 4294967296 > 0); {58717#false} is VALID [2022-04-27 11:21:18,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {58717#false} assume !(~y~0 % 4294967296 > 0); {58717#false} is VALID [2022-04-27 11:21:18,778 INFO L272 TraceCheckUtils]: 35: Hoare triple {58717#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58717#false} is VALID [2022-04-27 11:21:18,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {58717#false} ~cond := #in~cond; {58717#false} is VALID [2022-04-27 11:21:18,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {58717#false} assume 0 == ~cond; {58717#false} is VALID [2022-04-27 11:21:18,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {58717#false} assume !false; {58717#false} is VALID [2022-04-27 11:21:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:21:18,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:21:18,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755799791] [2022-04-27 11:21:18,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755799791] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:21:18,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142628184] [2022-04-27 11:21:18,778 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:21:18,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:21:18,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:21:18,779 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:21:18,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-27 11:21:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:18,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 11:21:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:18,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:21:19,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {58716#true} call ULTIMATE.init(); {58716#true} is VALID [2022-04-27 11:21:19,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {58716#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58716#true} is VALID [2022-04-27 11:21:19,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {58716#true} assume true; {58716#true} is VALID [2022-04-27 11:21:19,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58716#true} {58716#true} #94#return; {58716#true} is VALID [2022-04-27 11:21:19,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {58716#true} call #t~ret17 := main(); {58716#true} is VALID [2022-04-27 11:21:19,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {58716#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58721#(= main_~y~0 0)} is VALID [2022-04-27 11:21:19,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {58721#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58722#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:21:19,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {58722#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58723#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:21:19,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {58723#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58724#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:21:19,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {58724#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58725#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:21:19,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {58725#(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; {58726#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:21:19,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {58726#(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; {58727#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:21:19,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {58727#(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; {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:21:19,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:21:19,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {58783#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:21:19,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {58783#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58787#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:21:19,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {58787#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58791#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:21:19,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {58791#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58795#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:21:19,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {58795#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58799#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:21:19,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {58799#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58803#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-27 11:21:19,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {58803#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58807#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:21:19,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {58807#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58811#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:21:19,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {58811#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58717#false} is VALID [2022-04-27 11:21:19,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {58717#false} assume !(~z~0 % 4294967296 > 0); {58717#false} is VALID [2022-04-27 11:21:19,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {58717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58717#false} is VALID [2022-04-27 11:21:19,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {58717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58717#false} is VALID [2022-04-27 11:21:19,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {58717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58717#false} is VALID [2022-04-27 11:21:19,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {58717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58717#false} is VALID [2022-04-27 11:21:19,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {58717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58717#false} is VALID [2022-04-27 11:21:19,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {58717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58717#false} is VALID [2022-04-27 11:21:19,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {58717#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58717#false} is VALID [2022-04-27 11:21:19,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {58717#false} assume !(~y~0 % 4294967296 > 0); {58717#false} is VALID [2022-04-27 11:21:19,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {58717#false} assume !(~x~0 % 4294967296 > 0); {58717#false} is VALID [2022-04-27 11:21:19,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {58717#false} assume !(~z~0 % 4294967296 > 0); {58717#false} is VALID [2022-04-27 11:21:19,211 INFO L290 TraceCheckUtils]: 34: Hoare triple {58717#false} assume !(~y~0 % 4294967296 > 0); {58717#false} is VALID [2022-04-27 11:21:19,211 INFO L272 TraceCheckUtils]: 35: Hoare triple {58717#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58717#false} is VALID [2022-04-27 11:21:19,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {58717#false} ~cond := #in~cond; {58717#false} is VALID [2022-04-27 11:21:19,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {58717#false} assume 0 == ~cond; {58717#false} is VALID [2022-04-27 11:21:19,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {58717#false} assume !false; {58717#false} is VALID [2022-04-27 11:21:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:21:19,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:21:19,780 INFO L290 TraceCheckUtils]: 38: Hoare triple {58717#false} assume !false; {58717#false} is VALID [2022-04-27 11:21:19,780 INFO L290 TraceCheckUtils]: 37: Hoare triple {58717#false} assume 0 == ~cond; {58717#false} is VALID [2022-04-27 11:21:19,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {58717#false} ~cond := #in~cond; {58717#false} is VALID [2022-04-27 11:21:19,780 INFO L272 TraceCheckUtils]: 35: Hoare triple {58717#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58717#false} is VALID [2022-04-27 11:21:19,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {58717#false} assume !(~y~0 % 4294967296 > 0); {58717#false} is VALID [2022-04-27 11:21:19,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {58717#false} assume !(~z~0 % 4294967296 > 0); {58717#false} is VALID [2022-04-27 11:21:19,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {58717#false} assume !(~x~0 % 4294967296 > 0); {58717#false} is VALID [2022-04-27 11:21:19,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {58884#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {58717#false} is VALID [2022-04-27 11:21:19,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {58888#(< 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; {58884#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:21:19,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {58892#(< 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; {58888#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:19,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {58896#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58892#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:19,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {58900#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58896#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:21:19,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {58904#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58900#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:21:19,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {58908#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58904#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:21:19,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {58912#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58908#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:21:19,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {58912#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~z~0 % 4294967296 > 0); {58912#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:21:19,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {58919#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58912#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:21:19,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {58923#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58919#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-27 11:21:19,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {58927#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58923#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-27 11:21:19,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {58931#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58927#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:21:19,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {58935#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58931#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-27 11:21:19,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {58939#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58935#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:21:19,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {58943#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58939#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:21:19,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {58947#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58943#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:21:19,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {58716#true} ~z~0 := ~y~0; {58947#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-27 11:21:19,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {58716#true} assume !(~x~0 % 4294967296 > 0); {58716#true} is VALID [2022-04-27 11:21:19,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {58716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58716#true} is VALID [2022-04-27 11:21:19,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {58716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58716#true} is VALID [2022-04-27 11:21:19,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {58716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58716#true} is VALID [2022-04-27 11:21:19,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {58716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58716#true} is VALID [2022-04-27 11:21:19,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {58716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58716#true} is VALID [2022-04-27 11:21:19,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {58716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58716#true} is VALID [2022-04-27 11:21:19,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {58716#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58716#true} is VALID [2022-04-27 11:21:19,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {58716#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58716#true} is VALID [2022-04-27 11:21:19,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {58716#true} call #t~ret17 := main(); {58716#true} is VALID [2022-04-27 11:21:19,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58716#true} {58716#true} #94#return; {58716#true} is VALID [2022-04-27 11:21:19,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {58716#true} assume true; {58716#true} is VALID [2022-04-27 11:21:19,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {58716#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58716#true} is VALID [2022-04-27 11:21:19,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {58716#true} call ULTIMATE.init(); {58716#true} is VALID [2022-04-27 11:21:19,794 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:21:19,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142628184] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:21:19,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:21:19,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 43 [2022-04-27 11:21:19,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809329353] [2022-04-27 11:21:19,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:21:19,795 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 42 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-27 11:21:19,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:21:19,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 42 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:19,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:19,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-27 11:21:19,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:21:19,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-27 11:21:19,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 11:21:19,839 INFO L87 Difference]: Start difference. First operand 660 states and 955 transitions. Second operand has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 42 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:08,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:22:08,428 INFO L93 Difference]: Finished difference Result 1590 states and 2257 transitions. [2022-04-27 11:22:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2022-04-27 11:22:08,429 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 42 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-27 11:22:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:22:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 42 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 726 transitions. [2022-04-27 11:22:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 42 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 726 transitions. [2022-04-27 11:22:08,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 726 transitions. [2022-04-27 11:22:10,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 726 edges. 726 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:22:10,277 INFO L225 Difference]: With dead ends: 1590 [2022-04-27 11:22:10,277 INFO L226 Difference]: Without dead ends: 1441 [2022-04-27 11:22:10,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24817 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=7979, Invalid=55777, Unknown=0, NotChecked=0, Total=63756 [2022-04-27 11:22:10,281 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 680 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4214 mSolverCounterSat, 1325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 5539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1325 IncrementalHoareTripleChecker+Valid, 4214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:22:10,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 152 Invalid, 5539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1325 Valid, 4214 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2022-04-27 11:22:10,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2022-04-27 11:22:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 935. [2022-04-27 11:22:11,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:22:11,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1441 states. Second operand has 935 states, 930 states have (on average 1.4645161290322581) internal successors, (1362), 930 states have internal predecessors, (1362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:11,755 INFO L74 IsIncluded]: Start isIncluded. First operand 1441 states. Second operand has 935 states, 930 states have (on average 1.4645161290322581) internal successors, (1362), 930 states have internal predecessors, (1362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:11,755 INFO L87 Difference]: Start difference. First operand 1441 states. Second operand has 935 states, 930 states have (on average 1.4645161290322581) internal successors, (1362), 930 states have internal predecessors, (1362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:22:11,802 INFO L93 Difference]: Finished difference Result 1441 states and 1895 transitions. [2022-04-27 11:22:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1895 transitions. [2022-04-27 11:22:11,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:22:11,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:22:11,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 935 states, 930 states have (on average 1.4645161290322581) internal successors, (1362), 930 states have internal predecessors, (1362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1441 states. [2022-04-27 11:22:11,805 INFO L87 Difference]: Start difference. First operand has 935 states, 930 states have (on average 1.4645161290322581) internal successors, (1362), 930 states have internal predecessors, (1362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1441 states. [2022-04-27 11:22:11,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:22:11,852 INFO L93 Difference]: Finished difference Result 1441 states and 1895 transitions. [2022-04-27 11:22:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1895 transitions. [2022-04-27 11:22:11,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:22:11,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:22:11,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:22:11,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:22:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 930 states have (on average 1.4645161290322581) internal successors, (1362), 930 states have internal predecessors, (1362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1366 transitions. [2022-04-27 11:22:11,879 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1366 transitions. Word has length 39 [2022-04-27 11:22:11,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:22:11,879 INFO L495 AbstractCegarLoop]: Abstraction has 935 states and 1366 transitions. [2022-04-27 11:22:11,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 42 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1366 transitions. [2022-04-27 11:22:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 11:22:11,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:22:11,880 INFO L195 NwaCegarLoop]: trace histogram [14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:22:11,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-27 11:22:12,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:22:12,081 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:22:12,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:22:12,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2105354201, now seen corresponding path program 4 times [2022-04-27 11:22:12,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:22:12,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928651970] [2022-04-27 11:22:12,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:22:12,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:22:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:22:12,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:22:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:22:12,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {65229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65206#true} is VALID [2022-04-27 11:22:12,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {65206#true} assume true; {65206#true} is VALID [2022-04-27 11:22:12,399 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65206#true} {65206#true} #94#return; {65206#true} is VALID [2022-04-27 11:22:12,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {65206#true} call ULTIMATE.init(); {65229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:22:12,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {65229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65206#true} is VALID [2022-04-27 11:22:12,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {65206#true} assume true; {65206#true} is VALID [2022-04-27 11:22:12,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65206#true} {65206#true} #94#return; {65206#true} is VALID [2022-04-27 11:22:12,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {65206#true} call #t~ret17 := main(); {65206#true} is VALID [2022-04-27 11:22:12,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {65206#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65211#(= main_~y~0 0)} is VALID [2022-04-27 11:22:12,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {65211#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65212#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:22:12,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {65212#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65213#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:22:12,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {65213#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65214#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:22:12,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {65214#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65215#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:22:12,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {65215#(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; {65216#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:22:12,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {65216#(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; {65217#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:22:12,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {65217#(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; {65218#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:22:12,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {65218#(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; {65219#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:22:12,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {65219#(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; {65220#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:22:12,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {65220#(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; {65221#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:22:12,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {65221#(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; {65222#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:22:12,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {65222#(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; {65223#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:22:12,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {65223#(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; {65224#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:22:12,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {65224#(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; {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:22:12,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:22:12,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {65226#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:22:12,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {65226#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65227#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:22:12,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {65227#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65228#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-27 11:22:12,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {65228#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {65207#false} is VALID [2022-04-27 11:22:12,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {65207#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65207#false} is VALID [2022-04-27 11:22:12,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {65207#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65207#false} is VALID [2022-04-27 11:22:12,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {65207#false} assume !(~y~0 % 4294967296 > 0); {65207#false} is VALID [2022-04-27 11:22:12,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {65207#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; {65207#false} is VALID [2022-04-27 11:22:12,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {65207#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; {65207#false} is VALID [2022-04-27 11:22:12,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {65207#false} assume !(~x~0 % 4294967296 > 0); {65207#false} is VALID [2022-04-27 11:22:12,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {65207#false} assume !(~z~0 % 4294967296 > 0); {65207#false} is VALID [2022-04-27 11:22:12,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {65207#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {65207#false} is VALID [2022-04-27 11:22:12,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {65207#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {65207#false} is VALID [2022-04-27 11:22:12,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {65207#false} assume !(~y~0 % 4294967296 > 0); {65207#false} is VALID [2022-04-27 11:22:12,412 INFO L272 TraceCheckUtils]: 35: Hoare triple {65207#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {65207#false} is VALID [2022-04-27 11:22:12,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {65207#false} ~cond := #in~cond; {65207#false} is VALID [2022-04-27 11:22:12,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {65207#false} assume 0 == ~cond; {65207#false} is VALID [2022-04-27 11:22:12,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {65207#false} assume !false; {65207#false} is VALID [2022-04-27 11:22:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:22:12,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:22:12,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928651970] [2022-04-27 11:22:12,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928651970] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:22:12,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022701239] [2022-04-27 11:22:12,412 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:22:12,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:22:12,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:22:12,413 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:22:12,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-27 11:22:12,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:22:12,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:22:12,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 11:22:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:22:12,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:22:12,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {65206#true} call ULTIMATE.init(); {65206#true} is VALID [2022-04-27 11:22:12,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {65206#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65206#true} is VALID [2022-04-27 11:22:12,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {65206#true} assume true; {65206#true} is VALID [2022-04-27 11:22:12,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65206#true} {65206#true} #94#return; {65206#true} is VALID [2022-04-27 11:22:12,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {65206#true} call #t~ret17 := main(); {65206#true} is VALID [2022-04-27 11:22:12,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {65206#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65211#(= main_~y~0 0)} is VALID [2022-04-27 11:22:12,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {65211#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65212#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:22:12,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {65212#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65213#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:22:12,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {65213#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65214#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:22:12,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {65214#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65215#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:22:12,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {65215#(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; {65216#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:22:12,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {65216#(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; {65217#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:22:12,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {65217#(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; {65218#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:22:12,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {65218#(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; {65219#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:22:12,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {65219#(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; {65220#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:22:12,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {65220#(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; {65221#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:22:12,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {65221#(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; {65222#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:22:12,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {65222#(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; {65223#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:22:12,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {65223#(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; {65224#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:22:12,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {65224#(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; {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:22:12,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:22:12,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {65226#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:22:12,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {65226#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65227#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:22:12,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {65227#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65302#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:22:12,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {65302#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {65207#false} is VALID [2022-04-27 11:22:12,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {65207#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65207#false} is VALID [2022-04-27 11:22:12,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {65207#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65207#false} is VALID [2022-04-27 11:22:12,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {65207#false} assume !(~y~0 % 4294967296 > 0); {65207#false} is VALID [2022-04-27 11:22:12,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {65207#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; {65207#false} is VALID [2022-04-27 11:22:12,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {65207#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; {65207#false} is VALID [2022-04-27 11:22:12,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {65207#false} assume !(~x~0 % 4294967296 > 0); {65207#false} is VALID [2022-04-27 11:22:12,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {65207#false} assume !(~z~0 % 4294967296 > 0); {65207#false} is VALID [2022-04-27 11:22:12,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {65207#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {65207#false} is VALID [2022-04-27 11:22:12,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {65207#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {65207#false} is VALID [2022-04-27 11:22:12,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {65207#false} assume !(~y~0 % 4294967296 > 0); {65207#false} is VALID [2022-04-27 11:22:12,755 INFO L272 TraceCheckUtils]: 35: Hoare triple {65207#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {65207#false} is VALID [2022-04-27 11:22:12,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {65207#false} ~cond := #in~cond; {65207#false} is VALID [2022-04-27 11:22:12,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {65207#false} assume 0 == ~cond; {65207#false} is VALID [2022-04-27 11:22:12,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {65207#false} assume !false; {65207#false} is VALID [2022-04-27 11:22:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:22:12,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:22:13,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {65207#false} assume !false; {65207#false} is VALID [2022-04-27 11:22:13,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {65207#false} assume 0 == ~cond; {65207#false} is VALID [2022-04-27 11:22:13,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {65207#false} ~cond := #in~cond; {65207#false} is VALID [2022-04-27 11:22:13,285 INFO L272 TraceCheckUtils]: 35: Hoare triple {65207#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {65207#false} is VALID [2022-04-27 11:22:13,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {65207#false} assume !(~y~0 % 4294967296 > 0); {65207#false} is VALID [2022-04-27 11:22:13,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {65207#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {65207#false} is VALID [2022-04-27 11:22:13,286 INFO L290 TraceCheckUtils]: 32: Hoare triple {65207#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {65207#false} is VALID [2022-04-27 11:22:13,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {65207#false} assume !(~z~0 % 4294967296 > 0); {65207#false} is VALID [2022-04-27 11:22:13,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {65207#false} assume !(~x~0 % 4294967296 > 0); {65207#false} is VALID [2022-04-27 11:22:13,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {65207#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; {65207#false} is VALID [2022-04-27 11:22:13,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {65207#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; {65207#false} is VALID [2022-04-27 11:22:13,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {65207#false} assume !(~y~0 % 4294967296 > 0); {65207#false} is VALID [2022-04-27 11:22:13,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {65207#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65207#false} is VALID [2022-04-27 11:22:13,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {65207#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65207#false} is VALID [2022-04-27 11:22:13,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {65390#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {65207#false} is VALID [2022-04-27 11:22:13,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {65394#(< 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; {65390#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:22:13,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {65398#(< 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; {65394#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:22:13,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {65402#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {65398#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:22:13,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {65402#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {65402#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:22:13,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {65409#(< 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; {65402#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:22:13,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {65413#(< 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; {65409#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:22:13,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {65417#(< 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; {65413#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:22:13,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {65421#(< 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; {65417#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:22:13,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {65425#(< 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; {65421#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:22:13,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {65429#(< 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; {65425#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:22:13,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {65433#(< 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; {65429#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:22:13,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {65437#(< 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; {65433#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:22:13,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {65441#(< 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; {65437#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:22:13,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {65445#(< 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; {65441#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:22:13,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {65449#(< 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; {65445#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:22:13,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {65453#(< 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; {65449#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:22:13,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {65457#(< 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; {65453#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:22:13,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {65461#(< 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; {65457#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:22:13,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {65206#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65461#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-27 11:22:13,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {65206#true} call #t~ret17 := main(); {65206#true} is VALID [2022-04-27 11:22:13,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65206#true} {65206#true} #94#return; {65206#true} is VALID [2022-04-27 11:22:13,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {65206#true} assume true; {65206#true} is VALID [2022-04-27 11:22:13,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {65206#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65206#true} is VALID [2022-04-27 11:22:13,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {65206#true} call ULTIMATE.init(); {65206#true} is VALID [2022-04-27 11:22:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:22:13,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022701239] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:22:13,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:22:13,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-27 11:22:13,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174829186] [2022-04-27 11:22:13,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:22:13,299 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.375) internal successors, (55), 39 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-27 11:22:13,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:22:13,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.375) internal successors, (55), 39 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:13,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:22:13,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-27 11:22:13,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:22:13,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-27 11:22:13,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1246, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 11:22:13,337 INFO L87 Difference]: Start difference. First operand 935 states and 1366 transitions. Second operand has 40 states, 40 states have (on average 1.375) internal successors, (55), 39 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:39,610 WARN L232 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:22:59,139 WARN L232 SmtUtils]: Spent 13.21s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:23:19,132 WARN L232 SmtUtils]: Spent 9.97s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:23:37,258 WARN L232 SmtUtils]: Spent 12.12s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:23:53,285 WARN L232 SmtUtils]: Spent 6.89s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:24:02,982 WARN L232 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:24:13,458 WARN L232 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:24:29,813 WARN L232 SmtUtils]: Spent 5.94s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:25:08,490 WARN L232 SmtUtils]: Spent 14.96s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:25:41,473 WARN L232 SmtUtils]: Spent 7.77s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:25:54,590 WARN L232 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:26:24,781 WARN L232 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)