/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:07:50,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:07:50,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:07:50,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:07:50,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:07:50,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:07:50,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:07:50,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:07:50,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:07:50,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:07:50,166 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:07:50,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:07:50,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:07:50,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:07:50,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:07:50,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:07:50,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:07:50,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:07:50,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:07:50,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:07:50,189 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:07:50,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:07:50,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:07:50,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:07:50,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:07:50,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:07:50,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:07:50,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:07:50,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:07:50,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:07:50,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:07:50,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:07:50,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:07:50,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:07:50,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:07:50,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:07:50,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:07:50,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:07:50,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:07:50,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:07:50,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:07:50,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:07:50,211 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:07:50,249 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:07:50,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:07:50,249 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:07:50,250 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:07:50,250 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:07:50,250 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:07:50,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:07:50,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:07:50,251 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:07:50,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:07:50,252 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:07:50,252 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:07:50,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:07:50,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:07:50,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:07:50,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:07:50,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:07:50,253 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:07:50,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:07:50,254 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:07:50,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:07:50,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:07:50,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:07:50,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:07:50,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:07:50,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:07:50,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:07:50,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:07:50,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:07:50,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:07:50,256 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:07:50,256 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:07:50,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:07:50,257 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:07:50,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:07:50,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:07:50,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:07:50,473 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:07:50,473 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:07:50,475 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-04-27 11:07:50,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bf31918/a74efa6cebb34553a3db063396f55960/FLAG61f3f23dc [2022-04-27 11:07:50,930 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:07:50,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-04-27 11:07:50,944 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bf31918/a74efa6cebb34553a3db063396f55960/FLAG61f3f23dc [2022-04-27 11:07:51,331 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bf31918/a74efa6cebb34553a3db063396f55960 [2022-04-27 11:07:51,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:07:51,334 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:07:51,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:07:51,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:07:51,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:07:51,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:07:51" (1/1) ... [2022-04-27 11:07:51,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e765e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:51, skipping insertion in model container [2022-04-27 11:07:51,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:07:51" (1/1) ... [2022-04-27 11:07:51,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:07:51,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:07:51,482 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c[368,381] [2022-04-27 11:07:51,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:07:51,511 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:07:51,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c[368,381] [2022-04-27 11:07:51,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:07:51,533 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:07:51,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:51 WrapperNode [2022-04-27 11:07:51,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:07:51,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:07:51,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:07:51,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:07:51,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:51" (1/1) ... [2022-04-27 11:07:51,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:51" (1/1) ... [2022-04-27 11:07:51,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:51" (1/1) ... [2022-04-27 11:07:51,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:51" (1/1) ... [2022-04-27 11:07:51,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:51" (1/1) ... [2022-04-27 11:07:51,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:51" (1/1) ... [2022-04-27 11:07:51,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:51" (1/1) ... [2022-04-27 11:07:51,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:07:51,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:07:51,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:07:51,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:07:51,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:51" (1/1) ... [2022-04-27 11:07:51,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:07:51,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:07:51,589 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:07:51,610 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:07:51,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:07:51,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:07:51,644 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:07:51,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:07:51,646 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:07:51,646 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:07:51,646 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:07:51,647 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:07:51,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:07:51,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 11:07:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:07:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:07:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:07:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:07:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:07:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:07:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:07:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:07:51,695 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:07:51,696 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:07:51,877 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:07:51,882 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:07:51,883 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 11:07:51,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:07:51 BoogieIcfgContainer [2022-04-27 11:07:51,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:07:51,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:07:51,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:07:51,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:07:51,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:07:51" (1/3) ... [2022-04-27 11:07:51,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2844dce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:07:51, skipping insertion in model container [2022-04-27 11:07:51,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:07:51" (2/3) ... [2022-04-27 11:07:51,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2844dce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:07:51, skipping insertion in model container [2022-04-27 11:07:51,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:07:51" (3/3) ... [2022-04-27 11:07:51,903 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de20.c [2022-04-27 11:07:51,928 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:07:51,928 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:07:52,004 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:07:52,010 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@45dfc32a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a2cdda1 [2022-04-27 11:07:52,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:07:52,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:07:52,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 11:07:52,027 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:07:52,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:07:52,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:07:52,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:07:52,041 INFO L85 PathProgramCache]: Analyzing trace with hash 449096471, now seen corresponding path program 1 times [2022-04-27 11:07:52,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:07:52,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587409286] [2022-04-27 11:07:52,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:07:52,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:07:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:52,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:07:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:52,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-27 11:07:52,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 11:07:52,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-27 11:07:52,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:07:52,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-27 11:07:52,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 11:07:52,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-27 11:07:52,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret9 := main(); {24#true} is VALID [2022-04-27 11:07:52,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:07:52,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:07:52,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} ~z~0 := ~y~0; {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:07:52,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:07:52,437 INFO L272 TraceCheckUtils]: 9: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:07:52,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {31#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:07:52,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-27 11:07:52,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-27 11:07:52,438 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:07:52,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:07:52,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587409286] [2022-04-27 11:07:52,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587409286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:07:52,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:07:52,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:07:52,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104087059] [2022-04-27 11:07:52,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:07:52,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 11:07:52,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:07:52,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:52,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:07:52,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:07:52,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:07:52,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:07:52,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:07:52,508 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:52,830 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-04-27 11:07:52,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:07:52,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 11:07:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:07:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:52,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-27 11:07:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-27 11:07:52,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-27 11:07:52,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:07:52,921 INFO L225 Difference]: With dead ends: 46 [2022-04-27 11:07:52,921 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 11:07:52,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:07:52,926 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:07:52,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 37 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:07:52,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 11:07:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 11:07:52,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:07:52,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:52,952 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:52,953 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:52,955 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 11:07:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:07:52,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:07:52,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:07:52,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:07:52,956 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:07:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:52,958 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 11:07:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:07:52,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:07:52,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:07:52,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:07:52,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:07:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 11:07:52,961 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-27 11:07:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:07:52,961 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 11:07:52,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:07:52,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:07:52,963 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:07:52,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:07:52,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:07:52,963 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:07:52,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:07:52,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1071583787, now seen corresponding path program 1 times [2022-04-27 11:07:52,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:07:52,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455418455] [2022-04-27 11:07:52,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:07:52,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:07:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:07:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:53,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {165#true} is VALID [2022-04-27 11:07:53,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-27 11:07:53,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165#true} {165#true} #50#return; {165#true} is VALID [2022-04-27 11:07:53,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {165#true} call ULTIMATE.init(); {172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:07:53,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {165#true} is VALID [2022-04-27 11:07:53,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-27 11:07:53,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165#true} {165#true} #50#return; {165#true} is VALID [2022-04-27 11:07:53,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {165#true} call #t~ret9 := main(); {165#true} is VALID [2022-04-27 11:07:53,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {170#(= main_~y~0 0)} is VALID [2022-04-27 11:07:53,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {170#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {170#(= main_~y~0 0)} is VALID [2022-04-27 11:07:53,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {170#(= main_~y~0 0)} ~z~0 := ~y~0; {171#(= main_~z~0 0)} is VALID [2022-04-27 11:07:53,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {166#false} is VALID [2022-04-27 11:07:53,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#false} assume !(~z~0 % 4294967296 > 0); {166#false} is VALID [2022-04-27 11:07:53,020 INFO L272 TraceCheckUtils]: 10: Hoare triple {166#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {166#false} is VALID [2022-04-27 11:07:53,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#false} ~cond := #in~cond; {166#false} is VALID [2022-04-27 11:07:53,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#false} assume 0 == ~cond; {166#false} is VALID [2022-04-27 11:07:53,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#false} assume !false; {166#false} is VALID [2022-04-27 11:07:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:07:53,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:07:53,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455418455] [2022-04-27 11:07:53,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455418455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:07:53,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:07:53,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:07:53,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291803875] [2022-04-27 11:07:53,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:07:53,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:07:53,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:07:53,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:53,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:07:53,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:07:53,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:07:53,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:07:53,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:07:53,038 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:53,114 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 11:07:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:07:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:07:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:07:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 11:07:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 11:07:53,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-27 11:07:53,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:07:53,143 INFO L225 Difference]: With dead ends: 23 [2022-04-27 11:07:53,144 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 11:07:53,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:07:53,151 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:07:53,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 25 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:07:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 11:07:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 11:07:53,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:07:53,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:53,161 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:53,161 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:53,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:53,162 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 11:07:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 11:07:53,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:07:53,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:07:53,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 11:07:53,163 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 11:07:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:53,164 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 11:07:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 11:07:53,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:07:53,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:07:53,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:07:53,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:07:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 11:07:53,166 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2022-04-27 11:07:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:07:53,167 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 11:07:53,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 11:07:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:07:53,168 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:07:53,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:07:53,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:07:53,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:07:53,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:07:53,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1025479988, now seen corresponding path program 1 times [2022-04-27 11:07:53,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:07:53,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225441925] [2022-04-27 11:07:53,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:07:53,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:07:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:53,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:07:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:53,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {269#true} is VALID [2022-04-27 11:07:53,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-27 11:07:53,255 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {269#true} {269#true} #50#return; {269#true} is VALID [2022-04-27 11:07:53,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:07:53,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {269#true} is VALID [2022-04-27 11:07:53,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-27 11:07:53,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {269#true} {269#true} #50#return; {269#true} is VALID [2022-04-27 11:07:53,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {269#true} call #t~ret9 := main(); {269#true} is VALID [2022-04-27 11:07:53,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {269#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {274#(= main_~y~0 0)} is VALID [2022-04-27 11:07:53,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:07:53,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:07:53,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {276#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:07:53,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {276#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {270#false} is VALID [2022-04-27 11:07:53,261 INFO L272 TraceCheckUtils]: 10: Hoare triple {270#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {270#false} is VALID [2022-04-27 11:07:53,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {270#false} ~cond := #in~cond; {270#false} is VALID [2022-04-27 11:07:53,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {270#false} assume 0 == ~cond; {270#false} is VALID [2022-04-27 11:07:53,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-04-27 11:07:53,285 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:07:53,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:07:53,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225441925] [2022-04-27 11:07:53,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225441925] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:07:53,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725122863] [2022-04-27 11:07:53,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:07:53,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:07:53,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:07:53,295 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:07:53,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 11:07:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:53,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:07:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:53,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:07:53,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {269#true} is VALID [2022-04-27 11:07:53,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {269#true} is VALID [2022-04-27 11:07:53,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-27 11:07:53,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {269#true} {269#true} #50#return; {269#true} is VALID [2022-04-27 11:07:53,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {269#true} call #t~ret9 := main(); {269#true} is VALID [2022-04-27 11:07:53,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {269#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {274#(= main_~y~0 0)} is VALID [2022-04-27 11:07:53,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:07:53,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:07:53,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {305#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:07:53,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {305#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {270#false} is VALID [2022-04-27 11:07:53,655 INFO L272 TraceCheckUtils]: 10: Hoare triple {270#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {270#false} is VALID [2022-04-27 11:07:53,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {270#false} ~cond := #in~cond; {270#false} is VALID [2022-04-27 11:07:53,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {270#false} assume 0 == ~cond; {270#false} is VALID [2022-04-27 11:07:53,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-04-27 11:07:53,656 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:07:53,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:07:53,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-04-27 11:07:53,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {270#false} assume 0 == ~cond; {270#false} is VALID [2022-04-27 11:07:53,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {270#false} ~cond := #in~cond; {270#false} is VALID [2022-04-27 11:07:53,747 INFO L272 TraceCheckUtils]: 10: Hoare triple {270#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {270#false} is VALID [2022-04-27 11:07:53,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {333#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {270#false} is VALID [2022-04-27 11:07:53,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {333#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:07:53,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {337#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:07:53,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {344#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {337#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:07:53,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {269#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {344#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:07:53,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {269#true} call #t~ret9 := main(); {269#true} is VALID [2022-04-27 11:07:53,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {269#true} {269#true} #50#return; {269#true} is VALID [2022-04-27 11:07:53,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-27 11:07:53,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {269#true} is VALID [2022-04-27 11:07:53,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {269#true} is VALID [2022-04-27 11:07:53,751 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:07:53,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725122863] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:07:53,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:07:53,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-27 11:07:53,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123288445] [2022-04-27 11:07:53,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:07:53,753 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:07:53,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:07:53,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:53,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:07:53,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:07:53,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:07:53,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:07:53,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:07:53,773 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:54,087 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 11:07:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:07:54,087 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:07:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:07:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-27 11:07:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-27 11:07:54,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2022-04-27 11:07:54,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:07:54,139 INFO L225 Difference]: With dead ends: 35 [2022-04-27 11:07:54,139 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 11:07:54,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:07:54,141 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:07:54,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 39 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:07:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 11:07:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2022-04-27 11:07:54,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:07:54,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:54,161 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:54,161 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:54,168 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-27 11:07:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-27 11:07:54,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:07:54,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:07:54,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-27 11:07:54,171 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-27 11:07:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:54,173 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-27 11:07:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-27 11:07:54,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:07:54,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:07:54,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:07:54,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:07:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-27 11:07:54,181 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2022-04-27 11:07:54,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:07:54,181 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-27 11:07:54,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (4), 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:07:54,182 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-27 11:07:54,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 11:07:54,183 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:07:54,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:07:54,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 11:07:54,391 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:07:54,392 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:07:54,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:07:54,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1690613482, now seen corresponding path program 1 times [2022-04-27 11:07:54,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:07:54,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999760033] [2022-04-27 11:07:54,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:07:54,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:07:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:54,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:07:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:54,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {530#true} is VALID [2022-04-27 11:07:54,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#true} assume true; {530#true} is VALID [2022-04-27 11:07:54,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {530#true} {530#true} #50#return; {530#true} is VALID [2022-04-27 11:07:54,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:07:54,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {530#true} is VALID [2022-04-27 11:07:54,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {530#true} assume true; {530#true} is VALID [2022-04-27 11:07:54,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {530#true} {530#true} #50#return; {530#true} is VALID [2022-04-27 11:07:54,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {530#true} call #t~ret9 := main(); {530#true} is VALID [2022-04-27 11:07:54,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {535#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:07:54,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {535#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:07:54,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:07:54,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} ~z~0 := ~y~0; {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:07:54,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {537#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:07:54,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {537#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {537#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:07:54,568 INFO L272 TraceCheckUtils]: 11: Hoare triple {537#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {538#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:07:54,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {538#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {539#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:07:54,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {539#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {531#false} is VALID [2022-04-27 11:07:54,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {531#false} assume !false; {531#false} is VALID [2022-04-27 11:07:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:07:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:07:54,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999760033] [2022-04-27 11:07:54,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999760033] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:07:54,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205509601] [2022-04-27 11:07:54,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:07:54,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:07:54,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:07:54,572 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:07:54,573 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:07:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:54,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 11:07:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:54,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:07:54,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {530#true} is VALID [2022-04-27 11:07:54,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {530#true} is VALID [2022-04-27 11:07:54,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {530#true} assume true; {530#true} is VALID [2022-04-27 11:07:54,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {530#true} {530#true} #50#return; {530#true} is VALID [2022-04-27 11:07:54,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {530#true} call #t~ret9 := main(); {530#true} is VALID [2022-04-27 11:07:54,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {535#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:07:54,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {535#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:07:54,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:07:54,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} ~z~0 := ~y~0; {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:07:54,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {535#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:07:54,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {535#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {535#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:07:54,726 INFO L272 TraceCheckUtils]: 11: Hoare triple {535#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {577#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:07:54,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {577#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {581#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:07:54,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {581#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {531#false} is VALID [2022-04-27 11:07:54,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {531#false} assume !false; {531#false} is VALID [2022-04-27 11:07:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:07:54,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:07:54,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {531#false} assume !false; {531#false} is VALID [2022-04-27 11:07:54,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {581#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {531#false} is VALID [2022-04-27 11:07:54,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {577#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {581#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:07:54,856 INFO L272 TraceCheckUtils]: 11: Hoare triple {597#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {577#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:07:54,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {597#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {597#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:07:54,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {597#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:07:54,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} ~z~0 := ~y~0; {604#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:07:54,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {604#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:07:54,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {597#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {604#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:07:54,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {597#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:07:54,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {530#true} call #t~ret9 := main(); {530#true} is VALID [2022-04-27 11:07:54,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {530#true} {530#true} #50#return; {530#true} is VALID [2022-04-27 11:07:54,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {530#true} assume true; {530#true} is VALID [2022-04-27 11:07:54,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {530#true} is VALID [2022-04-27 11:07:54,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {530#true} is VALID [2022-04-27 11:07:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:07:54,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205509601] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:07:54,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:07:54,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2022-04-27 11:07:54,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711178461] [2022-04-27 11:07:54,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:07:54,872 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:07:54,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:07:54,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:54,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:07:54,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 11:07:54,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:07:54,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 11:07:54,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:07:54,902 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:55,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:55,244 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 11:07:55,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:07:55,244 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:07:55,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:07:55,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-27 11:07:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-27 11:07:55,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 26 transitions. [2022-04-27 11:07:55,271 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:07:55,272 INFO L225 Difference]: With dead ends: 28 [2022-04-27 11:07:55,272 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 11:07:55,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:07:55,273 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:07:55,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 53 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:07:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 11:07:55,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-27 11:07:55,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:07:55,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:55,310 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:55,311 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:55,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:55,313 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-27 11:07:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-27 11:07:55,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:07:55,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:07:55,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 11:07:55,314 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 11:07:55,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:55,316 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-27 11:07:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-27 11:07:55,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:07:55,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:07:55,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:07:55,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:07:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-27 11:07:55,321 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2022-04-27 11:07:55,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:07:55,321 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-27 11:07:55,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 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:07:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-27 11:07:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 11:07:55,323 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:07:55,323 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:07:55,350 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:07:55,539 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:07:55,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:07:55,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:07:55,540 INFO L85 PathProgramCache]: Analyzing trace with hash -834915316, now seen corresponding path program 2 times [2022-04-27 11:07:55,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:07:55,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665297069] [2022-04-27 11:07:55,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:07:55,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:07:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:55,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:07:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:55,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {769#true} is VALID [2022-04-27 11:07:55,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-27 11:07:55,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {769#true} {769#true} #50#return; {769#true} is VALID [2022-04-27 11:07:55,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:07:55,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {769#true} is VALID [2022-04-27 11:07:55,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-27 11:07:55,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #50#return; {769#true} is VALID [2022-04-27 11:07:55,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret9 := main(); {769#true} is VALID [2022-04-27 11:07:55,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {774#(= main_~y~0 0)} is VALID [2022-04-27 11:07:55,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:07:55,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:07:55,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {776#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:07:55,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {776#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {777#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:07:55,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {777#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {770#false} is VALID [2022-04-27 11:07:55,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {770#false} assume !(~z~0 % 4294967296 > 0); {770#false} is VALID [2022-04-27 11:07:55,658 INFO L272 TraceCheckUtils]: 12: Hoare triple {770#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {770#false} is VALID [2022-04-27 11:07:55,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#false} ~cond := #in~cond; {770#false} is VALID [2022-04-27 11:07:55,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {770#false} assume 0 == ~cond; {770#false} is VALID [2022-04-27 11:07:55,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-27 11:07:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:07:55,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:07:55,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665297069] [2022-04-27 11:07:55,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665297069] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:07:55,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341702677] [2022-04-27 11:07:55,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:07:55,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:07:55,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:07:55,660 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:07:55,661 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:07:55,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:07:55,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:07:55,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:07:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:55,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:07:55,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {769#true} is VALID [2022-04-27 11:07:55,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {769#true} is VALID [2022-04-27 11:07:55,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-27 11:07:55,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #50#return; {769#true} is VALID [2022-04-27 11:07:55,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret9 := main(); {769#true} is VALID [2022-04-27 11:07:55,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {774#(= main_~y~0 0)} is VALID [2022-04-27 11:07:55,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:07:55,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:07:55,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {776#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:07:55,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {776#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {777#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:07:55,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {777#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {812#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:07:55,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {812#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {770#false} is VALID [2022-04-27 11:07:55,923 INFO L272 TraceCheckUtils]: 12: Hoare triple {770#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {770#false} is VALID [2022-04-27 11:07:55,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#false} ~cond := #in~cond; {770#false} is VALID [2022-04-27 11:07:55,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {770#false} assume 0 == ~cond; {770#false} is VALID [2022-04-27 11:07:55,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-27 11:07:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:07:55,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:07:56,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-27 11:07:56,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {770#false} assume 0 == ~cond; {770#false} is VALID [2022-04-27 11:07:56,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#false} ~cond := #in~cond; {770#false} is VALID [2022-04-27 11:07:56,039 INFO L272 TraceCheckUtils]: 12: Hoare triple {770#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {770#false} is VALID [2022-04-27 11:07:56,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {840#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {770#false} is VALID [2022-04-27 11:07:56,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {844#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {840#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:07:56,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {848#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {844#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:07:56,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {852#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {848#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:07:56,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {852#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {852#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:07:56,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {859#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {852#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:07:56,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {859#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:07:56,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret9 := main(); {769#true} is VALID [2022-04-27 11:07:56,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #50#return; {769#true} is VALID [2022-04-27 11:07:56,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-27 11:07:56,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {769#true} is VALID [2022-04-27 11:07:56,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {769#true} is VALID [2022-04-27 11:07:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:07:56,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341702677] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:07:56,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:07:56,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-04-27 11:07:56,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459840292] [2022-04-27 11:07:56,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:07:56,045 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 11:07:56,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:07:56,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:56,070 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:07:56,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:07:56,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:07:56,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:07:56,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:07:56,072 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:56,692 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 11:07:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 11:07:56,692 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 11:07:56,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:07:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 47 transitions. [2022-04-27 11:07:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 47 transitions. [2022-04-27 11:07:56,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 47 transitions. [2022-04-27 11:07:56,746 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:07:56,747 INFO L225 Difference]: With dead ends: 38 [2022-04-27 11:07:56,747 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 11:07:56,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2022-04-27 11:07:56,748 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:07:56,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 46 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:07:56,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 11:07:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-04-27 11:07:56,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:07:56,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:56,786 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:56,786 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:56,787 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 11:07:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 11:07:56,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:07:56,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:07:56,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-27 11:07:56,788 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-27 11:07:56,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:56,789 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 11:07:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 11:07:56,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:07:56,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:07:56,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:07:56,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:07:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:56,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-27 11:07:56,791 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-04-27 11:07:56,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:07:56,791 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-27 11:07:56,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (4), 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:07:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 11:07:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:07:56,792 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:07:56,792 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:07:56,817 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:07:57,015 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:07:57,015 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:07:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:07:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1016701897, now seen corresponding path program 3 times [2022-04-27 11:07:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:07:57,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926012548] [2022-04-27 11:07:57,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:07:57,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:07:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:57,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:07:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:57,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {1081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-27 11:07:57,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-27 11:07:57,193 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1070#true} {1070#true} #50#return; {1070#true} is VALID [2022-04-27 11:07:57,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:07:57,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-27 11:07:57,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-27 11:07:57,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #50#return; {1070#true} is VALID [2022-04-27 11:07:57,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret9 := main(); {1070#true} is VALID [2022-04-27 11:07:57,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1075#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:07:57,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {1075#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1076#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:07:57,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {1076#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:07:57,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:07:57,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} ~z~0 := ~y~0; {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:07:57,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1076#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:07:57,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {1076#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1078#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:07:57,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {1078#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {1078#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:07:57,201 INFO L272 TraceCheckUtils]: 13: Hoare triple {1078#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1079#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:07:57,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1080#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:07:57,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {1080#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1071#false} is VALID [2022-04-27 11:07:57,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-27 11:07:57,203 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:07:57,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:07:57,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926012548] [2022-04-27 11:07:57,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926012548] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:07:57,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238857480] [2022-04-27 11:07:57,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:07:57,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:07:57,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:07:57,208 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:07:57,237 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:07:57,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 11:07:57,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:07:57,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 11:07:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:57,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:07:57,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1070#true} is VALID [2022-04-27 11:07:57,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-27 11:07:57,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-27 11:07:57,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #50#return; {1070#true} is VALID [2022-04-27 11:07:57,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret9 := main(); {1070#true} is VALID [2022-04-27 11:07:57,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1075#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:07:57,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {1075#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1076#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:07:57,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {1076#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:07:57,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:07:57,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} ~z~0 := ~y~0; {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:07:57,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1076#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:07:57,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {1076#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1075#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:07:57,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {1075#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {1075#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:07:57,386 INFO L272 TraceCheckUtils]: 13: Hoare triple {1075#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1124#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:07:57,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {1124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:07:57,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {1128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1071#false} is VALID [2022-04-27 11:07:57,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-27 11:07:57,387 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:07:57,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:07:57,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-27 11:07:57,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {1128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1071#false} is VALID [2022-04-27 11:07:57,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {1124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:07:57,525 INFO L272 TraceCheckUtils]: 13: Hoare triple {1144#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1124#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:07:57,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {1144#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1144#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:07:57,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {1151#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1144#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:07:57,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {1155#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1151#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:07:57,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {1155#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {1155#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:07:57,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {1155#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1155#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:07:57,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {1151#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1155#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:07:57,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {1144#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1151#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:07:57,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1144#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:07:57,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret9 := main(); {1070#true} is VALID [2022-04-27 11:07:57,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #50#return; {1070#true} is VALID [2022-04-27 11:07:57,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-27 11:07:57,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-27 11:07:57,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1070#true} is VALID [2022-04-27 11:07:57,532 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:07:57,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238857480] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:07:57,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:07:57,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2022-04-27 11:07:57,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544089464] [2022-04-27 11:07:57,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:07:57,533 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:07:57,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:07:57,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:57,564 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:07:57,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:07:57,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:07:57,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:07:57,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:07:57,566 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:57,873 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-27 11:07:57,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:07:57,874 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:07:57,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:07:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2022-04-27 11:07:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2022-04-27 11:07:57,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 28 transitions. [2022-04-27 11:07:57,903 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:07:57,903 INFO L225 Difference]: With dead ends: 31 [2022-04-27 11:07:57,903 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 11:07:57,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:07:57,905 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:07:57,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 43 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:07:57,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 11:07:57,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-27 11:07:57,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:07:57,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:57,956 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:57,957 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:57,959 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 11:07:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 11:07:57,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:07:57,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:07:57,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-27 11:07:57,960 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-27 11:07:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:07:57,962 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 11:07:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 11:07:57,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:07:57,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:07:57,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:07:57,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:07:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-27 11:07:57,963 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 17 [2022-04-27 11:07:57,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:07:57,965 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-27 11:07:57,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 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:07:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 11:07:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:07:57,966 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:07:57,966 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:07:57,993 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:07:58,175 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:07:58,176 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:07:58,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:07:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1601169482, now seen corresponding path program 4 times [2022-04-27 11:07:58,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:07:58,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964951740] [2022-04-27 11:07:58,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:07:58,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:07:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:58,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:07:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:58,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {1354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1343#true} is VALID [2022-04-27 11:07:58,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-27 11:07:58,294 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1343#true} {1343#true} #50#return; {1343#true} is VALID [2022-04-27 11:07:58,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:07:58,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {1354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1343#true} is VALID [2022-04-27 11:07:58,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-27 11:07:58,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #50#return; {1343#true} is VALID [2022-04-27 11:07:58,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret9 := main(); {1343#true} is VALID [2022-04-27 11:07:58,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1348#(= main_~y~0 0)} is VALID [2022-04-27 11:07:58,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {1348#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:07:58,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {1349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:07:58,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {1350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:07:58,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:07:58,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1352#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:07:58,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {1352#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1353#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:07:58,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {1353#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1344#false} is VALID [2022-04-27 11:07:58,305 INFO L272 TraceCheckUtils]: 13: Hoare triple {1344#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1344#false} is VALID [2022-04-27 11:07:58,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {1344#false} ~cond := #in~cond; {1344#false} is VALID [2022-04-27 11:07:58,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {1344#false} assume 0 == ~cond; {1344#false} is VALID [2022-04-27 11:07:58,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2022-04-27 11:07:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:07:58,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:07:58,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964951740] [2022-04-27 11:07:58,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964951740] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:07:58,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008941280] [2022-04-27 11:07:58,312 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:07:58,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:07:58,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:07:58,316 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:07:58,345 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:07:58,361 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:07:58,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:07:58,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 11:07:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:07:58,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:07:58,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2022-04-27 11:07:58,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1343#true} is VALID [2022-04-27 11:07:58,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-27 11:07:58,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #50#return; {1343#true} is VALID [2022-04-27 11:07:58,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret9 := main(); {1343#true} is VALID [2022-04-27 11:07:58,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1348#(= main_~y~0 0)} is VALID [2022-04-27 11:07:58,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {1348#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:07:58,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {1349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:07:58,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {1350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:07:58,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:07:58,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1352#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:07:58,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {1352#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1391#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:07:58,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {1391#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1344#false} is VALID [2022-04-27 11:07:58,595 INFO L272 TraceCheckUtils]: 13: Hoare triple {1344#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1344#false} is VALID [2022-04-27 11:07:58,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {1344#false} ~cond := #in~cond; {1344#false} is VALID [2022-04-27 11:07:58,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {1344#false} assume 0 == ~cond; {1344#false} is VALID [2022-04-27 11:07:58,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2022-04-27 11:07:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:07:58,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:07:58,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2022-04-27 11:07:58,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {1344#false} assume 0 == ~cond; {1344#false} is VALID [2022-04-27 11:07:58,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {1344#false} ~cond := #in~cond; {1344#false} is VALID [2022-04-27 11:07:58,743 INFO L272 TraceCheckUtils]: 13: Hoare triple {1344#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1344#false} is VALID [2022-04-27 11:07:58,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {1419#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1344#false} is VALID [2022-04-27 11:07:58,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {1423#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1419#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:07:58,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {1427#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {1423#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:07:58,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {1427#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1427#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:07:58,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {1434#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1427#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:07:58,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {1438#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1434#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:07:58,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {1442#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1438#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:07:58,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1442#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:07:58,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret9 := main(); {1343#true} is VALID [2022-04-27 11:07:58,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #50#return; {1343#true} is VALID [2022-04-27 11:07:58,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-27 11:07:58,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1343#true} is VALID [2022-04-27 11:07:58,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2022-04-27 11:07:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:07:58,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008941280] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:07:58,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:07:58,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-27 11:07:58,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819870435] [2022-04-27 11:07:58,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:07:58,766 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:07:58,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:07:58,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:07:58,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:07:58,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:07:58,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:07:58,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:07:58,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:07:58,791 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:00,195 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2022-04-27 11:08:00,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-27 11:08:00,196 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:08:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:08:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 79 transitions. [2022-04-27 11:08:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 79 transitions. [2022-04-27 11:08:00,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 79 transitions. [2022-04-27 11:08:00,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:00,286 INFO L225 Difference]: With dead ends: 59 [2022-04-27 11:08:00,286 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 11:08:00,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=434, Invalid=1372, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 11:08:00,287 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 100 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:08:00,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 47 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:08:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 11:08:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 29. [2022-04-27 11:08:00,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:08:00,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:00,349 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:00,349 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:00,351 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-27 11:08:00,351 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-27 11:08:00,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:00,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:00,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-27 11:08:00,352 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-27 11:08:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:00,353 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-27 11:08:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-27 11:08:00,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:00,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:00,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:08:00,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:08:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:00,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-04-27 11:08:00,355 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 17 [2022-04-27 11:08:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:08:00,355 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-04-27 11:08:00,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (4), 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:08:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-27 11:08:00,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 11:08:00,356 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:08:00,356 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:08:00,392 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:08:00,589 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:08:00,590 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:08:00,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:08:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1418492661, now seen corresponding path program 5 times [2022-04-27 11:08:00,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:08:00,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51620143] [2022-04-27 11:08:00,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:00,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:08:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:00,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:08:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:00,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {1788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1777#true} is VALID [2022-04-27 11:08:00,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {1777#true} assume true; {1777#true} is VALID [2022-04-27 11:08:00,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1777#true} {1777#true} #50#return; {1777#true} is VALID [2022-04-27 11:08:00,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:08:00,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {1788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1777#true} is VALID [2022-04-27 11:08:00,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {1777#true} assume true; {1777#true} is VALID [2022-04-27 11:08:00,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} #50#return; {1777#true} is VALID [2022-04-27 11:08:00,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {1777#true} call #t~ret9 := main(); {1777#true} is VALID [2022-04-27 11:08:00,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {1777#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1782#(= main_~y~0 0)} is VALID [2022-04-27 11:08:00,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {1782#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:00,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {1783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:00,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:00,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1785#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:08:00,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {1785#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1786#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:08:00,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {1786#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1787#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:08:00,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {1787#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1778#false} is VALID [2022-04-27 11:08:00,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {1778#false} assume !(~z~0 % 4294967296 > 0); {1778#false} is VALID [2022-04-27 11:08:00,713 INFO L272 TraceCheckUtils]: 14: Hoare triple {1778#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1778#false} is VALID [2022-04-27 11:08:00,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {1778#false} ~cond := #in~cond; {1778#false} is VALID [2022-04-27 11:08:00,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {1778#false} assume 0 == ~cond; {1778#false} is VALID [2022-04-27 11:08:00,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {1778#false} assume !false; {1778#false} is VALID [2022-04-27 11:08:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:00,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:08:00,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51620143] [2022-04-27 11:08:00,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51620143] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:08:00,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647564945] [2022-04-27 11:08:00,714 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:08:00,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:00,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:08:00,715 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:08:00,744 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:08:00,768 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-04-27 11:08:00,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:08:00,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 11:08:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:00,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:08:01,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1777#true} is VALID [2022-04-27 11:08:01,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {1777#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1777#true} is VALID [2022-04-27 11:08:01,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {1777#true} assume true; {1777#true} is VALID [2022-04-27 11:08:01,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} #50#return; {1777#true} is VALID [2022-04-27 11:08:01,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {1777#true} call #t~ret9 := main(); {1777#true} is VALID [2022-04-27 11:08:01,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {1777#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1782#(= main_~y~0 0)} is VALID [2022-04-27 11:08:01,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {1782#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:01,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {1783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:01,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:01,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1785#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:08:01,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {1785#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1786#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:08:01,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {1786#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1787#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:08:01,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {1787#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1828#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:08:01,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {1828#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {1778#false} is VALID [2022-04-27 11:08:01,008 INFO L272 TraceCheckUtils]: 14: Hoare triple {1778#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1778#false} is VALID [2022-04-27 11:08:01,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {1778#false} ~cond := #in~cond; {1778#false} is VALID [2022-04-27 11:08:01,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {1778#false} assume 0 == ~cond; {1778#false} is VALID [2022-04-27 11:08:01,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {1778#false} assume !false; {1778#false} is VALID [2022-04-27 11:08:01,008 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:08:01,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:08:01,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {1778#false} assume !false; {1778#false} is VALID [2022-04-27 11:08:01,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {1778#false} assume 0 == ~cond; {1778#false} is VALID [2022-04-27 11:08:01,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {1778#false} ~cond := #in~cond; {1778#false} is VALID [2022-04-27 11:08:01,182 INFO L272 TraceCheckUtils]: 14: Hoare triple {1778#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1778#false} is VALID [2022-04-27 11:08:01,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {1856#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1778#false} is VALID [2022-04-27 11:08:01,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {1860#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1856#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:08:01,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {1864#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1860#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:08:01,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {1868#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1864#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:08:01,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {1872#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {1868#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:08:01,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {1872#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1872#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:08:01,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {1879#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1872#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:08:01,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {1883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1879#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:08:01,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {1777#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:08:01,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {1777#true} call #t~ret9 := main(); {1777#true} is VALID [2022-04-27 11:08:01,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} #50#return; {1777#true} is VALID [2022-04-27 11:08:01,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {1777#true} assume true; {1777#true} is VALID [2022-04-27 11:08:01,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {1777#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1777#true} is VALID [2022-04-27 11:08:01,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1777#true} is VALID [2022-04-27 11:08:01,191 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:08:01,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647564945] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:08:01,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:08:01,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-04-27 11:08:01,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153010837] [2022-04-27 11:08:01,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:08:01,192 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 11:08:01,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:08:01,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:01,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:01,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 11:08:01,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:08:01,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 11:08:01,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:08:01,216 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:02,853 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-27 11:08:02,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 11:08:02,854 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 11:08:02,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:08:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 62 transitions. [2022-04-27 11:08:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 62 transitions. [2022-04-27 11:08:02,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 62 transitions. [2022-04-27 11:08:02,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:02,932 INFO L225 Difference]: With dead ends: 57 [2022-04-27 11:08:02,932 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 11:08:02,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 11:08:02,933 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:08:02,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 74 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:08:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 11:08:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-04-27 11:08:03,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:08:03,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:03,031 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:03,031 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:03,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:03,032 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-27 11:08:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-27 11:08:03,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:03,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:03,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-27 11:08:03,033 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-27 11:08:03,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:03,034 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-27 11:08:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-27 11:08:03,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:03,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:03,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:08:03,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:08:03,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-27 11:08:03,036 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 18 [2022-04-27 11:08:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:08:03,036 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-27 11:08:03,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (4), 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:08:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 11:08:03,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 11:08:03,037 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:08:03,037 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:08:03,055 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:08:03,243 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:08:03,244 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:08:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:08:03,244 INFO L85 PathProgramCache]: Analyzing trace with hash -21737866, now seen corresponding path program 6 times [2022-04-27 11:08:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:08:03,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116597564] [2022-04-27 11:08:03,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:03,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:08:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:03,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:08:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:03,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {2214#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2202#true} is VALID [2022-04-27 11:08:03,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {2202#true} assume true; {2202#true} is VALID [2022-04-27 11:08:03,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2202#true} {2202#true} #50#return; {2202#true} is VALID [2022-04-27 11:08:03,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {2202#true} call ULTIMATE.init(); {2214#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:08:03,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {2214#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2202#true} is VALID [2022-04-27 11:08:03,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {2202#true} assume true; {2202#true} is VALID [2022-04-27 11:08:03,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2202#true} {2202#true} #50#return; {2202#true} is VALID [2022-04-27 11:08:03,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {2202#true} call #t~ret9 := main(); {2202#true} is VALID [2022-04-27 11:08:03,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {2202#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2207#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:08:03,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {2207#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2208#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:08:03,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {2208#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2209#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:08:03,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {2209#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:08:03,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:08:03,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} ~z~0 := ~y~0; {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:08:03,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2209#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:08:03,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {2209#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2208#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:08:03,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {2208#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2211#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:08:03,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {2211#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {2211#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:08:03,408 INFO L272 TraceCheckUtils]: 15: Hoare triple {2211#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2212#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:08:03,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {2212#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2213#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:08:03,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {2213#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2203#false} is VALID [2022-04-27 11:08:03,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {2203#false} assume !false; {2203#false} is VALID [2022-04-27 11:08:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:03,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:08:03,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116597564] [2022-04-27 11:08:03,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116597564] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:08:03,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401181817] [2022-04-27 11:08:03,409 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:08:03,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:03,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:08:03,411 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:08:03,437 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:08:03,456 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-27 11:08:03,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:08:03,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 11:08:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:03,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:08:03,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {2202#true} call ULTIMATE.init(); {2202#true} is VALID [2022-04-27 11:08:03,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {2202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2202#true} is VALID [2022-04-27 11:08:03,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {2202#true} assume true; {2202#true} is VALID [2022-04-27 11:08:03,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2202#true} {2202#true} #50#return; {2202#true} is VALID [2022-04-27 11:08:03,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {2202#true} call #t~ret9 := main(); {2202#true} is VALID [2022-04-27 11:08:03,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {2202#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2207#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:08:03,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {2207#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2208#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:08:03,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {2208#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2209#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:08:03,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {2209#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:08:03,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:08:03,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} ~z~0 := ~y~0; {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:08:03,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2209#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:08:03,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {2209#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2208#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:08:03,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {2208#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2207#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:08:03,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {2207#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {2207#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:08:03,639 INFO L272 TraceCheckUtils]: 15: Hoare triple {2207#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2263#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:08:03,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {2263#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2267#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:08:03,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {2267#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2203#false} is VALID [2022-04-27 11:08:03,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {2203#false} assume !false; {2203#false} is VALID [2022-04-27 11:08:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:03,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:08:03,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {2203#false} assume !false; {2203#false} is VALID [2022-04-27 11:08:03,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {2267#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2203#false} is VALID [2022-04-27 11:08:03,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {2263#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2267#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:08:03,811 INFO L272 TraceCheckUtils]: 15: Hoare triple {2283#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2263#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:08:03,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {2283#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2283#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:08:03,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {2290#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2283#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:08:03,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {2294#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2290#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:08:03,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {2298#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2294#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:08:03,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {2298#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} ~z~0 := ~y~0; {2298#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:08:03,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {2298#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2298#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:08:03,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {2294#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2298#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:08:03,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {2290#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2294#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:08:03,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {2283#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2290#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:08:03,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {2202#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2283#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:08:03,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {2202#true} call #t~ret9 := main(); {2202#true} is VALID [2022-04-27 11:08:03,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2202#true} {2202#true} #50#return; {2202#true} is VALID [2022-04-27 11:08:03,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {2202#true} assume true; {2202#true} is VALID [2022-04-27 11:08:03,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {2202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2202#true} is VALID [2022-04-27 11:08:03,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {2202#true} call ULTIMATE.init(); {2202#true} is VALID [2022-04-27 11:08:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:03,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401181817] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:08:03,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:08:03,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2022-04-27 11:08:03,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142265136] [2022-04-27 11:08:03,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:08:03,821 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 11:08:03,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:08:03,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:03,859 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:08:03,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:08:03,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:08:03,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:08:03,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:08:03,860 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:04,455 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-04-27 11:08:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:08:04,455 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 11:08:04,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:08:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-27 11:08:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-27 11:08:04,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 30 transitions. [2022-04-27 11:08:04,488 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:08:04,488 INFO L225 Difference]: With dead ends: 43 [2022-04-27 11:08:04,488 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 11:08:04,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:08:04,489 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:08:04,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 63 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:08:04,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 11:08:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2022-04-27 11:08:04,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:08:04,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:04,603 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:04,603 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:04,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:04,604 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-27 11:08:04,604 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-27 11:08:04,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:04,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:04,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-27 11:08:04,605 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-27 11:08:04,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:04,606 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-27 11:08:04,606 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-27 11:08:04,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:04,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:04,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:08:04,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:08:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-27 11:08:04,607 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 19 [2022-04-27 11:08:04,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:08:04,608 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-27 11:08:04,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 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:08:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-27 11:08:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:08:04,608 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:08:04,608 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:08:04,639 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:08:04,819 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:08:04,819 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:08:04,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:08:04,820 INFO L85 PathProgramCache]: Analyzing trace with hash -639378772, now seen corresponding path program 7 times [2022-04-27 11:08:04,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:08:04,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521768050] [2022-04-27 11:08:04,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:04,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:08:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:04,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:08:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:04,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {2563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2550#true} is VALID [2022-04-27 11:08:04,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-27 11:08:04,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2550#true} {2550#true} #50#return; {2550#true} is VALID [2022-04-27 11:08:04,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:08:04,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {2563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2550#true} is VALID [2022-04-27 11:08:04,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-27 11:08:04,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #50#return; {2550#true} is VALID [2022-04-27 11:08:04,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret9 := main(); {2550#true} is VALID [2022-04-27 11:08:04,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {2550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2555#(= main_~y~0 0)} is VALID [2022-04-27 11:08:04,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {2555#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:04,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {2556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:04,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {2557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:08:04,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:08:04,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2559#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:08:04,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {2559#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2560#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:08:04,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {2560#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2561#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:08:04,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {2561#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2562#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:08:04,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {2562#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2551#false} is VALID [2022-04-27 11:08:04,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {2551#false} assume !(~z~0 % 4294967296 > 0); {2551#false} is VALID [2022-04-27 11:08:04,975 INFO L272 TraceCheckUtils]: 16: Hoare triple {2551#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2551#false} is VALID [2022-04-27 11:08:04,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {2551#false} ~cond := #in~cond; {2551#false} is VALID [2022-04-27 11:08:04,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {2551#false} assume 0 == ~cond; {2551#false} is VALID [2022-04-27 11:08:04,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2022-04-27 11:08:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:04,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:08:04,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521768050] [2022-04-27 11:08:04,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521768050] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:08:04,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572555218] [2022-04-27 11:08:04,976 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:08:04,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:04,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:08:04,977 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:08:04,985 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:08:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:05,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 11:08:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:05,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:08:05,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2550#true} is VALID [2022-04-27 11:08:05,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2550#true} is VALID [2022-04-27 11:08:05,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-27 11:08:05,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #50#return; {2550#true} is VALID [2022-04-27 11:08:05,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret9 := main(); {2550#true} is VALID [2022-04-27 11:08:05,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {2550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2555#(= main_~y~0 0)} is VALID [2022-04-27 11:08:05,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {2555#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:05,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {2556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:05,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {2557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:08:05,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:08:05,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2559#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:08:05,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {2559#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2560#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:08:05,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {2560#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2561#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:08:05,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {2561#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2562#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:08:05,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {2562#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2551#false} is VALID [2022-04-27 11:08:05,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {2551#false} assume !(~z~0 % 4294967296 > 0); {2551#false} is VALID [2022-04-27 11:08:05,247 INFO L272 TraceCheckUtils]: 16: Hoare triple {2551#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2551#false} is VALID [2022-04-27 11:08:05,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {2551#false} ~cond := #in~cond; {2551#false} is VALID [2022-04-27 11:08:05,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {2551#false} assume 0 == ~cond; {2551#false} is VALID [2022-04-27 11:08:05,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2022-04-27 11:08:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:05,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:08:05,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2022-04-27 11:08:05,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {2551#false} assume 0 == ~cond; {2551#false} is VALID [2022-04-27 11:08:05,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {2551#false} ~cond := #in~cond; {2551#false} is VALID [2022-04-27 11:08:05,442 INFO L272 TraceCheckUtils]: 16: Hoare triple {2551#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2551#false} is VALID [2022-04-27 11:08:05,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {2551#false} assume !(~z~0 % 4294967296 > 0); {2551#false} is VALID [2022-04-27 11:08:05,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {2639#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2551#false} is VALID [2022-04-27 11:08:05,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {2643#(not (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2639#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:08:05,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {2647#(not (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2643#(not (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:08:05,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {2651#(not (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2647#(not (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:08:05,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {2655#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} ~z~0 := ~y~0; {2651#(not (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:08:05,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {2655#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {2655#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:08:05,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {2662#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2655#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:08:05,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {2666#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2662#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:08:05,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {2670#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2666#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:08:05,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {2550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2670#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:08:05,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret9 := main(); {2550#true} is VALID [2022-04-27 11:08:05,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #50#return; {2550#true} is VALID [2022-04-27 11:08:05,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-27 11:08:05,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2550#true} is VALID [2022-04-27 11:08:05,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2550#true} is VALID [2022-04-27 11:08:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:05,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572555218] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:08:05,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:08:05,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-04-27 11:08:05,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488627043] [2022-04-27 11:08:05,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:08:05,449 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:08:05,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:08:05,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:05,476 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:08:05,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 11:08:05,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:08:05,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 11:08:05,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:08:05,478 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:06,151 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 11:08:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 11:08:06,151 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:08:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:08:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2022-04-27 11:08:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:06,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2022-04-27 11:08:06,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 31 transitions. [2022-04-27 11:08:06,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:06,180 INFO L225 Difference]: With dead ends: 44 [2022-04-27 11:08:06,180 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 11:08:06,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2022-04-27 11:08:06,181 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:08:06,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 79 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:08:06,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 11:08:06,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 11:08:06,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:08:06,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:06,287 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:06,287 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:06,288 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-27 11:08:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-27 11:08:06,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:06,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:06,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 11:08:06,289 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 11:08:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:06,290 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-27 11:08:06,290 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-27 11:08:06,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:06,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:06,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:08:06,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:08:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-27 11:08:06,291 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2022-04-27 11:08:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:08:06,291 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-27 11:08:06,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (4), 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:08:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-27 11:08:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:08:06,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:08:06,292 INFO L195 NwaCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:08:06,326 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:08:06,519 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:08:06,519 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:08:06,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:08:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash -610638132, now seen corresponding path program 8 times [2022-04-27 11:08:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:08:06,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76031298] [2022-04-27 11:08:06,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:06,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:08:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:06,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:08:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:06,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {2919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2905#true} is VALID [2022-04-27 11:08:06,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {2905#true} assume true; {2905#true} is VALID [2022-04-27 11:08:06,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2905#true} {2905#true} #50#return; {2905#true} is VALID [2022-04-27 11:08:06,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {2905#true} call ULTIMATE.init(); {2919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:08:06,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {2919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2905#true} is VALID [2022-04-27 11:08:06,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {2905#true} assume true; {2905#true} is VALID [2022-04-27 11:08:06,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2905#true} {2905#true} #50#return; {2905#true} is VALID [2022-04-27 11:08:06,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {2905#true} call #t~ret9 := main(); {2905#true} is VALID [2022-04-27 11:08:06,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {2905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2910#(= main_~y~0 0)} is VALID [2022-04-27 11:08:06,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {2910#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2911#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:06,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {2911#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2912#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:06,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {2912#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2913#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:08:06,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {2913#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2914#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:08:06,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {2914#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:08:06,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:08:06,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {2916#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:08:06,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {2916#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2917#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:08:06,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {2917#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2918#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:08:06,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {2918#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2906#false} is VALID [2022-04-27 11:08:06,692 INFO L272 TraceCheckUtils]: 16: Hoare triple {2906#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2906#false} is VALID [2022-04-27 11:08:06,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {2906#false} ~cond := #in~cond; {2906#false} is VALID [2022-04-27 11:08:06,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {2906#false} assume 0 == ~cond; {2906#false} is VALID [2022-04-27 11:08:06,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {2906#false} assume !false; {2906#false} is VALID [2022-04-27 11:08:06,692 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:08:06,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:08:06,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76031298] [2022-04-27 11:08:06,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76031298] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:08:06,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876621879] [2022-04-27 11:08:06,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:08:06,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:06,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:08:06,694 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:08:06,695 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:08:06,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:08:06,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:08:06,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 11:08:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:06,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:08:06,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {2905#true} call ULTIMATE.init(); {2905#true} is VALID [2022-04-27 11:08:06,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {2905#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2905#true} is VALID [2022-04-27 11:08:06,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {2905#true} assume true; {2905#true} is VALID [2022-04-27 11:08:06,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2905#true} {2905#true} #50#return; {2905#true} is VALID [2022-04-27 11:08:06,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {2905#true} call #t~ret9 := main(); {2905#true} is VALID [2022-04-27 11:08:06,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {2905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2910#(= main_~y~0 0)} is VALID [2022-04-27 11:08:06,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {2910#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2911#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:06,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {2911#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2912#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:06,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {2912#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2913#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:08:06,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {2913#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2914#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:08:06,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {2914#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:08:06,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:08:06,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {2916#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:08:06,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {2916#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2917#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:08:06,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {2917#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2965#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:08:06,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {2965#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2906#false} is VALID [2022-04-27 11:08:06,963 INFO L272 TraceCheckUtils]: 16: Hoare triple {2906#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2906#false} is VALID [2022-04-27 11:08:06,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {2906#false} ~cond := #in~cond; {2906#false} is VALID [2022-04-27 11:08:06,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {2906#false} assume 0 == ~cond; {2906#false} is VALID [2022-04-27 11:08:06,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {2906#false} assume !false; {2906#false} is VALID [2022-04-27 11:08:06,964 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:08:06,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:08:07,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {2906#false} assume !false; {2906#false} is VALID [2022-04-27 11:08:07,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {2906#false} assume 0 == ~cond; {2906#false} is VALID [2022-04-27 11:08:07,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {2906#false} ~cond := #in~cond; {2906#false} is VALID [2022-04-27 11:08:07,163 INFO L272 TraceCheckUtils]: 16: Hoare triple {2906#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2906#false} is VALID [2022-04-27 11:08:07,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {2993#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2906#false} is VALID [2022-04-27 11:08:07,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {2997#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2993#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:08:07,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {3001#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2997#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:08:07,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {3005#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {3001#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:08:07,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {3005#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {3005#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:08:07,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {3012#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3005#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:08:07,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {3016#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3012#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:08:07,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {3020#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3016#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:08:07,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {3024#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3020#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:08:07,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {3028#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3024#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:08:07,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {2905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3028#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:08:07,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {2905#true} call #t~ret9 := main(); {2905#true} is VALID [2022-04-27 11:08:07,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2905#true} {2905#true} #50#return; {2905#true} is VALID [2022-04-27 11:08:07,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {2905#true} assume true; {2905#true} is VALID [2022-04-27 11:08:07,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {2905#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2905#true} is VALID [2022-04-27 11:08:07,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {2905#true} call ULTIMATE.init(); {2905#true} is VALID [2022-04-27 11:08:07,179 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:08:07,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876621879] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:08:07,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:08:07,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-27 11:08:07,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500341157] [2022-04-27 11:08:07,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:08:07,181 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:08:07,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:08:07,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:07,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:07,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 11:08:07,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:08:07,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 11:08:07,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:08:07,211 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:11,374 INFO L93 Difference]: Finished difference Result 82 states and 115 transitions. [2022-04-27 11:08:11,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-27 11:08:11,375 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:08:11,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:08:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 115 transitions. [2022-04-27 11:08:11,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 115 transitions. [2022-04-27 11:08:11,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 115 transitions. [2022-04-27 11:08:11,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:11,526 INFO L225 Difference]: With dead ends: 82 [2022-04-27 11:08:11,526 INFO L226 Difference]: Without dead ends: 77 [2022-04-27 11:08:11,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1065, Invalid=3627, Unknown=0, NotChecked=0, Total=4692 [2022-04-27 11:08:11,528 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 142 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:08:11,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 77 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:08:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-27 11:08:11,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 39. [2022-04-27 11:08:11,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:08:11,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:11,649 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:11,649 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:11,651 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-04-27 11:08:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-04-27 11:08:11,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:11,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:11,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-27 11:08:11,652 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-27 11:08:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:11,654 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-04-27 11:08:11,654 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-04-27 11:08:11,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:11,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:11,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:08:11,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:08:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:11,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-04-27 11:08:11,655 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 20 [2022-04-27 11:08:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:08:11,655 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-04-27 11:08:11,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-04-27 11:08:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 11:08:11,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:08:11,656 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:08:11,674 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:08:11,863 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:08:11,863 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:08:11,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:08:11,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1612182871, now seen corresponding path program 9 times [2022-04-27 11:08:11,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:08:11,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52032646] [2022-04-27 11:08:11,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:11,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:08:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:12,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:08:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:12,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {3524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3511#true} is VALID [2022-04-27 11:08:12,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {3511#true} assume true; {3511#true} is VALID [2022-04-27 11:08:12,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3511#true} {3511#true} #50#return; {3511#true} is VALID [2022-04-27 11:08:12,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {3511#true} call ULTIMATE.init(); {3524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:08:12,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {3524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3511#true} is VALID [2022-04-27 11:08:12,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {3511#true} assume true; {3511#true} is VALID [2022-04-27 11:08:12,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3511#true} {3511#true} #50#return; {3511#true} is VALID [2022-04-27 11:08:12,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {3511#true} call #t~ret9 := main(); {3511#true} is VALID [2022-04-27 11:08:12,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {3511#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3516#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:08:12,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {3516#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3517#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:08:12,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {3517#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3518#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:08:12,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {3518#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3519#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:08:12,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {3519#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:08:12,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:08:12,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} ~z~0 := ~y~0; {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:08:12,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3519#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:08:12,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {3519#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3518#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:08:12,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {3518#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3517#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:08:12,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {3517#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3521#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:08:12,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {3521#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {3521#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:08:12,081 INFO L272 TraceCheckUtils]: 17: Hoare triple {3521#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3522#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:08:12,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {3522#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3523#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:08:12,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {3523#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3512#false} is VALID [2022-04-27 11:08:12,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {3512#false} assume !false; {3512#false} is VALID [2022-04-27 11:08:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:12,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:08:12,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52032646] [2022-04-27 11:08:12,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52032646] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:08:12,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035150412] [2022-04-27 11:08:12,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:08:12,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:12,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:08:12,083 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:08:12,086 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:08:12,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 11:08:12,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:08:12,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 11:08:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:12,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:08:12,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {3511#true} call ULTIMATE.init(); {3511#true} is VALID [2022-04-27 11:08:12,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {3511#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3511#true} is VALID [2022-04-27 11:08:12,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {3511#true} assume true; {3511#true} is VALID [2022-04-27 11:08:12,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3511#true} {3511#true} #50#return; {3511#true} is VALID [2022-04-27 11:08:12,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {3511#true} call #t~ret9 := main(); {3511#true} is VALID [2022-04-27 11:08:12,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {3511#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3516#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:08:12,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {3516#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3517#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:08:12,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {3517#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3518#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:08:12,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {3518#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3519#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:08:12,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {3519#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:08:12,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:08:12,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} ~z~0 := ~y~0; {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:08:12,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3519#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:08:12,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {3519#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3518#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:08:12,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {3518#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3517#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:08:12,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {3517#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3516#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:08:12,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {3516#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {3516#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:08:12,320 INFO L272 TraceCheckUtils]: 17: Hoare triple {3516#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3579#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:08:12,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {3579#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3583#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:08:12,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {3583#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3512#false} is VALID [2022-04-27 11:08:12,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {3512#false} assume !false; {3512#false} is VALID [2022-04-27 11:08:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:12,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:08:12,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {3512#false} assume !false; {3512#false} is VALID [2022-04-27 11:08:12,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {3583#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3512#false} is VALID [2022-04-27 11:08:12,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {3579#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3583#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:08:12,498 INFO L272 TraceCheckUtils]: 17: Hoare triple {3599#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3579#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:08:12,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {3599#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3599#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:08:12,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {3606#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3599#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:08:12,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {3610#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3606#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:08:12,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {3614#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3610#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:08:12,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {3618#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3614#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:08:12,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {3618#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {3618#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:08:12,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {3618#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {3618#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:08:12,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {3614#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3618#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:08:12,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {3610#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3614#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:08:12,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {3606#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3610#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:08:12,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {3599#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3606#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:08:12,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {3511#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3599#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:08:12,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {3511#true} call #t~ret9 := main(); {3511#true} is VALID [2022-04-27 11:08:12,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3511#true} {3511#true} #50#return; {3511#true} is VALID [2022-04-27 11:08:12,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {3511#true} assume true; {3511#true} is VALID [2022-04-27 11:08:12,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {3511#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3511#true} is VALID [2022-04-27 11:08:12,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {3511#true} call ULTIMATE.init(); {3511#true} is VALID [2022-04-27 11:08:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:12,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035150412] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:08:12,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:08:12,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2022-04-27 11:08:12,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421543602] [2022-04-27 11:08:12,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:08:12,508 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:08:12,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:08:12,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:12,542 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:08:12,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 11:08:12,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:08:12,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 11:08:12,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:08:12,543 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:13,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:13,209 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-27 11:08:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:08:13,209 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:08:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:08:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-27 11:08:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-27 11:08:13,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-04-27 11:08:13,240 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:08:13,241 INFO L225 Difference]: With dead ends: 49 [2022-04-27 11:08:13,241 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 11:08:13,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:08:13,242 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:08:13,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 78 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:08:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 11:08:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2022-04-27 11:08:13,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:08:13,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:13,384 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:13,384 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:13,385 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-27 11:08:13,385 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-04-27 11:08:13,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:13,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:13,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-27 11:08:13,390 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-27 11:08:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:13,396 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-27 11:08:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-04-27 11:08:13,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:13,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:13,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:08:13,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:08:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2022-04-27 11:08:13,398 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 21 [2022-04-27 11:08:13,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:08:13,398 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2022-04-27 11:08:13,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 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:08:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-04-27 11:08:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:08:13,398 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:08:13,398 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:08:13,426 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:08:13,620 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:08:13,621 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:08:13,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:08:13,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1527443477, now seen corresponding path program 10 times [2022-04-27 11:08:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:08:13,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998590248] [2022-04-27 11:08:13,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:08:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:13,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:08:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:13,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {3924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3909#true} is VALID [2022-04-27 11:08:13,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {3909#true} assume true; {3909#true} is VALID [2022-04-27 11:08:13,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3909#true} {3909#true} #50#return; {3909#true} is VALID [2022-04-27 11:08:13,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {3909#true} call ULTIMATE.init(); {3924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:08:13,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {3924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3909#true} is VALID [2022-04-27 11:08:13,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {3909#true} assume true; {3909#true} is VALID [2022-04-27 11:08:13,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3909#true} {3909#true} #50#return; {3909#true} is VALID [2022-04-27 11:08:13,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {3909#true} call #t~ret9 := main(); {3909#true} is VALID [2022-04-27 11:08:13,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {3909#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3914#(= main_~y~0 0)} is VALID [2022-04-27 11:08:13,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {3914#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:13,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {3915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:13,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {3916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:08:13,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {3917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:08:13,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:08:13,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3919#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:08:13,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {3919#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3920#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:08:13,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {3920#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3921#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:08:13,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {3921#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3922#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:08:13,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {3922#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3923#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:08:13,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {3923#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3910#false} is VALID [2022-04-27 11:08:13,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {3910#false} assume !(~z~0 % 4294967296 > 0); {3910#false} is VALID [2022-04-27 11:08:13,805 INFO L272 TraceCheckUtils]: 18: Hoare triple {3910#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3910#false} is VALID [2022-04-27 11:08:13,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {3910#false} ~cond := #in~cond; {3910#false} is VALID [2022-04-27 11:08:13,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {3910#false} assume 0 == ~cond; {3910#false} is VALID [2022-04-27 11:08:13,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {3910#false} assume !false; {3910#false} is VALID [2022-04-27 11:08:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:08:13,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998590248] [2022-04-27 11:08:13,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998590248] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:08:13,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567051318] [2022-04-27 11:08:13,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:08:13,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:13,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:08:13,807 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:08:13,824 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:08:13,868 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:08:13,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:08:13,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 11:08:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:13,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:08:14,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {3909#true} call ULTIMATE.init(); {3909#true} is VALID [2022-04-27 11:08:14,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {3909#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3909#true} is VALID [2022-04-27 11:08:14,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {3909#true} assume true; {3909#true} is VALID [2022-04-27 11:08:14,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3909#true} {3909#true} #50#return; {3909#true} is VALID [2022-04-27 11:08:14,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {3909#true} call #t~ret9 := main(); {3909#true} is VALID [2022-04-27 11:08:14,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {3909#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3914#(= main_~y~0 0)} is VALID [2022-04-27 11:08:14,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {3914#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:14,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {3915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:14,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {3916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:08:14,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {3917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:08:14,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:08:14,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3919#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:08:14,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {3919#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3920#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:08:14,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {3920#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3921#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:08:14,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {3921#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3922#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:08:14,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {3922#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3923#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:08:14,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {3923#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3910#false} is VALID [2022-04-27 11:08:14,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {3910#false} assume !(~z~0 % 4294967296 > 0); {3910#false} is VALID [2022-04-27 11:08:14,099 INFO L272 TraceCheckUtils]: 18: Hoare triple {3910#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3910#false} is VALID [2022-04-27 11:08:14,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {3910#false} ~cond := #in~cond; {3910#false} is VALID [2022-04-27 11:08:14,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {3910#false} assume 0 == ~cond; {3910#false} is VALID [2022-04-27 11:08:14,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {3910#false} assume !false; {3910#false} is VALID [2022-04-27 11:08:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:14,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:08:14,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {3910#false} assume !false; {3910#false} is VALID [2022-04-27 11:08:14,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {3910#false} assume 0 == ~cond; {3910#false} is VALID [2022-04-27 11:08:14,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {3910#false} ~cond := #in~cond; {3910#false} is VALID [2022-04-27 11:08:14,305 INFO L272 TraceCheckUtils]: 18: Hoare triple {3910#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3910#false} is VALID [2022-04-27 11:08:14,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {3910#false} assume !(~z~0 % 4294967296 > 0); {3910#false} is VALID [2022-04-27 11:08:14,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {4006#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3910#false} is VALID [2022-04-27 11:08:14,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {4010#(not (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4006#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:08:14,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {4014#(not (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4010#(not (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:08:14,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {4018#(not (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4014#(not (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:08:14,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {4022#(not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4018#(not (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:08:14,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {4026#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} ~z~0 := ~y~0; {4022#(not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-27 11:08:14,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {4026#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4026#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:08:14,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {4033#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4026#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:08:14,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {4037#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4033#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:08:14,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {4041#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4037#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:08:14,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {4045#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4041#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:08:14,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {3909#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4045#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:08:14,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {3909#true} call #t~ret9 := main(); {3909#true} is VALID [2022-04-27 11:08:14,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3909#true} {3909#true} #50#return; {3909#true} is VALID [2022-04-27 11:08:14,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {3909#true} assume true; {3909#true} is VALID [2022-04-27 11:08:14,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {3909#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3909#true} is VALID [2022-04-27 11:08:14,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {3909#true} call ULTIMATE.init(); {3909#true} is VALID [2022-04-27 11:08:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:14,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567051318] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:08:14,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:08:14,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 23 [2022-04-27 11:08:14,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59091423] [2022-04-27 11:08:14,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:08:14,325 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:08:14,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:08:14,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:14,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:14,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 11:08:14,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:08:14,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 11:08:14,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2022-04-27 11:08:14,359 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:15,087 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-27 11:08:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 11:08:15,088 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:08:15,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:08:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2022-04-27 11:08:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2022-04-27 11:08:15,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 33 transitions. [2022-04-27 11:08:15,116 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:08:15,117 INFO L225 Difference]: With dead ends: 50 [2022-04-27 11:08:15,117 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 11:08:15,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 11:08:15,118 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:08:15,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 84 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:08:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 11:08:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 11:08:15,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:08:15,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:15,247 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:15,247 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:15,248 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-04-27 11:08:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-27 11:08:15,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:15,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:15,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-27 11:08:15,249 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-27 11:08:15,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:15,249 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-04-27 11:08:15,249 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-27 11:08:15,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:15,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:15,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:08:15,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:08:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-27 11:08:15,251 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 22 [2022-04-27 11:08:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:08:15,251 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-27 11:08:15,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (4), 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:08:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-27 11:08:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:08:15,251 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:08:15,252 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:08:15,269 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:08:15,459 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:08:15,459 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:08:15,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:08:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash -636483637, now seen corresponding path program 11 times [2022-04-27 11:08:15,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:08:15,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655803249] [2022-04-27 11:08:15,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:15,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:08:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:15,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:08:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:15,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {4332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4316#true} is VALID [2022-04-27 11:08:15,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {4316#true} assume true; {4316#true} is VALID [2022-04-27 11:08:15,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4316#true} {4316#true} #50#return; {4316#true} is VALID [2022-04-27 11:08:15,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {4316#true} call ULTIMATE.init(); {4332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:08:15,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {4332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4316#true} is VALID [2022-04-27 11:08:15,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {4316#true} assume true; {4316#true} is VALID [2022-04-27 11:08:15,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4316#true} {4316#true} #50#return; {4316#true} is VALID [2022-04-27 11:08:15,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {4316#true} call #t~ret9 := main(); {4316#true} is VALID [2022-04-27 11:08:15,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {4316#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4321#(= main_~y~0 0)} is VALID [2022-04-27 11:08:15,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {4321#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4322#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:15,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {4322#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4323#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:15,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {4323#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4324#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:08:15,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {4324#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4325#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:08:15,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {4325#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4326#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:08:15,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {4326#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:08:15,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:08:15,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {4328#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:08:15,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {4328#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4329#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:08:15,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {4329#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4330#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:08:15,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {4330#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4331#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:08:15,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {4331#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {4317#false} is VALID [2022-04-27 11:08:15,667 INFO L272 TraceCheckUtils]: 18: Hoare triple {4317#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4317#false} is VALID [2022-04-27 11:08:15,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {4317#false} ~cond := #in~cond; {4317#false} is VALID [2022-04-27 11:08:15,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#false} assume 0 == ~cond; {4317#false} is VALID [2022-04-27 11:08:15,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {4317#false} assume !false; {4317#false} is VALID [2022-04-27 11:08:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:15,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:08:15,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655803249] [2022-04-27 11:08:15,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655803249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:08:15,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919713702] [2022-04-27 11:08:15,667 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:08:15,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:15,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:08:15,669 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:08:15,670 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:08:15,716 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 11:08:15,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:08:15,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 11:08:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:15,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:08:15,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {4316#true} call ULTIMATE.init(); {4316#true} is VALID [2022-04-27 11:08:15,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {4316#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4316#true} is VALID [2022-04-27 11:08:15,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {4316#true} assume true; {4316#true} is VALID [2022-04-27 11:08:15,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4316#true} {4316#true} #50#return; {4316#true} is VALID [2022-04-27 11:08:15,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {4316#true} call #t~ret9 := main(); {4316#true} is VALID [2022-04-27 11:08:15,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {4316#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4321#(= main_~y~0 0)} is VALID [2022-04-27 11:08:15,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {4321#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4322#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:15,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {4322#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4323#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:15,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {4323#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4324#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:08:15,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {4324#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4325#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:08:15,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {4325#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4326#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:08:15,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {4326#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:08:15,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:08:15,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {4328#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:08:15,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {4328#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4329#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:08:15,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {4329#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4330#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:08:15,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {4330#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4384#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:08:15,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {4384#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4317#false} is VALID [2022-04-27 11:08:15,964 INFO L272 TraceCheckUtils]: 18: Hoare triple {4317#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4317#false} is VALID [2022-04-27 11:08:15,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {4317#false} ~cond := #in~cond; {4317#false} is VALID [2022-04-27 11:08:15,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#false} assume 0 == ~cond; {4317#false} is VALID [2022-04-27 11:08:15,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {4317#false} assume !false; {4317#false} is VALID [2022-04-27 11:08:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:15,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:08:16,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {4317#false} assume !false; {4317#false} is VALID [2022-04-27 11:08:16,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#false} assume 0 == ~cond; {4317#false} is VALID [2022-04-27 11:08:16,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {4317#false} ~cond := #in~cond; {4317#false} is VALID [2022-04-27 11:08:16,210 INFO L272 TraceCheckUtils]: 18: Hoare triple {4317#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4317#false} is VALID [2022-04-27 11:08:16,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {4412#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4317#false} is VALID [2022-04-27 11:08:16,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {4416#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4412#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:08:16,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {4420#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4416#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:08:16,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {4424#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4420#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:08:16,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {4428#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {4424#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:08:16,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {4428#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4428#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:08:16,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {4435#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4428#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:08:16,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {4439#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4435#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:08:16,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {4443#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4439#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:08:16,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {4447#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4443#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:08:16,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {4451#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4447#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:08:16,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {4455#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4451#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:08:16,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {4316#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4455#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:08:16,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {4316#true} call #t~ret9 := main(); {4316#true} is VALID [2022-04-27 11:08:16,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4316#true} {4316#true} #50#return; {4316#true} is VALID [2022-04-27 11:08:16,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {4316#true} assume true; {4316#true} is VALID [2022-04-27 11:08:16,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {4316#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4316#true} is VALID [2022-04-27 11:08:16,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {4316#true} call ULTIMATE.init(); {4316#true} is VALID [2022-04-27 11:08:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:16,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919713702] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:08:16,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:08:16,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-27 11:08:16,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005012452] [2022-04-27 11:08:16,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:08:16,228 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:08:16,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:08:16,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:16,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:16,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 11:08:16,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:08:16,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 11:08:16,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2022-04-27 11:08:16,258 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:27,963 INFO L93 Difference]: Finished difference Result 103 states and 144 transitions. [2022-04-27 11:08:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-27 11:08:27,963 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:08:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:08:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 144 transitions. [2022-04-27 11:08:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 144 transitions. [2022-04-27 11:08:27,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 144 transitions. [2022-04-27 11:08:28,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:28,264 INFO L225 Difference]: With dead ends: 103 [2022-04-27 11:08:28,264 INFO L226 Difference]: Without dead ends: 98 [2022-04-27 11:08:28,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2398 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1783, Invalid=6589, Unknown=0, NotChecked=0, Total=8372 [2022-04-27 11:08:28,266 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 197 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:08:28,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 70 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 11:08:28,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-27 11:08:28,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 50. [2022-04-27 11:08:28,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:08:28,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:28,512 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:28,512 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:28,514 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2022-04-27 11:08:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2022-04-27 11:08:28,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:28,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:28,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-27 11:08:28,515 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-27 11:08:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:28,517 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2022-04-27 11:08:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2022-04-27 11:08:28,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:28,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:28,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:08:28,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:08:28,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2022-04-27 11:08:28,519 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 22 [2022-04-27 11:08:28,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:08:28,519 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2022-04-27 11:08:28,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-27 11:08:28,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:08:28,520 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:08:28,520 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:08:28,541 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:08:28,735 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:08:28,735 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:08:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:08:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1854745558, now seen corresponding path program 12 times [2022-04-27 11:08:28,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:08:28,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536450158] [2022-04-27 11:08:28,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:28,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:08:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:28,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:08:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:28,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {5094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5080#true} is VALID [2022-04-27 11:08:28,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:08:28,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5080#true} {5080#true} #50#return; {5080#true} is VALID [2022-04-27 11:08:28,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {5080#true} call ULTIMATE.init(); {5094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:08:28,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {5094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5080#true} is VALID [2022-04-27 11:08:28,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:08:28,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5080#true} {5080#true} #50#return; {5080#true} is VALID [2022-04-27 11:08:28,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {5080#true} call #t~ret9 := main(); {5080#true} is VALID [2022-04-27 11:08:28,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {5080#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5085#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:08:28,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {5085#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5086#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:08:28,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {5086#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5087#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:08:28,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {5087#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5088#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:08:28,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {5088#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5089#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:08:28,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {5089#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-27 11:08:28,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-27 11:08:28,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} ~z~0 := ~y~0; {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-27 11:08:28,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5089#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:08:28,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {5089#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5088#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:08:28,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {5088#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5087#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:08:28,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {5087#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5086#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:08:28,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {5086#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5091#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:08:28,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {5091#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {5091#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:08:28,955 INFO L272 TraceCheckUtils]: 19: Hoare triple {5091#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5092#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:08:28,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {5092#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5093#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:08:28,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {5093#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5081#false} is VALID [2022-04-27 11:08:28,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {5081#false} assume !false; {5081#false} is VALID [2022-04-27 11:08:28,956 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:08:28,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:08:28,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536450158] [2022-04-27 11:08:28,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536450158] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:08:28,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377171251] [2022-04-27 11:08:28,956 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:08:28,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:28,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:08:28,957 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:08:28,958 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:08:29,004 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-27 11:08:29,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:08:29,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-27 11:08:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:29,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:08:29,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {5080#true} call ULTIMATE.init(); {5080#true} is VALID [2022-04-27 11:08:29,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {5080#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5080#true} is VALID [2022-04-27 11:08:29,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:08:29,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5080#true} {5080#true} #50#return; {5080#true} is VALID [2022-04-27 11:08:29,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {5080#true} call #t~ret9 := main(); {5080#true} is VALID [2022-04-27 11:08:29,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {5080#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5085#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:08:29,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {5085#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5086#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:08:29,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {5086#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5087#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:08:29,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {5087#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5088#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:08:29,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {5088#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5089#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:08:29,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {5089#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-27 11:08:29,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-27 11:08:29,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} ~z~0 := ~y~0; {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-27 11:08:29,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5089#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:08:29,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {5089#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5088#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:08:29,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {5088#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5087#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:08:29,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {5087#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5086#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:08:29,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {5086#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5085#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:08:29,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {5085#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {5085#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:08:29,200 INFO L272 TraceCheckUtils]: 19: Hoare triple {5085#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5155#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:08:29,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {5155#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5159#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:08:29,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {5159#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5081#false} is VALID [2022-04-27 11:08:29,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {5081#false} assume !false; {5081#false} is VALID [2022-04-27 11:08:29,200 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:08:29,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:08:29,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {5081#false} assume !false; {5081#false} is VALID [2022-04-27 11:08:29,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {5159#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5081#false} is VALID [2022-04-27 11:08:29,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {5155#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5159#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:08:29,413 INFO L272 TraceCheckUtils]: 19: Hoare triple {5175#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5155#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:08:29,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {5175#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5175#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:08:29,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {5182#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5175#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:08:29,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {5186#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5182#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:08:29,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {5190#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5186#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:08:29,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {5194#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5190#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:08:29,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {5198#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5194#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:08:29,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {5198#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {5198#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:08:29,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {5198#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5198#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:08:29,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {5194#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5198#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:08:29,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {5190#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5194#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:08:29,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {5186#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5190#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:08:29,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {5182#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5186#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:08:29,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {5175#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5182#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:08:29,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {5080#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5175#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:08:29,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {5080#true} call #t~ret9 := main(); {5080#true} is VALID [2022-04-27 11:08:29,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5080#true} {5080#true} #50#return; {5080#true} is VALID [2022-04-27 11:08:29,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:08:29,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {5080#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5080#true} is VALID [2022-04-27 11:08:29,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {5080#true} call ULTIMATE.init(); {5080#true} is VALID [2022-04-27 11:08:29,421 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:08:29,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377171251] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:08:29,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:08:29,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 20 [2022-04-27 11:08:29,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726280647] [2022-04-27 11:08:29,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:08:29,423 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:08:29,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:08:29,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:29,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:29,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 11:08:29,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:08:29,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 11:08:29,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-04-27 11:08:29,464 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:30,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:30,341 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2022-04-27 11:08:30,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:08:30,342 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:08:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:08:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-27 11:08:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-27 11:08:30,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 34 transitions. [2022-04-27 11:08:30,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:30,374 INFO L225 Difference]: With dead ends: 61 [2022-04-27 11:08:30,374 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 11:08:30,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2022-04-27 11:08:30,375 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:08:30,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 73 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:08:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 11:08:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2022-04-27 11:08:30,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:08:30,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:30,674 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:30,674 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:30,675 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2022-04-27 11:08:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-04-27 11:08:30,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:30,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:30,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-27 11:08:30,676 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-27 11:08:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:30,677 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2022-04-27 11:08:30,677 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-04-27 11:08:30,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:30,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:30,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:08:30,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:08:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2022-04-27 11:08:30,679 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 23 [2022-04-27 11:08:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:08:30,679 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2022-04-27 11:08:30,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:30,679 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2022-04-27 11:08:30,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 11:08:30,679 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:08:30,679 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:08:30,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 11:08:30,880 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:08:30,880 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:08:30,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:08:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash -747983508, now seen corresponding path program 13 times [2022-04-27 11:08:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:08:30,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473527880] [2022-04-27 11:08:30,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:08:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:31,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:08:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:31,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {5587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5569#true} is VALID [2022-04-27 11:08:31,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-04-27 11:08:31,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5569#true} {5569#true} #50#return; {5569#true} is VALID [2022-04-27 11:08:31,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {5569#true} call ULTIMATE.init(); {5587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:08:31,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {5587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5569#true} is VALID [2022-04-27 11:08:31,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-04-27 11:08:31,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5569#true} {5569#true} #50#return; {5569#true} is VALID [2022-04-27 11:08:31,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {5569#true} call #t~ret9 := main(); {5569#true} is VALID [2022-04-27 11:08:31,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {5569#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5574#(= main_~y~0 0)} is VALID [2022-04-27 11:08:31,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {5574#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5575#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:31,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {5575#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5576#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:31,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {5576#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5577#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:08:31,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {5577#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5578#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:08:31,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {5578#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5579#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:08:31,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {5579#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5580#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:08:31,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {5580#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:08:31,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:08:31,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {5582#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:08:31,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {5582#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5583#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:08:31,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {5583#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5584#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:08:31,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {5584#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5585#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:08:31,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {5585#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5586#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:08:31,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {5586#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {5570#false} is VALID [2022-04-27 11:08:31,105 INFO L272 TraceCheckUtils]: 20: Hoare triple {5570#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5570#false} is VALID [2022-04-27 11:08:31,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {5570#false} ~cond := #in~cond; {5570#false} is VALID [2022-04-27 11:08:31,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {5570#false} assume 0 == ~cond; {5570#false} is VALID [2022-04-27 11:08:31,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {5570#false} assume !false; {5570#false} is VALID [2022-04-27 11:08:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:31,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:08:31,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473527880] [2022-04-27 11:08:31,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473527880] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:08:31,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893491373] [2022-04-27 11:08:31,105 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:08:31,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:31,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:08:31,107 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:08:31,107 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:08:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:31,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-27 11:08:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:31,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:08:31,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {5569#true} call ULTIMATE.init(); {5569#true} is VALID [2022-04-27 11:08:31,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {5569#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5569#true} is VALID [2022-04-27 11:08:31,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-04-27 11:08:31,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5569#true} {5569#true} #50#return; {5569#true} is VALID [2022-04-27 11:08:31,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {5569#true} call #t~ret9 := main(); {5569#true} is VALID [2022-04-27 11:08:31,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {5569#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5574#(= main_~y~0 0)} is VALID [2022-04-27 11:08:31,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {5574#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5575#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:31,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {5575#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5576#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:31,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {5576#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5577#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:08:31,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {5577#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5578#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:08:31,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {5578#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5579#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:08:31,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {5579#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5580#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:08:31,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {5580#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:08:31,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:08:31,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {5582#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:08:31,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {5582#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5583#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:08:31,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {5583#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5584#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:08:31,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {5584#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5585#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:08:31,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {5585#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5645#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:08:31,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {5645#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5570#false} is VALID [2022-04-27 11:08:31,392 INFO L272 TraceCheckUtils]: 20: Hoare triple {5570#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5570#false} is VALID [2022-04-27 11:08:31,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {5570#false} ~cond := #in~cond; {5570#false} is VALID [2022-04-27 11:08:31,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {5570#false} assume 0 == ~cond; {5570#false} is VALID [2022-04-27 11:08:31,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {5570#false} assume !false; {5570#false} is VALID [2022-04-27 11:08:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:31,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:08:31,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {5570#false} assume !false; {5570#false} is VALID [2022-04-27 11:08:31,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {5570#false} assume 0 == ~cond; {5570#false} is VALID [2022-04-27 11:08:31,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {5570#false} ~cond := #in~cond; {5570#false} is VALID [2022-04-27 11:08:31,727 INFO L272 TraceCheckUtils]: 20: Hoare triple {5570#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5570#false} is VALID [2022-04-27 11:08:31,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {5673#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5570#false} is VALID [2022-04-27 11:08:31,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {5677#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5673#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:08:31,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {5681#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5677#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:08:31,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {5685#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5681#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:08:31,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {5689#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5685#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:08:31,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {5693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {5689#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-27 11:08:31,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {5693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:08:31,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {5700#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:08:31,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {5704#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5700#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:08:31,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {5708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5704#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:08:31,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {5712#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:08:31,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {5716#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5712#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:08:31,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {5720#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5716#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:08:31,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {5724#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5720#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:08:31,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {5569#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5724#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:08:31,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {5569#true} call #t~ret9 := main(); {5569#true} is VALID [2022-04-27 11:08:31,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5569#true} {5569#true} #50#return; {5569#true} is VALID [2022-04-27 11:08:31,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-04-27 11:08:31,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {5569#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5569#true} is VALID [2022-04-27 11:08:31,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {5569#true} call ULTIMATE.init(); {5569#true} is VALID [2022-04-27 11:08:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:31,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893491373] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:08:31,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:08:31,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-27 11:08:31,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118582598] [2022-04-27 11:08:31,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:08:31,740 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 11:08:31,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:08:31,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:31,777 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:08:31,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 11:08:31,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:08:31,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 11:08:31,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-04-27 11:08:31,778 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:00,353 INFO L93 Difference]: Finished difference Result 135 states and 188 transitions. [2022-04-27 11:09:00,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-04-27 11:09:00,354 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 11:09:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 188 transitions. [2022-04-27 11:09:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 188 transitions. [2022-04-27 11:09:00,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 188 transitions. [2022-04-27 11:09:00,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:00,935 INFO L225 Difference]: With dead ends: 135 [2022-04-27 11:09:00,935 INFO L226 Difference]: Without dead ends: 130 [2022-04-27 11:09:00,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4829 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=3140, Invalid=12112, Unknown=0, NotChecked=0, Total=15252 [2022-04-27 11:09:00,938 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 288 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:00,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 83 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-27 11:09:00,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-27 11:09:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 63. [2022-04-27 11:09:01,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:01,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 63 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:01,324 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 63 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:01,324 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 63 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:01,326 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2022-04-27 11:09:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2022-04-27 11:09:01,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:01,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:01,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-27 11:09:01,327 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-27 11:09:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:01,330 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2022-04-27 11:09:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2022-04-27 11:09:01,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:01,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:01,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:01,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2022-04-27 11:09:01,332 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 24 [2022-04-27 11:09:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:01,332 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2022-04-27 11:09:01,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2022-04-27 11:09:01,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 11:09:01,333 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:01,333 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:01,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:01,547 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:09:01,547 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:01,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:01,548 INFO L85 PathProgramCache]: Analyzing trace with hash 690452087, now seen corresponding path program 14 times [2022-04-27 11:09:01,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:01,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638048290] [2022-04-27 11:09:01,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:01,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:02,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:02,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {6576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6555#true} is VALID [2022-04-27 11:09:02,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {6555#true} assume true; {6555#true} is VALID [2022-04-27 11:09:02,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6555#true} {6555#true} #50#return; {6555#true} is VALID [2022-04-27 11:09:02,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {6555#true} call ULTIMATE.init(); {6576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:02,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {6576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6555#true} is VALID [2022-04-27 11:09:02,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {6555#true} assume true; {6555#true} is VALID [2022-04-27 11:09:02,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6555#true} {6555#true} #50#return; {6555#true} is VALID [2022-04-27 11:09:02,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {6555#true} call #t~ret9 := main(); {6555#true} is VALID [2022-04-27 11:09:02,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {6555#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6560#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:09:02,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {6560#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6561#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:09:02,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {6561#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6562#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:09:02,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {6562#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6563#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-27 11:09:02,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {6563#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6564#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:09:02,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {6564#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6565#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-27 11:09:02,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {6565#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6566#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-27 11:09:02,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {6566#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {6567#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-27 11:09:02,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {6567#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} ~z~0 := ~y~0; {6567#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-27 11:09:02,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {6567#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6568#(and (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-27 11:09:02,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {6568#(and (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6569#(and (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:09:02,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {6569#(and (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6570#(and (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 3) main_~x~0) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:09:02,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {6570#(and (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 3) main_~x~0) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6571#(and (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:09:02,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {6571#(and (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6572#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:09:02,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {6572#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6573#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:09:02,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {6573#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {6573#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:09:02,406 INFO L272 TraceCheckUtils]: 21: Hoare triple {6573#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6574#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:09:02,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {6574#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6575#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:09:02,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {6575#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6556#false} is VALID [2022-04-27 11:09:02,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {6556#false} assume !false; {6556#false} is VALID [2022-04-27 11:09:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:02,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:02,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638048290] [2022-04-27 11:09:02,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638048290] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:02,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152809217] [2022-04-27 11:09:02,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:09:02,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:02,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:02,409 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:02,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 11:09:02,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:09:02,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:02,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 11:09:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:02,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:02,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {6555#true} call ULTIMATE.init(); {6555#true} is VALID [2022-04-27 11:09:02,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {6555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6555#true} is VALID [2022-04-27 11:09:02,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {6555#true} assume true; {6555#true} is VALID [2022-04-27 11:09:02,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6555#true} {6555#true} #50#return; {6555#true} is VALID [2022-04-27 11:09:02,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {6555#true} call #t~ret9 := main(); {6555#true} is VALID [2022-04-27 11:09:02,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {6555#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6560#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:09:02,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {6560#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6598#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-27 11:09:02,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {6598#(= (+ main_~x~0 1) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6602#(= main_~n~0 (+ main_~x~0 2))} is VALID [2022-04-27 11:09:02,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {6602#(= main_~n~0 (+ main_~x~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6606#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-27 11:09:02,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {6606#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6610#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-27 11:09:02,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {6610#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6614#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} is VALID [2022-04-27 11:09:02,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {6614#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6618#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} is VALID [2022-04-27 11:09:02,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {6618#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} assume !(~x~0 % 4294967296 > 0); {6618#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} is VALID [2022-04-27 11:09:02,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {6618#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} ~z~0 := ~y~0; {6618#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} is VALID [2022-04-27 11:09:02,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {6618#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6614#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} is VALID [2022-04-27 11:09:02,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {6614#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6610#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-27 11:09:02,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {6610#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6606#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-27 11:09:02,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {6606#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6602#(= main_~n~0 (+ main_~x~0 2))} is VALID [2022-04-27 11:09:02,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {6602#(= main_~n~0 (+ main_~x~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6598#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-27 11:09:02,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {6598#(= (+ main_~x~0 1) main_~n~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6560#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:09:02,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {6560#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {6560#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:09:02,738 INFO L272 TraceCheckUtils]: 21: Hoare triple {6560#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6649#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:02,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {6649#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6653#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:02,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {6653#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6556#false} is VALID [2022-04-27 11:09:02,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {6556#false} assume !false; {6556#false} is VALID [2022-04-27 11:09:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:02,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:03,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {6556#false} assume !false; {6556#false} is VALID [2022-04-27 11:09:03,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {6653#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6556#false} is VALID [2022-04-27 11:09:03,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {6649#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6653#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:03,059 INFO L272 TraceCheckUtils]: 21: Hoare triple {6669#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6649#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:03,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {6669#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6669#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:09:03,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {6676#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6669#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:09:03,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {6680#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6676#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:09:03,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {6684#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6680#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:09:03,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {6688#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6684#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:09:03,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {6692#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6688#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:09:03,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {6696#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6692#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:09:03,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {6696#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {6696#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:09:03,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {6696#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6696#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:09:03,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {6692#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6696#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:09:03,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {6688#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6692#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:09:03,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {6684#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6688#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:09:03,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {6680#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6684#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:09:03,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {6676#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6680#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:09:03,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {6669#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6676#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:09:03,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {6555#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6669#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:09:03,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {6555#true} call #t~ret9 := main(); {6555#true} is VALID [2022-04-27 11:09:03,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6555#true} {6555#true} #50#return; {6555#true} is VALID [2022-04-27 11:09:03,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {6555#true} assume true; {6555#true} is VALID [2022-04-27 11:09:03,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {6555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6555#true} is VALID [2022-04-27 11:09:03,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {6555#true} call ULTIMATE.init(); {6555#true} is VALID [2022-04-27 11:09:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:03,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152809217] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:03,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:03,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 34 [2022-04-27 11:09:03,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500587786] [2022-04-27 11:09:03,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:03,072 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 31 states have internal predecessors, (55), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:09:03,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:03,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 31 states have internal predecessors, (55), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:03,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:03,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-27 11:09:03,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:03,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-27 11:09:03,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 11:09:03,170 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 31 states have internal predecessors, (55), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:05,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:05,082 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-27 11:09:05,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 11:09:05,083 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 31 states have internal predecessors, (55), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:09:05,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 31 states have internal predecessors, (55), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:05,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2022-04-27 11:09:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 31 states have internal predecessors, (55), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2022-04-27 11:09:05,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 43 transitions. [2022-04-27 11:09:05,135 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:09:05,136 INFO L225 Difference]: With dead ends: 78 [2022-04-27 11:09:05,136 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 11:09:05,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=209, Invalid=2143, Unknown=0, NotChecked=0, Total=2352 [2022-04-27 11:09:05,137 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:05,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 79 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:09:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 11:09:05,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2022-04-27 11:09:05,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:05,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 64 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:05,560 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 64 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:05,561 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 64 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:05,562 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2022-04-27 11:09:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2022-04-27 11:09:05,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:05,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:05,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-27 11:09:05,563 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-27 11:09:05,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:05,564 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2022-04-27 11:09:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2022-04-27 11:09:05,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:05,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:05,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:05,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:05,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2022-04-27 11:09:05,566 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 25 [2022-04-27 11:09:05,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:05,566 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-04-27 11:09:05,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 31 states have internal predecessors, (55), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:05,566 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2022-04-27 11:09:05,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 11:09:05,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:05,567 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:05,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:05,790 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:09:05,791 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:05,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:05,791 INFO L85 PathProgramCache]: Analyzing trace with hash -112387369, now seen corresponding path program 2 times [2022-04-27 11:09:05,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:05,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214493666] [2022-04-27 11:09:05,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:05,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:06,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:06,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {7189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7170#true} is VALID [2022-04-27 11:09:06,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {7170#true} assume true; {7170#true} is VALID [2022-04-27 11:09:06,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7170#true} {7170#true} #50#return; {7170#true} is VALID [2022-04-27 11:09:06,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {7170#true} call ULTIMATE.init(); {7189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:06,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {7189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7170#true} is VALID [2022-04-27 11:09:06,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {7170#true} assume true; {7170#true} is VALID [2022-04-27 11:09:06,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7170#true} {7170#true} #50#return; {7170#true} is VALID [2022-04-27 11:09:06,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {7170#true} call #t~ret9 := main(); {7170#true} is VALID [2022-04-27 11:09:06,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {7170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7175#(= main_~y~0 0)} is VALID [2022-04-27 11:09:06,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {7175#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:06,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {7176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:06,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {7177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:06,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {7178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:06,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {7179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:06,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {7180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:06,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {7181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:09:06,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {7182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:09:06,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {7183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:09:06,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {7184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:09:06,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {7185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:09:06,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {7186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:09:06,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:09:06,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {7188#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-27 11:09:06,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {7188#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7171#false} is VALID [2022-04-27 11:09:06,059 INFO L272 TraceCheckUtils]: 21: Hoare triple {7171#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7171#false} is VALID [2022-04-27 11:09:06,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {7171#false} ~cond := #in~cond; {7171#false} is VALID [2022-04-27 11:09:06,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {7171#false} assume 0 == ~cond; {7171#false} is VALID [2022-04-27 11:09:06,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {7171#false} assume !false; {7171#false} is VALID [2022-04-27 11:09:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:06,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:06,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214493666] [2022-04-27 11:09:06,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214493666] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:06,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804664979] [2022-04-27 11:09:06,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:09:06,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:06,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:06,064 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:06,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 11:09:06,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:09:06,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:06,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 11:09:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:06,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:06,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {7170#true} call ULTIMATE.init(); {7170#true} is VALID [2022-04-27 11:09:06,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {7170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7170#true} is VALID [2022-04-27 11:09:06,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {7170#true} assume true; {7170#true} is VALID [2022-04-27 11:09:06,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7170#true} {7170#true} #50#return; {7170#true} is VALID [2022-04-27 11:09:06,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {7170#true} call #t~ret9 := main(); {7170#true} is VALID [2022-04-27 11:09:06,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {7170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7175#(= main_~y~0 0)} is VALID [2022-04-27 11:09:06,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {7175#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:06,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {7176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:06,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {7177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:06,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {7178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:06,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {7179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:06,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {7180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:06,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {7181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:09:06,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {7182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:09:06,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {7183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:09:06,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {7184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:09:06,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {7185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:09:06,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {7186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:09:06,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:09:06,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {7250#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:09:06,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {7250#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7171#false} is VALID [2022-04-27 11:09:06,418 INFO L272 TraceCheckUtils]: 21: Hoare triple {7171#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7171#false} is VALID [2022-04-27 11:09:06,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {7171#false} ~cond := #in~cond; {7171#false} is VALID [2022-04-27 11:09:06,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {7171#false} assume 0 == ~cond; {7171#false} is VALID [2022-04-27 11:09:06,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {7171#false} assume !false; {7171#false} is VALID [2022-04-27 11:09:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:06,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:06,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {7171#false} assume !false; {7171#false} is VALID [2022-04-27 11:09:06,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {7171#false} assume 0 == ~cond; {7171#false} is VALID [2022-04-27 11:09:06,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {7171#false} ~cond := #in~cond; {7171#false} is VALID [2022-04-27 11:09:06,800 INFO L272 TraceCheckUtils]: 21: Hoare triple {7171#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7171#false} is VALID [2022-04-27 11:09:06,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {7278#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7171#false} is VALID [2022-04-27 11:09:06,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {7282#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {7278#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:09:06,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {7282#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7282#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:09:06,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {7289#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7282#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:09:06,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {7293#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7289#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:09:06,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {7297#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7293#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:09:06,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {7301#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7297#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:09:06,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {7305#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7301#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:09:06,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {7309#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7305#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:09:06,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {7313#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7309#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:09:06,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {7317#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7313#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:09:06,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {7321#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7317#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:09:06,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {7325#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7321#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:09:06,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {7329#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7325#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:09:06,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {7333#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7329#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:09:06,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {7170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7333#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-27 11:09:06,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {7170#true} call #t~ret9 := main(); {7170#true} is VALID [2022-04-27 11:09:06,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7170#true} {7170#true} #50#return; {7170#true} is VALID [2022-04-27 11:09:06,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {7170#true} assume true; {7170#true} is VALID [2022-04-27 11:09:06,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {7170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7170#true} is VALID [2022-04-27 11:09:06,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {7170#true} call ULTIMATE.init(); {7170#true} is VALID [2022-04-27 11:09:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:06,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804664979] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:06,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:06,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-27 11:09:06,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444103208] [2022-04-27 11:09:06,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:06,814 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:09:06,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:06,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:06,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:06,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-27 11:09:06,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:06,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-27 11:09:06,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2022-04-27 11:09:06,846 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:38,790 INFO L93 Difference]: Finished difference Result 185 states and 248 transitions. [2022-04-27 11:09:38,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-27 11:09:38,790 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:09:38,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 186 transitions. [2022-04-27 11:09:38,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 186 transitions. [2022-04-27 11:09:38,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 186 transitions. [2022-04-27 11:09:39,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:39,007 INFO L225 Difference]: With dead ends: 185 [2022-04-27 11:09:39,007 INFO L226 Difference]: Without dead ends: 180 [2022-04-27 11:09:39,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=1536, Invalid=4784, Unknown=0, NotChecked=0, Total=6320 [2022-04-27 11:09:39,009 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 613 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:39,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 115 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-27 11:09:39,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-27 11:09:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 73. [2022-04-27 11:09:39,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:39,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 73 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:39,541 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 73 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:39,541 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 73 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:39,544 INFO L93 Difference]: Finished difference Result 180 states and 230 transitions. [2022-04-27 11:09:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 230 transitions. [2022-04-27 11:09:39,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:39,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:39,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-27 11:09:39,546 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-27 11:09:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:39,549 INFO L93 Difference]: Finished difference Result 180 states and 230 transitions. [2022-04-27 11:09:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 230 transitions. [2022-04-27 11:09:39,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:39,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:39,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:39,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2022-04-27 11:09:39,552 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 25 [2022-04-27 11:09:39,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:39,552 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2022-04-27 11:09:39,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:39,552 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2022-04-27 11:09:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 11:09:39,552 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:39,553 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:39,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-27 11:09:39,767 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:09:39,767 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:39,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:39,768 INFO L85 PathProgramCache]: Analyzing trace with hash -135474548, now seen corresponding path program 15 times [2022-04-27 11:09:39,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:39,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076535089] [2022-04-27 11:09:39,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:39,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:39,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:39,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {8299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8282#true} is VALID [2022-04-27 11:09:39,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {8282#true} assume true; {8282#true} is VALID [2022-04-27 11:09:39,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8282#true} {8282#true} #50#return; {8282#true} is VALID [2022-04-27 11:09:39,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {8282#true} call ULTIMATE.init(); {8299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:39,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {8299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8282#true} is VALID [2022-04-27 11:09:39,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {8282#true} assume true; {8282#true} is VALID [2022-04-27 11:09:39,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8282#true} {8282#true} #50#return; {8282#true} is VALID [2022-04-27 11:09:39,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {8282#true} call #t~ret9 := main(); {8282#true} is VALID [2022-04-27 11:09:39,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {8282#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8287#(= main_~y~0 0)} is VALID [2022-04-27 11:09:39,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {8287#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8288#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:39,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {8288#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8289#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:39,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {8289#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8290#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:39,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {8290#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8291#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:39,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {8291#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:39,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:39,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {8293#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:09:39,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {8293#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8294#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:09:39,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {8294#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8295#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:09:39,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {8295#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8296#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:09:39,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {8296#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8297#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:09:39,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {8297#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8298#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:09:39,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {8298#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8283#false} is VALID [2022-04-27 11:09:39,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {8283#false} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8283#false} is VALID [2022-04-27 11:09:39,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {8283#false} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8283#false} is VALID [2022-04-27 11:09:39,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {8283#false} assume !(~z~0 % 4294967296 > 0); {8283#false} is VALID [2022-04-27 11:09:39,990 INFO L272 TraceCheckUtils]: 22: Hoare triple {8283#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8283#false} is VALID [2022-04-27 11:09:39,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {8283#false} ~cond := #in~cond; {8283#false} is VALID [2022-04-27 11:09:39,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {8283#false} assume 0 == ~cond; {8283#false} is VALID [2022-04-27 11:09:39,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {8283#false} assume !false; {8283#false} is VALID [2022-04-27 11:09:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:09:39,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:39,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076535089] [2022-04-27 11:09:39,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076535089] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:39,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620429557] [2022-04-27 11:09:39,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:09:39,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:39,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:39,996 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:39,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 11:09:40,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-04-27 11:09:40,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:40,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 11:09:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:40,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:40,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {8282#true} call ULTIMATE.init(); {8282#true} is VALID [2022-04-27 11:09:40,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {8282#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8282#true} is VALID [2022-04-27 11:09:40,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {8282#true} assume true; {8282#true} is VALID [2022-04-27 11:09:40,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8282#true} {8282#true} #50#return; {8282#true} is VALID [2022-04-27 11:09:40,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {8282#true} call #t~ret9 := main(); {8282#true} is VALID [2022-04-27 11:09:40,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {8282#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8287#(= main_~y~0 0)} is VALID [2022-04-27 11:09:40,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {8287#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8288#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:40,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {8288#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8289#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:40,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {8289#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8290#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:40,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {8290#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8291#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:40,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {8291#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:40,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:40,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {8293#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:09:40,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {8293#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8294#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:09:40,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {8294#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8295#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:09:40,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {8295#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8296#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:09:40,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {8296#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8297#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:09:40,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {8297#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8298#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:09:40,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {8298#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8357#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:09:40,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {8357#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8361#(and (<= (+ main_~z~0 2) 0) (<= 0 (+ main_~z~0 2)))} is VALID [2022-04-27 11:09:40,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {8361#(and (<= (+ main_~z~0 2) 0) (<= 0 (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8365#(and (<= 0 (+ main_~z~0 3)) (<= (+ main_~z~0 3) 0))} is VALID [2022-04-27 11:09:40,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {8365#(and (<= 0 (+ main_~z~0 3)) (<= (+ main_~z~0 3) 0))} assume !(~z~0 % 4294967296 > 0); {8283#false} is VALID [2022-04-27 11:09:40,380 INFO L272 TraceCheckUtils]: 22: Hoare triple {8283#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8283#false} is VALID [2022-04-27 11:09:40,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {8283#false} ~cond := #in~cond; {8283#false} is VALID [2022-04-27 11:09:40,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {8283#false} assume 0 == ~cond; {8283#false} is VALID [2022-04-27 11:09:40,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {8283#false} assume !false; {8283#false} is VALID [2022-04-27 11:09:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:40,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:40,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {8283#false} assume !false; {8283#false} is VALID [2022-04-27 11:09:40,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {8283#false} assume 0 == ~cond; {8283#false} is VALID [2022-04-27 11:09:40,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {8283#false} ~cond := #in~cond; {8283#false} is VALID [2022-04-27 11:09:40,797 INFO L272 TraceCheckUtils]: 22: Hoare triple {8283#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8283#false} is VALID [2022-04-27 11:09:40,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {8393#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8283#false} is VALID [2022-04-27 11:09:40,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {8397#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8393#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:09:40,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {8401#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8397#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:09:40,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {8405#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8401#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:09:40,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {8409#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8405#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:09:40,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {8413#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8409#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-27 11:09:40,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {8417#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8413#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-27 11:09:40,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {8421#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8417#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-27 11:09:40,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {8425#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8421#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-27 11:09:40,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {8429#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} ~z~0 := ~y~0; {8425#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-27 11:09:40,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {8429#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {8429#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-27 11:09:40,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {8436#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8429#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-27 11:09:40,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {8440#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8436#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:09:40,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {8444#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8440#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:09:40,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {8448#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8444#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:09:40,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {8452#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8448#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:09:40,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {8282#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8452#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:09:40,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {8282#true} call #t~ret9 := main(); {8282#true} is VALID [2022-04-27 11:09:40,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8282#true} {8282#true} #50#return; {8282#true} is VALID [2022-04-27 11:09:40,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {8282#true} assume true; {8282#true} is VALID [2022-04-27 11:09:40,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {8282#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8282#true} is VALID [2022-04-27 11:09:40,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {8282#true} call ULTIMATE.init(); {8282#true} is VALID [2022-04-27 11:09:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:40,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620429557] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:40,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:40,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 33 [2022-04-27 11:09:40,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809344540] [2022-04-27 11:09:40,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:40,811 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:09:40,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:40,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:40,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:40,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-27 11:09:40,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:40,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-27 11:09:40,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 11:09:40,851 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:09,197 INFO L93 Difference]: Finished difference Result 146 states and 196 transitions. [2022-04-27 11:10:09,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-04-27 11:10:09,198 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:10:09,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:10:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 140 transitions. [2022-04-27 11:10:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 140 transitions. [2022-04-27 11:10:09,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 140 transitions. [2022-04-27 11:10:09,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:10:09,658 INFO L225 Difference]: With dead ends: 146 [2022-04-27 11:10:09,659 INFO L226 Difference]: Without dead ends: 131 [2022-04-27 11:10:09,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3028 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=1479, Invalid=10731, Unknown=0, NotChecked=0, Total=12210 [2022-04-27 11:10:09,662 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 118 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:10:09,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 111 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-04-27 11:10:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-27 11:10:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2022-04-27 11:10:10,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:10:10,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 88 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:10,617 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 88 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:10,617 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 88 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:10,619 INFO L93 Difference]: Finished difference Result 131 states and 171 transitions. [2022-04-27 11:10:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 171 transitions. [2022-04-27 11:10:10,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:10:10,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:10:10,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-27 11:10:10,619 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-27 11:10:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:10,622 INFO L93 Difference]: Finished difference Result 131 states and 171 transitions. [2022-04-27 11:10:10,622 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 171 transitions. [2022-04-27 11:10:10,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:10:10,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:10:10,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:10:10,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:10:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 115 transitions. [2022-04-27 11:10:10,624 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 115 transitions. Word has length 26 [2022-04-27 11:10:10,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:10:10,624 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 115 transitions. [2022-04-27 11:10:10,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2022-04-27 11:10:10,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:10:10,625 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:10:10,625 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:10:10,649 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:10:10,849 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:10:10,849 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:10:10,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:10:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash -992485066, now seen corresponding path program 16 times [2022-04-27 11:10:10,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:10:10,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145870023] [2022-04-27 11:10:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:10:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:10:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:11,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:10:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:11,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {9344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9321#true} is VALID [2022-04-27 11:10:11,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {9321#true} assume true; {9321#true} is VALID [2022-04-27 11:10:11,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9321#true} {9321#true} #50#return; {9321#true} is VALID [2022-04-27 11:10:11,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {9321#true} call ULTIMATE.init(); {9344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:10:11,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {9344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9321#true} is VALID [2022-04-27 11:10:11,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {9321#true} assume true; {9321#true} is VALID [2022-04-27 11:10:11,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9321#true} {9321#true} #50#return; {9321#true} is VALID [2022-04-27 11:10:11,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {9321#true} call #t~ret9 := main(); {9321#true} is VALID [2022-04-27 11:10:11,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {9321#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9326#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:10:11,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {9326#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9327#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:10:11,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {9327#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9328#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:10:11,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {9328#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9329#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-27 11:10:11,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {9329#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9330#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:10:11,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {9330#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9331#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-27 11:10:11,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {9331#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9332#(and (<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-27 11:10:11,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {9332#(and (<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9333#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-27 11:10:11,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {9333#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {9334#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-27 11:10:11,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {9334#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} ~z~0 := ~y~0; {9334#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-27 11:10:11,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {9334#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9335#(and (<= (+ (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 6)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:10:11,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {9335#(and (<= (+ (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 6)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9336#(and (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ 5 main_~x~0)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0))} is VALID [2022-04-27 11:10:11,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {9336#(and (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ 5 main_~x~0)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9337#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 3) main_~x~0) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:10:11,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {9337#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 3) main_~x~0) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9338#(and (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-27 11:10:11,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {9338#(and (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9339#(and (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:10:11,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {9339#(and (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9340#(and (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 6) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:10:11,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {9340#(and (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 6) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9341#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:10:11,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {9341#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {9341#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:10:11,587 INFO L272 TraceCheckUtils]: 23: Hoare triple {9341#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9342#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:10:11,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {9342#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9343#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:10:11,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {9343#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9322#false} is VALID [2022-04-27 11:10:11,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {9322#false} assume !false; {9322#false} is VALID [2022-04-27 11:10:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:10:11,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:10:11,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145870023] [2022-04-27 11:10:11,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145870023] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:10:11,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962480201] [2022-04-27 11:10:11,588 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:10:11,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:10:11,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:10:11,592 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:10:11,594 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:10:11,632 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:10:11,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:10:11,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 11:10:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:11,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:10:11,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {9321#true} call ULTIMATE.init(); {9321#true} is VALID [2022-04-27 11:10:11,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {9321#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9321#true} is VALID [2022-04-27 11:10:11,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {9321#true} assume true; {9321#true} is VALID [2022-04-27 11:10:11,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9321#true} {9321#true} #50#return; {9321#true} is VALID [2022-04-27 11:10:11,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {9321#true} call #t~ret9 := main(); {9321#true} is VALID [2022-04-27 11:10:11,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {9321#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9326#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:10:11,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {9326#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9366#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-27 11:10:11,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {9366#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9370#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-27 11:10:11,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {9370#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9374#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-27 11:10:11,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {9374#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9378#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-27 11:10:11,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {9378#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9382#(= (+ main_~n~0 (- 3)) (+ main_~x~0 2))} is VALID [2022-04-27 11:10:11,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {9382#(= (+ main_~n~0 (- 3)) (+ main_~x~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9386#(= (+ main_~n~0 (- 3)) (+ main_~x~0 3))} is VALID [2022-04-27 11:10:11,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {9386#(= (+ main_~n~0 (- 3)) (+ main_~x~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9390#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} is VALID [2022-04-27 11:10:11,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {9390#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} assume !(~x~0 % 4294967296 > 0); {9390#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} is VALID [2022-04-27 11:10:11,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {9390#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} ~z~0 := ~y~0; {9390#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} is VALID [2022-04-27 11:10:11,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {9390#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9386#(= (+ main_~n~0 (- 3)) (+ main_~x~0 3))} is VALID [2022-04-27 11:10:11,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {9386#(= (+ main_~n~0 (- 3)) (+ main_~x~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9382#(= (+ main_~n~0 (- 3)) (+ main_~x~0 2))} is VALID [2022-04-27 11:10:11,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {9382#(= (+ main_~n~0 (- 3)) (+ main_~x~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9378#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-27 11:10:11,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {9378#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9374#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-27 11:10:11,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {9374#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9370#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-27 11:10:11,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {9370#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9366#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-27 11:10:11,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {9366#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9326#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:10:11,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {9326#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {9326#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:10:11,950 INFO L272 TraceCheckUtils]: 23: Hoare triple {9326#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:10:11,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {9424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:10:11,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {9428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9322#false} is VALID [2022-04-27 11:10:11,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {9322#false} assume !false; {9322#false} is VALID [2022-04-27 11:10:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:10:11,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:10:12,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {9322#false} assume !false; {9322#false} is VALID [2022-04-27 11:10:12,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {9428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9322#false} is VALID [2022-04-27 11:10:12,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {9424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:10:12,353 INFO L272 TraceCheckUtils]: 23: Hoare triple {9444#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:10:12,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {9444#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9444#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:10:12,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {9451#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9444#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:10:12,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {9455#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9451#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:10:12,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {9459#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9455#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:10:12,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {9463#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9459#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:10:12,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {9467#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9463#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:10:12,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {9471#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9467#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:10:12,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {9475#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9471#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:10:12,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {9475#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {9475#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:10:12,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {9475#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9475#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:10:12,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {9471#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9475#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:10:12,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {9467#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9471#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:10:12,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {9463#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9467#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:10:12,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {9459#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9463#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:10:12,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {9455#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9459#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:10:12,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {9451#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9455#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:10:12,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {9444#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9451#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:10:12,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {9321#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9444#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:10:12,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {9321#true} call #t~ret9 := main(); {9321#true} is VALID [2022-04-27 11:10:12,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9321#true} {9321#true} #50#return; {9321#true} is VALID [2022-04-27 11:10:12,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {9321#true} assume true; {9321#true} is VALID [2022-04-27 11:10:12,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {9321#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9321#true} is VALID [2022-04-27 11:10:12,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {9321#true} call ULTIMATE.init(); {9321#true} is VALID [2022-04-27 11:10:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:10:12,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962480201] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:10:12,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:10:12,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 38 [2022-04-27 11:10:12,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53713494] [2022-04-27 11:10:12,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:10:12,368 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 35 states have internal predecessors, (61), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 11:10:12,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:10:12,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 35 states have internal predecessors, (61), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:12,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:10:12,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-27 11:10:12,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:10:12,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-27 11:10:12,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 11:10:12,445 INFO L87 Difference]: Start difference. First operand 88 states and 115 transitions. Second operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 35 states have internal predecessors, (61), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:17,755 INFO L93 Difference]: Finished difference Result 100 states and 127 transitions. [2022-04-27 11:10:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 11:10:17,756 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 35 states have internal predecessors, (61), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 11:10:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:10:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 35 states have internal predecessors, (61), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2022-04-27 11:10:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 35 states have internal predecessors, (61), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2022-04-27 11:10:17,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 46 transitions. [2022-04-27 11:10:17,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:10:17,824 INFO L225 Difference]: With dead ends: 100 [2022-04-27 11:10:17,824 INFO L226 Difference]: Without dead ends: 95 [2022-04-27 11:10:17,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=237, Invalid=2733, Unknown=0, NotChecked=0, Total=2970 [2022-04-27 11:10:17,825 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:10:17,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 104 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 11:10:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-27 11:10:18,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2022-04-27 11:10:18,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:10:18,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 82 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:18,676 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 82 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:18,676 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 82 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:18,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:18,677 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2022-04-27 11:10:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2022-04-27 11:10:18,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:10:18,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:10:18,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-27 11:10:18,678 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-27 11:10:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:18,680 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2022-04-27 11:10:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2022-04-27 11:10:18,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:10:18,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:10:18,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:10:18,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:10:18,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2022-04-27 11:10:18,683 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 109 transitions. Word has length 27 [2022-04-27 11:10:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:10:18,683 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 109 transitions. [2022-04-27 11:10:18,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 35 states have internal predecessors, (61), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:18,684 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2022-04-27 11:10:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:10:18,684 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:10:18,684 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:10:18,713 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:10:18,905 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:10:18,905 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:10:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:10:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash 521429270, now seen corresponding path program 17 times [2022-04-27 11:10:18,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:10:18,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687583785] [2022-04-27 11:10:18,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:10:18,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:10:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:19,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:10:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:19,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {10095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10074#true} is VALID [2022-04-27 11:10:19,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {10074#true} assume true; {10074#true} is VALID [2022-04-27 11:10:19,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10074#true} {10074#true} #50#return; {10074#true} is VALID [2022-04-27 11:10:19,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {10074#true} call ULTIMATE.init(); {10095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:10:19,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {10095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10074#true} is VALID [2022-04-27 11:10:19,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {10074#true} assume true; {10074#true} is VALID [2022-04-27 11:10:19,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10074#true} {10074#true} #50#return; {10074#true} is VALID [2022-04-27 11:10:19,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {10074#true} call #t~ret9 := main(); {10074#true} is VALID [2022-04-27 11:10:19,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {10074#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10079#(= main_~y~0 0)} is VALID [2022-04-27 11:10:19,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {10079#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:10:19,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {10080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:10:19,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {10081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:10:19,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {10082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:10:19,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {10083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:10:19,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {10084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:10:19,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {10085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10086#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:10:19,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {10086#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10087#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:10:19,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {10087#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:10:19,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:10:19,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {10089#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:10:19,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {10089#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10090#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:10:19,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {10090#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10091#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:10:19,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {10091#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10092#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:10:19,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {10092#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10093#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:10:19,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {10093#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10094#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:10:19,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {10094#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {10075#false} is VALID [2022-04-27 11:10:19,191 INFO L272 TraceCheckUtils]: 23: Hoare triple {10075#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10075#false} is VALID [2022-04-27 11:10:19,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {10075#false} ~cond := #in~cond; {10075#false} is VALID [2022-04-27 11:10:19,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {10075#false} assume 0 == ~cond; {10075#false} is VALID [2022-04-27 11:10:19,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {10075#false} assume !false; {10075#false} is VALID [2022-04-27 11:10:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:10:19,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:10:19,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687583785] [2022-04-27 11:10:19,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687583785] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:10:19,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731238474] [2022-04-27 11:10:19,192 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:10:19,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:10:19,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:10:19,195 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:10:19,197 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:10:19,373 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 11:10:19,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:10:19,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 11:10:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:19,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:10:19,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {10074#true} call ULTIMATE.init(); {10074#true} is VALID [2022-04-27 11:10:19,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {10074#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10074#true} is VALID [2022-04-27 11:10:19,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {10074#true} assume true; {10074#true} is VALID [2022-04-27 11:10:19,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10074#true} {10074#true} #50#return; {10074#true} is VALID [2022-04-27 11:10:19,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {10074#true} call #t~ret9 := main(); {10074#true} is VALID [2022-04-27 11:10:19,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {10074#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10079#(= main_~y~0 0)} is VALID [2022-04-27 11:10:19,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {10079#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:10:19,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {10080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:10:19,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {10081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:10:19,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {10082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:10:19,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {10083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:10:19,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {10084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:10:19,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {10085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10086#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:10:19,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {10086#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10087#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:10:19,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {10087#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:10:19,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:10:19,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {10089#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:10:19,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {10089#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10090#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:10:19,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {10090#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10091#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:10:19,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {10091#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10092#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:10:19,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {10092#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10093#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:10:19,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {10093#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10162#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:10:19,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {10162#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {10075#false} is VALID [2022-04-27 11:10:19,672 INFO L272 TraceCheckUtils]: 23: Hoare triple {10075#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10075#false} is VALID [2022-04-27 11:10:19,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {10075#false} ~cond := #in~cond; {10075#false} is VALID [2022-04-27 11:10:19,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {10075#false} assume 0 == ~cond; {10075#false} is VALID [2022-04-27 11:10:19,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {10075#false} assume !false; {10075#false} is VALID [2022-04-27 11:10:19,672 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:10:19,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:10:20,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {10075#false} assume !false; {10075#false} is VALID [2022-04-27 11:10:20,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {10075#false} assume 0 == ~cond; {10075#false} is VALID [2022-04-27 11:10:20,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {10075#false} ~cond := #in~cond; {10075#false} is VALID [2022-04-27 11:10:20,095 INFO L272 TraceCheckUtils]: 23: Hoare triple {10075#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10075#false} is VALID [2022-04-27 11:10:20,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {10190#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10075#false} is VALID [2022-04-27 11:10:20,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {10194#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10190#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:10:20,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {10198#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10194#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:10:20,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {10202#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10198#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:10:20,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {10206#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10202#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:10:20,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {10210#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10206#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-27 11:10:20,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {10214#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {10210#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-27 11:10:20,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {10214#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10214#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:10:20,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {10221#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10214#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:10:20,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {10225#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10221#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:10:20,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {10229#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10225#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:10:20,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {10233#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10229#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:10:20,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {10237#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10233#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:10:20,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {10241#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10237#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:10:20,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {10245#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10241#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:10:20,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {10249#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10245#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:10:20,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {10253#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10249#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:10:20,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {10074#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10253#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:10:20,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {10074#true} call #t~ret9 := main(); {10074#true} is VALID [2022-04-27 11:10:20,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10074#true} {10074#true} #50#return; {10074#true} is VALID [2022-04-27 11:10:20,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {10074#true} assume true; {10074#true} is VALID [2022-04-27 11:10:20,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {10074#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10074#true} is VALID [2022-04-27 11:10:20,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {10074#true} call ULTIMATE.init(); {10074#true} is VALID [2022-04-27 11:10:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:10:20,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731238474] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:10:20,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:10:20,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-27 11:10:20,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043397898] [2022-04-27 11:10:20,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:10:20,106 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 11:10:20,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:10:20,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:20,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:10:20,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-27 11:10:20,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:10:20,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-27 11:10:20,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 11:10:20,140 INFO L87 Difference]: Start difference. First operand 82 states and 109 transitions. Second operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:34,832 WARN L232 SmtUtils]: Spent 6.77s 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:10:45,401 WARN L232 SmtUtils]: Spent 7.40s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:10:54,482 WARN L232 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:12:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:19,664 INFO L93 Difference]: Finished difference Result 197 states and 273 transitions. [2022-04-27 11:12:19,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-04-27 11:12:19,664 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 11:12:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:12:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 250 transitions. [2022-04-27 11:12:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 250 transitions. [2022-04-27 11:12:19,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 250 transitions. [2022-04-27 11:12:20,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:12:20,982 INFO L225 Difference]: With dead ends: 197 [2022-04-27 11:12:20,982 INFO L226 Difference]: Without dead ends: 192 [2022-04-27 11:12:20,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10109 ImplicationChecksByTransitivity, 111.8s TimeCoverageRelationStatistics Valid=6000, Invalid=23412, Unknown=0, NotChecked=0, Total=29412 [2022-04-27 11:12:20,986 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 365 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:12:20,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 101 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 11:12:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-04-27 11:12:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 91. [2022-04-27 11:12:22,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:12:22,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand has 91 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:22,169 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand has 91 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:22,170 INFO L87 Difference]: Start difference. First operand 192 states. Second operand has 91 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:22,173 INFO L93 Difference]: Finished difference Result 192 states and 242 transitions. [2022-04-27 11:12:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 242 transitions. [2022-04-27 11:12:22,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:22,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:22,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 192 states. [2022-04-27 11:12:22,174 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 192 states. [2022-04-27 11:12:22,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:22,177 INFO L93 Difference]: Finished difference Result 192 states and 242 transitions. [2022-04-27 11:12:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 242 transitions. [2022-04-27 11:12:22,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:22,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:22,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:12:22,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:12:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2022-04-27 11:12:22,179 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 122 transitions. Word has length 27 [2022-04-27 11:12:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:12:22,179 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-04-27 11:12:22,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2022-04-27 11:12:22,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 11:12:22,180 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:12:22,180 INFO L195 NwaCegarLoop]: trace histogram [9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:12:22,186 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:12:22,384 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:12:22,385 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:12:22,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:12:22,385 INFO L85 PathProgramCache]: Analyzing trace with hash 553613387, now seen corresponding path program 18 times [2022-04-27 11:12:22,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:12:22,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370666763] [2022-04-27 11:12:22,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:12:22,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:12:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:22,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:12:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:22,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {11483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11464#true} is VALID [2022-04-27 11:12:22,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {11464#true} assume true; {11464#true} is VALID [2022-04-27 11:12:22,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11464#true} {11464#true} #50#return; {11464#true} is VALID [2022-04-27 11:12:22,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {11464#true} call ULTIMATE.init(); {11483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:12:22,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {11483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11464#true} is VALID [2022-04-27 11:12:22,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {11464#true} assume true; {11464#true} is VALID [2022-04-27 11:12:22,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11464#true} {11464#true} #50#return; {11464#true} is VALID [2022-04-27 11:12:22,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {11464#true} call #t~ret9 := main(); {11464#true} is VALID [2022-04-27 11:12:22,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {11464#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11469#(= main_~y~0 0)} is VALID [2022-04-27 11:12:22,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {11469#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11470#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:22,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {11470#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11471#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:12:22,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {11471#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11472#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:22,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {11472#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11473#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:12:22,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {11473#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11474#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:12:22,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {11474#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:12:22,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:12:22,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {11476#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:12:22,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {11476#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11477#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:12:22,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {11477#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11478#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:12:22,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {11478#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11479#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:12:22,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {11479#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11480#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:12:22,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {11480#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11481#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:12:22,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {11481#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11482#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:12:22,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {11482#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11465#false} is VALID [2022-04-27 11:12:22,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {11465#false} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11465#false} is VALID [2022-04-27 11:12:22,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {11465#false} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11465#false} is VALID [2022-04-27 11:12:22,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {11465#false} assume !(~z~0 % 4294967296 > 0); {11465#false} is VALID [2022-04-27 11:12:22,642 INFO L272 TraceCheckUtils]: 24: Hoare triple {11465#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11465#false} is VALID [2022-04-27 11:12:22,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {11465#false} ~cond := #in~cond; {11465#false} is VALID [2022-04-27 11:12:22,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {11465#false} assume 0 == ~cond; {11465#false} is VALID [2022-04-27 11:12:22,642 INFO L290 TraceCheckUtils]: 27: Hoare triple {11465#false} assume !false; {11465#false} is VALID [2022-04-27 11:12:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:12:22,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:12:22,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370666763] [2022-04-27 11:12:22,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370666763] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:12:22,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840687646] [2022-04-27 11:12:22,642 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:12:22,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:12:22,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:12:22,648 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:12:22,649 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:12:22,736 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-27 11:12:22,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:12:22,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 11:12:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:22,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:12:23,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {11464#true} call ULTIMATE.init(); {11464#true} is VALID [2022-04-27 11:12:23,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {11464#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11464#true} is VALID [2022-04-27 11:12:23,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {11464#true} assume true; {11464#true} is VALID [2022-04-27 11:12:23,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11464#true} {11464#true} #50#return; {11464#true} is VALID [2022-04-27 11:12:23,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {11464#true} call #t~ret9 := main(); {11464#true} is VALID [2022-04-27 11:12:23,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {11464#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11469#(= main_~y~0 0)} is VALID [2022-04-27 11:12:23,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {11469#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11470#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:23,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {11470#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11471#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:12:23,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {11471#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11472#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:23,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {11472#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11473#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:12:23,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {11473#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11474#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:12:23,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {11474#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:12:23,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:12:23,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {11476#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:12:23,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {11476#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11477#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:12:23,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {11477#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11478#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:12:23,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {11478#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11479#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:12:23,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {11479#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11480#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:12:23,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {11480#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11481#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:12:23,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {11481#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11482#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:12:23,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {11482#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11547#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:12:23,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {11547#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11551#(and (<= (+ main_~z~0 2) 0) (<= 0 (+ main_~z~0 2)))} is VALID [2022-04-27 11:12:23,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {11551#(and (<= (+ main_~z~0 2) 0) (<= 0 (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11555#(and (<= 0 (+ main_~z~0 3)) (<= (+ main_~z~0 3) 0))} is VALID [2022-04-27 11:12:23,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {11555#(and (<= 0 (+ main_~z~0 3)) (<= (+ main_~z~0 3) 0))} assume !(~z~0 % 4294967296 > 0); {11465#false} is VALID [2022-04-27 11:12:23,076 INFO L272 TraceCheckUtils]: 24: Hoare triple {11465#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11465#false} is VALID [2022-04-27 11:12:23,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {11465#false} ~cond := #in~cond; {11465#false} is VALID [2022-04-27 11:12:23,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {11465#false} assume 0 == ~cond; {11465#false} is VALID [2022-04-27 11:12:23,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {11465#false} assume !false; {11465#false} is VALID [2022-04-27 11:12:23,076 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:12:23,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:12:23,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {11465#false} assume !false; {11465#false} is VALID [2022-04-27 11:12:23,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {11465#false} assume 0 == ~cond; {11465#false} is VALID [2022-04-27 11:12:23,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {11465#false} ~cond := #in~cond; {11465#false} is VALID [2022-04-27 11:12:23,532 INFO L272 TraceCheckUtils]: 24: Hoare triple {11465#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11465#false} is VALID [2022-04-27 11:12:23,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {11583#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11465#false} is VALID [2022-04-27 11:12:23,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {11587#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11583#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:12:23,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {11591#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11587#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:12:23,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {11595#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11591#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:12:23,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {11599#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11595#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:12:23,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {11603#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11599#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-27 11:12:23,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {11607#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11603#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-27 11:12:23,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {11611#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11607#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-27 11:12:23,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {11615#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11611#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-27 11:12:23,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {11619#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11615#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-27 11:12:23,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {11623#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} ~z~0 := ~y~0; {11619#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-27 11:12:23,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {11623#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !(~x~0 % 4294967296 > 0); {11623#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-27 11:12:23,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {11630#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11623#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-27 11:12:23,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {11634#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11630#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-27 11:12:23,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {11638#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11634#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:12:23,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {11642#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11638#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:12:23,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {11646#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11642#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:12:23,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {11650#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11646#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:12:23,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {11464#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11650#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:12:23,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {11464#true} call #t~ret9 := main(); {11464#true} is VALID [2022-04-27 11:12:23,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11464#true} {11464#true} #50#return; {11464#true} is VALID [2022-04-27 11:12:23,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {11464#true} assume true; {11464#true} is VALID [2022-04-27 11:12:23,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {11464#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11464#true} is VALID [2022-04-27 11:12:23,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {11464#true} call ULTIMATE.init(); {11464#true} is VALID [2022-04-27 11:12:23,548 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:12:23,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840687646] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:12:23,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:12:23,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 37 [2022-04-27 11:12:23,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674150196] [2022-04-27 11:12:23,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:12:23,549 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 11:12:23,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:12:23,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:23,587 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:12:23,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-27 11:12:23,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:12:23,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-27 11:12:23,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1123, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 11:12:23,588 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. Second operand has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:11,173 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:13:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:37,065 INFO L93 Difference]: Finished difference Result 176 states and 229 transitions. [2022-04-27 11:13:37,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-04-27 11:13:37,065 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 11:13:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 162 transitions. [2022-04-27 11:13:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 162 transitions. [2022-04-27 11:13:37,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 162 transitions. [2022-04-27 11:13:38,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:38,068 INFO L225 Difference]: With dead ends: 176 [2022-04-27 11:13:38,068 INFO L226 Difference]: Without dead ends: 160 [2022-04-27 11:13:38,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4793 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=2094, Invalid=15996, Unknown=0, NotChecked=0, Total=18090 [2022-04-27 11:13:38,070 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 148 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:38,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 114 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 14.5s Time] [2022-04-27 11:13:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-27 11:13:39,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 103. [2022-04-27 11:13:39,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:39,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 103 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:39,604 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 103 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:39,604 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 103 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:39,607 INFO L93 Difference]: Finished difference Result 160 states and 205 transitions. [2022-04-27 11:13:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2022-04-27 11:13:39,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:39,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:39,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 160 states. [2022-04-27 11:13:39,607 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 160 states. [2022-04-27 11:13:39,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:39,610 INFO L93 Difference]: Finished difference Result 160 states and 205 transitions. [2022-04-27 11:13:39,610 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2022-04-27 11:13:39,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:39,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:39,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:39,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2022-04-27 11:13:39,612 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 28 [2022-04-27 11:13:39,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:39,613 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2022-04-27 11:13:39,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2022-04-27 11:13:39,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 11:13:39,613 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:39,613 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:39,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-27 11:13:39,835 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:13:39,836 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:39,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:39,836 INFO L85 PathProgramCache]: Analyzing trace with hash -412950633, now seen corresponding path program 19 times [2022-04-27 11:13:39,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:39,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259504439] [2022-04-27 11:13:39,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:39,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:40,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:40,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {12729#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12704#true} is VALID [2022-04-27 11:13:40,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {12704#true} assume true; {12704#true} is VALID [2022-04-27 11:13:40,665 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12704#true} {12704#true} #50#return; {12704#true} is VALID [2022-04-27 11:13:40,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {12704#true} call ULTIMATE.init(); {12729#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:40,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {12729#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12704#true} is VALID [2022-04-27 11:13:40,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {12704#true} assume true; {12704#true} is VALID [2022-04-27 11:13:40,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12704#true} {12704#true} #50#return; {12704#true} is VALID [2022-04-27 11:13:40,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {12704#true} call #t~ret9 := main(); {12704#true} is VALID [2022-04-27 11:13:40,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {12704#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12709#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:40,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {12709#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12710#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:13:40,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {12710#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12711#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:13:40,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {12711#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12712#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-27 11:13:40,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {12712#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12713#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:13:40,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {12713#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12714#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-27 11:13:40,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {12714#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12715#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-27 11:13:40,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {12715#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12716#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-27 11:13:40,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {12716#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ 7 main_~x~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12717#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 8)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-27 11:13:40,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {12717#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 8)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {12718#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-27 11:13:40,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {12718#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} ~z~0 := ~y~0; {12718#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-27 11:13:40,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {12718#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12719#(and (<= (+ 1 (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296))) main_~x~0) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-27 11:13:40,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {12719#(and (<= (+ 1 (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296))) main_~x~0) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)) (<= main_~n~0 (+ 7 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12720#(and (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ 2 (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0))} is VALID [2022-04-27 11:13:40,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {12720#(and (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ 2 (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12721#(and (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-27 11:13:40,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {12721#(and (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12722#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 4) main_~x~0))} is VALID [2022-04-27 11:13:40,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {12722#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 4) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12723#(and (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-27 11:13:40,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {12723#(and (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 5) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12724#(and (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 6) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:13:40,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {12724#(and (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 6) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12725#(and (<= main_~x~0 (+ 7 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ 7 (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:13:40,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {12725#(and (<= main_~x~0 (+ 7 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ 7 (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12726#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:40,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {12726#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {12726#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:40,693 INFO L272 TraceCheckUtils]: 25: Hoare triple {12726#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12727#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:13:40,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {12727#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12728#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:13:40,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {12728#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12705#false} is VALID [2022-04-27 11:13:40,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {12705#false} assume !false; {12705#false} is VALID [2022-04-27 11:13:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:40,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:40,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259504439] [2022-04-27 11:13:40,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259504439] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:40,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490470478] [2022-04-27 11:13:40,694 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:13:40,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:40,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:40,696 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:13:40,704 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:13:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:40,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 11:13:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:40,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:41,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {12704#true} call ULTIMATE.init(); {12704#true} is VALID [2022-04-27 11:13:41,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {12704#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12704#true} is VALID [2022-04-27 11:13:41,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {12704#true} assume true; {12704#true} is VALID [2022-04-27 11:13:41,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12704#true} {12704#true} #50#return; {12704#true} is VALID [2022-04-27 11:13:41,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {12704#true} call #t~ret9 := main(); {12704#true} is VALID [2022-04-27 11:13:41,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {12704#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12709#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:41,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {12709#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12751#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-27 11:13:41,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {12751#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12755#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} is VALID [2022-04-27 11:13:41,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {12755#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12759#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-27 11:13:41,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {12759#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12763#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-27 11:13:41,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {12763#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12767#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} is VALID [2022-04-27 11:13:41,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {12767#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12771#(= (+ main_~x~0 2) (+ main_~n~0 (- 4)))} is VALID [2022-04-27 11:13:41,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {12771#(= (+ main_~x~0 2) (+ main_~n~0 (- 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12775#(= (+ main_~x~0 3) (+ main_~n~0 (- 4)))} is VALID [2022-04-27 11:13:41,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {12775#(= (+ main_~x~0 3) (+ main_~n~0 (- 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12779#(= (+ main_~x~0 4) (+ main_~n~0 (- 4)))} is VALID [2022-04-27 11:13:41,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {12779#(= (+ main_~x~0 4) (+ main_~n~0 (- 4)))} assume !(~x~0 % 4294967296 > 0); {12779#(= (+ main_~x~0 4) (+ main_~n~0 (- 4)))} is VALID [2022-04-27 11:13:41,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {12779#(= (+ main_~x~0 4) (+ main_~n~0 (- 4)))} ~z~0 := ~y~0; {12779#(= (+ main_~x~0 4) (+ main_~n~0 (- 4)))} is VALID [2022-04-27 11:13:41,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {12779#(= (+ main_~x~0 4) (+ main_~n~0 (- 4)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12775#(= (+ main_~x~0 3) (+ main_~n~0 (- 4)))} is VALID [2022-04-27 11:13:41,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {12775#(= (+ main_~x~0 3) (+ main_~n~0 (- 4)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12771#(= (+ main_~x~0 2) (+ main_~n~0 (- 4)))} is VALID [2022-04-27 11:13:41,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {12771#(= (+ main_~x~0 2) (+ main_~n~0 (- 4)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12767#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} is VALID [2022-04-27 11:13:41,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {12767#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12763#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-27 11:13:41,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {12763#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12759#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-27 11:13:41,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {12759#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12755#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} is VALID [2022-04-27 11:13:41,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {12755#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12751#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-27 11:13:41,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {12751#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12709#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:41,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {12709#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {12709#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:41,139 INFO L272 TraceCheckUtils]: 25: Hoare triple {12709#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12816#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:41,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {12816#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12820#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:41,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {12820#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12705#false} is VALID [2022-04-27 11:13:41,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {12705#false} assume !false; {12705#false} is VALID [2022-04-27 11:13:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:41,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:41,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {12705#false} assume !false; {12705#false} is VALID [2022-04-27 11:13:41,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {12820#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12705#false} is VALID [2022-04-27 11:13:41,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {12816#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12820#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:41,607 INFO L272 TraceCheckUtils]: 25: Hoare triple {12836#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12816#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:41,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {12836#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12836#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:41,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {12843#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12836#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:41,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {12847#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12843#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:41,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {12851#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12847#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:41,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {12855#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12851#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:13:41,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {12859#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12855#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:13:41,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {12863#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12859#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:13:41,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {12867#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12863#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:13:41,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {12871#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12867#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:13:41,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {12871#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {12871#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:13:41,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {12871#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {12871#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:13:41,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {12867#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12871#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:13:41,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {12863#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12867#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:13:41,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {12859#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12863#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:13:41,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {12855#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12859#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:13:41,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {12851#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12855#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:13:41,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {12847#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12851#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-27 11:13:41,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {12843#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12847#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:41,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {12836#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12843#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:41,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {12704#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12836#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:41,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {12704#true} call #t~ret9 := main(); {12704#true} is VALID [2022-04-27 11:13:41,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12704#true} {12704#true} #50#return; {12704#true} is VALID [2022-04-27 11:13:41,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {12704#true} assume true; {12704#true} is VALID [2022-04-27 11:13:41,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {12704#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12704#true} is VALID [2022-04-27 11:13:41,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {12704#true} call ULTIMATE.init(); {12704#true} is VALID [2022-04-27 11:13:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:41,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490470478] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:41,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:41,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 42 [2022-04-27 11:13:41,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700448768] [2022-04-27 11:13:41,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:41,621 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 39 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 11:13:41,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:41,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 39 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:41,693 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:13:41,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-27 11:13:41,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:41,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-27 11:13:41,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1588, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 11:13:41,694 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 39 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:46,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:46,010 INFO L93 Difference]: Finished difference Result 126 states and 156 transitions. [2022-04-27 11:13:46,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 11:13:46,010 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 39 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 11:13:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 39 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2022-04-27 11:13:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 39 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2022-04-27 11:13:46,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 49 transitions. [2022-04-27 11:13:46,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:46,064 INFO L225 Difference]: With dead ends: 126 [2022-04-27 11:13:46,064 INFO L226 Difference]: Without dead ends: 121 [2022-04-27 11:13:46,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=265, Invalid=3395, Unknown=0, NotChecked=0, Total=3660 [2022-04-27 11:13:46,065 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:46,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 114 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 11:13:46,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-27 11:13:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2022-04-27 11:13:47,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:47,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 104 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:47,634 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 104 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:47,634 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 104 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:47,635 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-27 11:13:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-27 11:13:47,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:47,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:47,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-27 11:13:47,636 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-27 11:13:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:47,638 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-27 11:13:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-27 11:13:47,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:47,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:47,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:47,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2022-04-27 11:13:47,640 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 29 [2022-04-27 11:13:47,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:47,640 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2022-04-27 11:13:47,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 39 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:47,641 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2022-04-27 11:13:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 11:13:47,641 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:47,641 INFO L195 NwaCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:47,667 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:13:47,859 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:13:47,859 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:47,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:47,860 INFO L85 PathProgramCache]: Analyzing trace with hash -673865428, now seen corresponding path program 20 times [2022-04-27 11:13:47,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:47,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846099963] [2022-04-27 11:13:47,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:47,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:48,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:48,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {13643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13622#true} is VALID [2022-04-27 11:13:48,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {13622#true} assume true; {13622#true} is VALID [2022-04-27 11:13:48,128 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13622#true} {13622#true} #50#return; {13622#true} is VALID [2022-04-27 11:13:48,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {13622#true} call ULTIMATE.init(); {13643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:48,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {13643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13622#true} is VALID [2022-04-27 11:13:48,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {13622#true} assume true; {13622#true} is VALID [2022-04-27 11:13:48,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13622#true} {13622#true} #50#return; {13622#true} is VALID [2022-04-27 11:13:48,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {13622#true} call #t~ret9 := main(); {13622#true} is VALID [2022-04-27 11:13:48,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {13622#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13627#(= main_~y~0 0)} is VALID [2022-04-27 11:13:48,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {13627#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13628#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:48,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {13628#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13629#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:48,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {13629#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13630#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:48,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {13630#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13631#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:48,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {13631#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13632#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:48,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {13632#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13633#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:13:48,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {13633#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:13:48,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:13:48,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {13635#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:13:48,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {13635#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13636#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:13:48,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {13636#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13637#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:13:48,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {13637#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13638#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:13:48,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {13638#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13639#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:13:48,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {13639#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13640#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:48,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {13640#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13641#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:48,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {13641#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13642#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:48,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {13642#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13623#false} is VALID [2022-04-27 11:13:48,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {13623#false} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13623#false} is VALID [2022-04-27 11:13:48,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {13623#false} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13623#false} is VALID [2022-04-27 11:13:48,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {13623#false} assume !(~z~0 % 4294967296 > 0); {13623#false} is VALID [2022-04-27 11:13:48,141 INFO L272 TraceCheckUtils]: 26: Hoare triple {13623#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13623#false} is VALID [2022-04-27 11:13:48,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {13623#false} ~cond := #in~cond; {13623#false} is VALID [2022-04-27 11:13:48,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {13623#false} assume 0 == ~cond; {13623#false} is VALID [2022-04-27 11:13:48,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {13623#false} assume !false; {13623#false} is VALID [2022-04-27 11:13:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:48,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:48,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846099963] [2022-04-27 11:13:48,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846099963] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:48,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969044373] [2022-04-27 11:13:48,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:13:48,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:48,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:48,144 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:13:48,145 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:13:48,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:13:48,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:48,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-27 11:13:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:48,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:48,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {13622#true} call ULTIMATE.init(); {13622#true} is VALID [2022-04-27 11:13:48,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {13622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13622#true} is VALID [2022-04-27 11:13:48,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {13622#true} assume true; {13622#true} is VALID [2022-04-27 11:13:48,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13622#true} {13622#true} #50#return; {13622#true} is VALID [2022-04-27 11:13:48,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {13622#true} call #t~ret9 := main(); {13622#true} is VALID [2022-04-27 11:13:48,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {13622#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13627#(= main_~y~0 0)} is VALID [2022-04-27 11:13:48,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {13627#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13628#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:48,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {13628#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13629#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:48,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {13629#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13630#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:48,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {13630#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13631#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:48,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {13631#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13632#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:48,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {13632#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13633#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:13:48,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {13633#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:13:48,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:13:48,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {13635#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:13:48,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {13635#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13636#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:13:48,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {13636#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13637#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:13:48,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {13637#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13638#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:13:48,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {13638#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13639#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:13:48,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {13639#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13640#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:48,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {13640#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13641#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:48,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {13641#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13642#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:48,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {13642#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13713#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:13:48,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {13713#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13717#(and (<= (+ main_~z~0 2) 0) (<= 0 (+ main_~z~0 2)))} is VALID [2022-04-27 11:13:48,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {13717#(and (<= (+ main_~z~0 2) 0) (<= 0 (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13721#(and (<= 0 (+ main_~z~0 3)) (<= (+ main_~z~0 3) 0))} is VALID [2022-04-27 11:13:48,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {13721#(and (<= 0 (+ main_~z~0 3)) (<= (+ main_~z~0 3) 0))} assume !(~z~0 % 4294967296 > 0); {13623#false} is VALID [2022-04-27 11:13:48,595 INFO L272 TraceCheckUtils]: 26: Hoare triple {13623#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13623#false} is VALID [2022-04-27 11:13:48,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {13623#false} ~cond := #in~cond; {13623#false} is VALID [2022-04-27 11:13:48,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {13623#false} assume 0 == ~cond; {13623#false} is VALID [2022-04-27 11:13:48,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {13623#false} assume !false; {13623#false} is VALID [2022-04-27 11:13:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:48,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:49,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {13623#false} assume !false; {13623#false} is VALID [2022-04-27 11:13:49,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {13623#false} assume 0 == ~cond; {13623#false} is VALID [2022-04-27 11:13:49,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {13623#false} ~cond := #in~cond; {13623#false} is VALID [2022-04-27 11:13:49,143 INFO L272 TraceCheckUtils]: 26: Hoare triple {13623#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13623#false} is VALID [2022-04-27 11:13:49,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {13749#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13623#false} is VALID [2022-04-27 11:13:49,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {13753#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13749#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:49,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {13757#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13753#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:49,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {13761#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13757#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:13:49,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {13765#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13761#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:13:49,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {13769#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13765#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-27 11:13:49,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {13773#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13769#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-27 11:13:49,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {13777#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13773#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-27 11:13:49,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {13781#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13777#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-27 11:13:49,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {13785#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13781#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-27 11:13:49,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {13789#(< 0 (mod (+ main_~z~0 4294967286) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13785#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-27 11:13:49,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {13793#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} ~z~0 := ~y~0; {13789#(< 0 (mod (+ main_~z~0 4294967286) 4294967296))} is VALID [2022-04-27 11:13:49,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {13793#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} assume !(~x~0 % 4294967296 > 0); {13793#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-27 11:13:49,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {13800#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13793#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-27 11:13:49,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {13804#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13800#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-27 11:13:49,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {13808#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13804#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-27 11:13:49,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {13812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13808#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:13:49,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {13816#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:13:49,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {13820#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13816#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:13:49,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {13824#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13820#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:13:49,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {13622#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13824#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:13:49,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {13622#true} call #t~ret9 := main(); {13622#true} is VALID [2022-04-27 11:13:49,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13622#true} {13622#true} #50#return; {13622#true} is VALID [2022-04-27 11:13:49,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {13622#true} assume true; {13622#true} is VALID [2022-04-27 11:13:49,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {13622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13622#true} is VALID [2022-04-27 11:13:49,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {13622#true} call ULTIMATE.init(); {13622#true} is VALID [2022-04-27 11:13:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:49,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969044373] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:49,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:49,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 41 [2022-04-27 11:13:49,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380182360] [2022-04-27 11:13:49,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:49,156 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 11:13:49,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:49,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:49,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:49,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-27 11:13:49,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:49,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-27 11:13:49,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1389, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 11:13:49,195 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:20,535 WARN L232 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:15:41,645 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:15:46,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:15:51,366 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:15:53,750 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:16:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:34,072 INFO L93 Difference]: Finished difference Result 192 states and 250 transitions. [2022-04-27 11:16:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-04-27 11:16:34,072 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 11:16:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:16:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 194 transitions. [2022-04-27 11:16:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 194 transitions. [2022-04-27 11:16:34,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 194 transitions. [2022-04-27 11:16:35,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:35,425 INFO L225 Difference]: With dead ends: 192 [2022-04-27 11:16:35,425 INFO L226 Difference]: Without dead ends: 175 [2022-04-27 11:16:35,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7207 ImplicationChecksByTransitivity, 88.7s TimeCoverageRelationStatistics Valid=2894, Invalid=22866, Unknown=0, NotChecked=0, Total=25760 [2022-04-27 11:16:35,427 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 186 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:16:35,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 136 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 36.9s Time] [2022-04-27 11:16:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-27 11:16:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 106. [2022-04-27 11:16:37,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:16:37,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 106 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:37,163 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 106 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:37,163 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 106 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:37,166 INFO L93 Difference]: Finished difference Result 175 states and 223 transitions. [2022-04-27 11:16:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 223 transitions. [2022-04-27 11:16:37,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:37,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:37,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 175 states. [2022-04-27 11:16:37,167 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 175 states. [2022-04-27 11:16:37,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:37,169 INFO L93 Difference]: Finished difference Result 175 states and 223 transitions. [2022-04-27 11:16:37,169 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 223 transitions. [2022-04-27 11:16:37,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:37,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:37,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:16:37,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:16:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 135 transitions. [2022-04-27 11:16:37,171 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 135 transitions. Word has length 30 [2022-04-27 11:16:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:16:37,171 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 135 transitions. [2022-04-27 11:16:37,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 135 transitions. [2022-04-27 11:16:37,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 11:16:37,172 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:16:37,172 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:16:37,179 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:16:37,377 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:16:37,377 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:16:37,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:16:37,377 INFO L85 PathProgramCache]: Analyzing trace with hash -122528469, now seen corresponding path program 21 times [2022-04-27 11:16:37,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:16:37,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576593682] [2022-04-27 11:16:37,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:16:37,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:16:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:37,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:16:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:37,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {15014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14990#true} is VALID [2022-04-27 11:16:37,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {14990#true} assume true; {14990#true} is VALID [2022-04-27 11:16:37,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14990#true} {14990#true} #50#return; {14990#true} is VALID [2022-04-27 11:16:37,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {14990#true} call ULTIMATE.init(); {15014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:16:37,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {15014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14990#true} is VALID [2022-04-27 11:16:37,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {14990#true} assume true; {14990#true} is VALID [2022-04-27 11:16:37,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14990#true} {14990#true} #50#return; {14990#true} is VALID [2022-04-27 11:16:37,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {14990#true} call #t~ret9 := main(); {14990#true} is VALID [2022-04-27 11:16:37,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {14990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14995#(= main_~y~0 0)} is VALID [2022-04-27 11:16:37,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {14995#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:37,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {14996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:37,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {14997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:37,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {14998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:37,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {14999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:16:37,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {15000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:37,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {15001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:16:37,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {15002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:16:37,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {15003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:16:37,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {15004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:16:37,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {15005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:16:37,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {15006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:16:37,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {15007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:16:37,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {15008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:16:37,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {15009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 11:16:37,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {15010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-27 11:16:37,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-27 11:16:37,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {15012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-27 11:16:37,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {15012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15013#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-27 11:16:37,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {15013#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {14991#false} is VALID [2022-04-27 11:16:37,751 INFO L272 TraceCheckUtils]: 26: Hoare triple {14991#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14991#false} is VALID [2022-04-27 11:16:37,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {14991#false} ~cond := #in~cond; {14991#false} is VALID [2022-04-27 11:16:37,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {14991#false} assume 0 == ~cond; {14991#false} is VALID [2022-04-27 11:16:37,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {14991#false} assume !false; {14991#false} is VALID [2022-04-27 11:16:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:16:37,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:16:37,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576593682] [2022-04-27 11:16:37,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576593682] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:16:37,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127322308] [2022-04-27 11:16:37,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:16:37,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:37,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:16:37,752 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:16:37,753 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:16:37,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-04-27 11:16:37,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:16:37,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-27 11:16:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:37,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:16:38,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {14990#true} call ULTIMATE.init(); {14990#true} is VALID [2022-04-27 11:16:38,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {14990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14990#true} is VALID [2022-04-27 11:16:38,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {14990#true} assume true; {14990#true} is VALID [2022-04-27 11:16:38,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14990#true} {14990#true} #50#return; {14990#true} is VALID [2022-04-27 11:16:38,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {14990#true} call #t~ret9 := main(); {14990#true} is VALID [2022-04-27 11:16:38,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {14990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14995#(= main_~y~0 0)} is VALID [2022-04-27 11:16:38,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {14995#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:38,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {14996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:38,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {14997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:38,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {14998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:38,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {14999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:16:38,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {15000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:38,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {15001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:16:38,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {15002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:16:38,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {15003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:16:38,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {15004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:16:38,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {15005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:16:38,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {15006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:16:38,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {15007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:16:38,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {15008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:16:38,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {15009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 11:16:38,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {15010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-27 11:16:38,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-27 11:16:38,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {15012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-27 11:16:38,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {15012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15090#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:16:38,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {15090#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {14991#false} is VALID [2022-04-27 11:16:38,325 INFO L272 TraceCheckUtils]: 26: Hoare triple {14991#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14991#false} is VALID [2022-04-27 11:16:38,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {14991#false} ~cond := #in~cond; {14991#false} is VALID [2022-04-27 11:16:38,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {14991#false} assume 0 == ~cond; {14991#false} is VALID [2022-04-27 11:16:38,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {14991#false} assume !false; {14991#false} is VALID [2022-04-27 11:16:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:16:38,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:16:38,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {14991#false} assume !false; {14991#false} is VALID [2022-04-27 11:16:38,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {14991#false} assume 0 == ~cond; {14991#false} is VALID [2022-04-27 11:16:38,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {14991#false} ~cond := #in~cond; {14991#false} is VALID [2022-04-27 11:16:38,901 INFO L272 TraceCheckUtils]: 26: Hoare triple {14991#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14991#false} is VALID [2022-04-27 11:16:38,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {15118#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {14991#false} is VALID [2022-04-27 11:16:38,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {15122#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15118#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:38,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {15126#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {15122#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:16:38,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {15126#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {15126#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:16:38,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {15133#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15126#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:16:38,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {15137#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15133#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:16:38,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {15141#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15137#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:16:38,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {15145#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15141#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:16:38,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {15149#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15145#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:16:38,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {15153#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15149#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:16:38,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {15157#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15153#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:16:38,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {15161#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15157#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:16:38,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {15165#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15161#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:16:38,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {15169#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15165#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:16:38,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {15173#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15169#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:16:38,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {15177#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15173#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:16:38,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {15181#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15177#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:16:38,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {15185#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15181#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-27 11:16:38,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {15189#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15185#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-27 11:16:38,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {15193#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15189#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-27 11:16:38,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {14990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15193#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-27 11:16:38,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {14990#true} call #t~ret9 := main(); {14990#true} is VALID [2022-04-27 11:16:38,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14990#true} {14990#true} #50#return; {14990#true} is VALID [2022-04-27 11:16:38,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {14990#true} assume true; {14990#true} is VALID [2022-04-27 11:16:38,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {14990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14990#true} is VALID [2022-04-27 11:16:38,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {14990#true} call ULTIMATE.init(); {14990#true} is VALID [2022-04-27 11:16:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:16:38,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127322308] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:16:38,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:16:38,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-27 11:16:38,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852964782] [2022-04-27 11:16:38,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:16:38,916 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 11:16:38,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:16:38,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:38,950 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:16:38,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-27 11:16:38,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:16:38,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-27 11:16:38,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 11:16:38,951 INFO L87 Difference]: Start difference. First operand 106 states and 135 transitions. Second operand has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:06,159 WARN L232 SmtUtils]: Spent 11.34s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:17:20,630 WARN L232 SmtUtils]: Spent 8.81s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:17:48,830 WARN L232 SmtUtils]: Spent 18.57s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:18:04,759 WARN L232 SmtUtils]: Spent 9.52s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:18:26,342 WARN L232 SmtUtils]: Spent 13.05s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:18:48,840 WARN L232 SmtUtils]: Spent 11.46s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:19:21,776 WARN L232 SmtUtils]: Spent 10.10s 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:19:38,187 WARN L232 SmtUtils]: Spent 11.14s 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:19:46,325 WARN L232 SmtUtils]: Spent 5.52s 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:20:24,377 WARN L232 SmtUtils]: Spent 15.42s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:20:35,466 WARN L232 SmtUtils]: Spent 5.82s 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:20:49,101 WARN L232 SmtUtils]: Spent 7.69s 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:21:10,055 WARN L232 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:21:27,698 WARN L232 SmtUtils]: Spent 5.74s 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:21:42,113 WARN L232 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)