/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/loop-acceleration/const_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:31:25,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:31:25,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:31:25,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:31:25,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:31:25,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:31:25,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:31:25,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:31:25,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:31:25,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:31:25,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:31:25,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:31:25,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:31:25,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:31:25,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:31:25,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:31:25,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:31:25,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:31:25,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:31:25,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:31:25,940 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:31:25,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:31:25,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:31:25,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:31:25,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:31:25,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:31:25,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:31:25,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:31:25,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:31:25,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:31:25,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:31:25,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:31:25,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:31:25,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:31:25,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:31:25,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:31:25,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:31:25,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:31:25,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:31:25,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:31:25,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:31:25,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:31:25,955 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 10:31:25,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:31:25,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:31:25,978 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:31:25,978 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:31:25,979 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:31:25,979 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:31:25,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:31:25,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:31:25,979 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:31:25,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:31:25,980 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:31:25,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:31:25,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:31:25,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:31:25,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:31:25,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:31:25,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:31:25,981 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:31:25,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:31:25,981 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:31:25,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:31:25,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:31:25,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:31:25,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:31:25,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:31:25,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:31:25,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:31:25,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:31:25,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:31:25,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:31:25,983 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:31:25,983 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:31:25,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:31:25,983 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 10:31:26,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:31:26,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:31:26,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:31:26,168 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:31:26,169 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:31:26,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/const_1-2.c [2022-04-27 10:31:26,210 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e3fdb65/b06c28ef3a504d93b22de9e49d1a733d/FLAG2a23fbaa4 [2022-04-27 10:31:26,545 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:31:26,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_1-2.c [2022-04-27 10:31:26,551 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e3fdb65/b06c28ef3a504d93b22de9e49d1a733d/FLAG2a23fbaa4 [2022-04-27 10:31:26,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e3fdb65/b06c28ef3a504d93b22de9e49d1a733d [2022-04-27 10:31:26,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:31:26,981 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:31:26,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:31:26,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:31:26,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:31:26,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:31:26" (1/1) ... [2022-04-27 10:31:26,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6394985b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:26, skipping insertion in model container [2022-04-27 10:31:26,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:31:26" (1/1) ... [2022-04-27 10:31:27,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:31:27,008 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:31:27,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_1-2.c[321,334] [2022-04-27 10:31:27,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:31:27,147 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:31:27,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_1-2.c[321,334] [2022-04-27 10:31:27,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:31:27,170 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:31:27,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:27 WrapperNode [2022-04-27 10:31:27,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:31:27,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:31:27,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:31:27,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:31:27,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:27" (1/1) ... [2022-04-27 10:31:27,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:27" (1/1) ... [2022-04-27 10:31:27,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:27" (1/1) ... [2022-04-27 10:31:27,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:27" (1/1) ... [2022-04-27 10:31:27,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:27" (1/1) ... [2022-04-27 10:31:27,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:27" (1/1) ... [2022-04-27 10:31:27,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:27" (1/1) ... [2022-04-27 10:31:27,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:31:27,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:31:27,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:31:27,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:31:27,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:27" (1/1) ... [2022-04-27 10:31:27,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:31:27,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:27,253 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 10:31:27,296 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 10:31:27,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:31:27,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:31:27,312 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:31:27,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:31:27,313 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:31:27,313 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:31:27,313 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:31:27,313 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:31:27,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:31:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:31:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:31:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:31:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:31:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:31:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:31:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:31:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:31:27,356 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:31:27,357 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:31:27,478 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:31:27,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:31:27,483 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:31:27,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:31:27 BoogieIcfgContainer [2022-04-27 10:31:27,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:31:27,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:31:27,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:31:27,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:31:27,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:31:26" (1/3) ... [2022-04-27 10:31:27,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292f8e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:31:27, skipping insertion in model container [2022-04-27 10:31:27,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:27" (2/3) ... [2022-04-27 10:31:27,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292f8e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:31:27, skipping insertion in model container [2022-04-27 10:31:27,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:31:27" (3/3) ... [2022-04-27 10:31:27,501 INFO L111 eAbstractionObserver]: Analyzing ICFG const_1-2.c [2022-04-27 10:31:27,524 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:31:27,524 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:31:27,579 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:31:27,583 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@19641b69, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@25a6cf5d [2022-04-27 10:31:27,584 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:31:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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 10:31:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:31:27,598 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:27,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:27,599 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:27,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:27,606 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-27 10:31:27,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:27,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551359137] [2022-04-27 10:31:27,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:27,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:27,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:27,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-27 10:31:27,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:31:27,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-27 10:31:27,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:27,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-27 10:31:27,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:31:27,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-27 10:31:27,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-27 10:31:27,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 1;~y~0 := 0; {21#true} is VALID [2022-04-27 10:31:27,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-27 10:31:27,731 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {22#false} is VALID [2022-04-27 10:31:27,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-27 10:31:27,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-27 10:31:27,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-27 10:31:27,732 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 10:31:27,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:27,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551359137] [2022-04-27 10:31:27,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551359137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:27,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:27,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:31:27,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029206852] [2022-04-27 10:31:27,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:27,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:27,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:27,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:27,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:27,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:31:27,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:27,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:31:27,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:31:27,781 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:27,834 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 10:31:27,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:31:27,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 10:31:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:27,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 10:31:27,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-27 10:31:27,874 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 10:31:27,879 INFO L225 Difference]: With dead ends: 29 [2022-04-27 10:31:27,879 INFO L226 Difference]: Without dead ends: 12 [2022-04-27 10:31:27,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:31:27,883 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:27,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:27,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-27 10:31:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-27 10:31:27,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:27,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:27,902 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:27,902 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:27,903 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 10:31:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 10:31:27,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:27,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:27,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 10:31:27,904 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 10:31:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:27,906 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 10:31:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 10:31:27,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:27,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:27,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:27,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-27 10:31:27,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-27 10:31:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:27,908 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-27 10:31:27,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:27,909 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 10:31:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:31:27,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:27,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:27,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:31:27,909 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:27,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:27,913 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-27 10:31:27,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:27,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103744475] [2022-04-27 10:31:27,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:27,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:27,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:27,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {110#true} is VALID [2022-04-27 10:31:27,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} assume true; {110#true} is VALID [2022-04-27 10:31:27,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110#true} {110#true} #34#return; {110#true} is VALID [2022-04-27 10:31:27,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {110#true} call ULTIMATE.init(); {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:27,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {110#true} is VALID [2022-04-27 10:31:27,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} assume true; {110#true} is VALID [2022-04-27 10:31:27,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110#true} {110#true} #34#return; {110#true} is VALID [2022-04-27 10:31:27,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {110#true} call #t~ret5 := main(); {110#true} is VALID [2022-04-27 10:31:27,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#true} ~x~0 := 1;~y~0 := 0; {115#(= main_~y~0 0)} is VALID [2022-04-27 10:31:27,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {115#(= main_~y~0 0)} assume !(~y~0 % 4294967296 < 1024); {111#false} is VALID [2022-04-27 10:31:27,963 INFO L272 TraceCheckUtils]: 7: Hoare triple {111#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {111#false} is VALID [2022-04-27 10:31:27,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#false} ~cond := #in~cond; {111#false} is VALID [2022-04-27 10:31:27,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {111#false} assume 0 == ~cond; {111#false} is VALID [2022-04-27 10:31:27,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {111#false} assume !false; {111#false} is VALID [2022-04-27 10:31:27,963 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 10:31:27,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:27,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103744475] [2022-04-27 10:31:27,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103744475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:27,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:27,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:31:27,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69369051] [2022-04-27 10:31:27,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:27,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:27,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:27,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:27,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:27,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:31:27,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:27,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:31:27,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:31:27,975 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:28,008 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 10:31:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:31:28,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:28,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 10:31:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 10:31:28,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-27 10:31:28,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:28,034 INFO L225 Difference]: With dead ends: 18 [2022-04-27 10:31:28,034 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 10:31:28,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:31:28,037 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:28,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 10:31:28,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 10:31:28,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:28,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:28,040 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:28,041 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:28,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:28,041 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:31:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:31:28,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:28,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:28,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 10:31:28,042 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 10:31:28,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:28,043 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:31:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:31:28,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:28,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:28,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:28,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 10:31:28,044 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 10:31:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:28,044 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 10:31:28,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:31:28,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:31:28,045 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:28,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:28,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:31:28,045 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:28,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:28,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-27 10:31:28,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:28,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564537025] [2022-04-27 10:31:28,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:28,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:28,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:28,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {196#true} is VALID [2022-04-27 10:31:28,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:31:28,128 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:31:28,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:28,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {196#true} is VALID [2022-04-27 10:31:28,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:31:28,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:31:28,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret5 := main(); {196#true} is VALID [2022-04-27 10:31:28,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} ~x~0 := 1;~y~0 := 0; {201#(= main_~y~0 0)} is VALID [2022-04-27 10:31:28,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {202#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 1))} is VALID [2022-04-27 10:31:28,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 1))} assume !(~y~0 % 4294967296 < 1024); {197#false} is VALID [2022-04-27 10:31:28,132 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {197#false} is VALID [2022-04-27 10:31:28,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} ~cond := #in~cond; {197#false} is VALID [2022-04-27 10:31:28,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} assume 0 == ~cond; {197#false} is VALID [2022-04-27 10:31:28,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 10:31:28,132 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 10:31:28,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:28,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564537025] [2022-04-27 10:31:28,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564537025] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:28,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184738079] [2022-04-27 10:31:28,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:28,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:28,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:28,163 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 10:31:28,167 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 10:31:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:28,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 10:31:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:28,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:28,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-27 10:31:28,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {196#true} is VALID [2022-04-27 10:31:28,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:31:28,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:31:28,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret5 := main(); {196#true} is VALID [2022-04-27 10:31:28,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} ~x~0 := 1;~y~0 := 0; {201#(= main_~y~0 0)} is VALID [2022-04-27 10:31:28,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {225#(= main_~y~0 1)} is VALID [2022-04-27 10:31:28,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {225#(= main_~y~0 1)} assume !(~y~0 % 4294967296 < 1024); {197#false} is VALID [2022-04-27 10:31:28,249 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {197#false} is VALID [2022-04-27 10:31:28,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} ~cond := #in~cond; {197#false} is VALID [2022-04-27 10:31:28,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} assume 0 == ~cond; {197#false} is VALID [2022-04-27 10:31:28,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 10:31:28,250 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 10:31:28,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:28,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 10:31:28,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} assume 0 == ~cond; {197#false} is VALID [2022-04-27 10:31:28,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} ~cond := #in~cond; {197#false} is VALID [2022-04-27 10:31:28,302 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {197#false} is VALID [2022-04-27 10:31:28,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {253#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {197#false} is VALID [2022-04-27 10:31:28,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {257#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {253#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-27 10:31:28,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} ~x~0 := 1;~y~0 := 0; {257#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-27 10:31:28,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret5 := main(); {196#true} is VALID [2022-04-27 10:31:28,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:31:28,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:31:28,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {196#true} is VALID [2022-04-27 10:31:28,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-27 10:31:28,304 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 10:31:28,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184738079] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:28,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:28,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 10:31:28,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259709798] [2022-04-27 10:31:28,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:28,306 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 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 12 [2022-04-27 10:31:28,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:28,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 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 10:31:28,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:28,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:31:28,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:28,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:31:28,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:31:28,320 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 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 10:31:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:28,459 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-27 10:31:28,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:31:28,459 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 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 12 [2022-04-27 10:31:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 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 10:31:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-04-27 10:31:28,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 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 10:31:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-04-27 10:31:28,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 23 transitions. [2022-04-27 10:31:28,480 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 10:31:28,481 INFO L225 Difference]: With dead ends: 21 [2022-04-27 10:31:28,481 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 10:31:28,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:31:28,482 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:28,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:28,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 10:31:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 10:31:28,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:28,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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 10:31:28,487 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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 10:31:28,488 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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 10:31:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:28,489 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:31:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:31:28,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:28,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:28,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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 16 states. [2022-04-27 10:31:28,489 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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 16 states. [2022-04-27 10:31:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:28,490 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:31:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:31:28,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:28,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:28,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:28,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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 10:31:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-27 10:31:28,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-04-27 10:31:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:28,492 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-27 10:31:28,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 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 10:31:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:31:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:31:28,493 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:28,493 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:28,510 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 10:31:28,710 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 10:31:28,710 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:28,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:28,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 2 times [2022-04-27 10:31:28,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:28,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284665589] [2022-04-27 10:31:28,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:28,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:28,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:28,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-27 10:31:28,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-27 10:31:28,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {379#true} {379#true} #34#return; {379#true} is VALID [2022-04-27 10:31:28,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:28,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-27 10:31:28,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-27 10:31:28,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #34#return; {379#true} is VALID [2022-04-27 10:31:28,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret5 := main(); {379#true} is VALID [2022-04-27 10:31:28,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} ~x~0 := 1;~y~0 := 0; {384#(= main_~y~0 0)} is VALID [2022-04-27 10:31:28,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {384#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {385#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 10:31:28,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {386#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 10:31:28,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {386#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {387#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 10:31:28,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {387#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {388#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 4))} is VALID [2022-04-27 10:31:28,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {388#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 4))} assume !(~y~0 % 4294967296 < 1024); {380#false} is VALID [2022-04-27 10:31:28,872 INFO L272 TraceCheckUtils]: 11: Hoare triple {380#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {380#false} is VALID [2022-04-27 10:31:28,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {380#false} ~cond := #in~cond; {380#false} is VALID [2022-04-27 10:31:28,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {380#false} assume 0 == ~cond; {380#false} is VALID [2022-04-27 10:31:28,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {380#false} assume !false; {380#false} is VALID [2022-04-27 10:31:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:28,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:28,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284665589] [2022-04-27 10:31:28,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284665589] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:28,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049805235] [2022-04-27 10:31:28,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:31:28,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:28,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:28,903 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 10:31:28,980 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 10:31:28,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:31:28,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:31:28,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 10:31:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:28,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:29,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {379#true} is VALID [2022-04-27 10:31:29,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-27 10:31:29,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-27 10:31:29,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #34#return; {379#true} is VALID [2022-04-27 10:31:29,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret5 := main(); {379#true} is VALID [2022-04-27 10:31:29,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} ~x~0 := 1;~y~0 := 0; {384#(= main_~y~0 0)} is VALID [2022-04-27 10:31:29,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {384#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {385#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 10:31:29,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {386#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 10:31:29,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {386#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {387#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 10:31:29,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {387#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {420#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 10:31:29,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {380#false} is VALID [2022-04-27 10:31:29,174 INFO L272 TraceCheckUtils]: 11: Hoare triple {380#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {380#false} is VALID [2022-04-27 10:31:29,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {380#false} ~cond := #in~cond; {380#false} is VALID [2022-04-27 10:31:29,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {380#false} assume 0 == ~cond; {380#false} is VALID [2022-04-27 10:31:29,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {380#false} assume !false; {380#false} is VALID [2022-04-27 10:31:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:29,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:29,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {380#false} assume !false; {380#false} is VALID [2022-04-27 10:31:29,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {380#false} assume 0 == ~cond; {380#false} is VALID [2022-04-27 10:31:29,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {380#false} ~cond := #in~cond; {380#false} is VALID [2022-04-27 10:31:29,273 INFO L272 TraceCheckUtils]: 11: Hoare triple {380#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {380#false} is VALID [2022-04-27 10:31:29,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {448#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {380#false} is VALID [2022-04-27 10:31:29,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {448#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-27 10:31:29,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {456#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {452#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-27 10:31:29,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {456#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-27 10:31:29,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {460#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-27 10:31:29,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} ~x~0 := 1;~y~0 := 0; {464#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-27 10:31:29,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret5 := main(); {379#true} is VALID [2022-04-27 10:31:29,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #34#return; {379#true} is VALID [2022-04-27 10:31:29,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-27 10:31:29,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-27 10:31:29,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {379#true} is VALID [2022-04-27 10:31:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:29,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049805235] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:29,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:29,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 10:31:29,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9921390] [2022-04-27 10:31:29,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:29,279 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 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 15 [2022-04-27 10:31:29,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:29,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 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 10:31:29,295 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 10:31:29,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:31:29,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:29,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:31:29,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:31:29,297 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 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 10:31:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:29,688 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-27 10:31:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 10:31:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 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 15 [2022-04-27 10:31:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:29,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 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 10:31:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 32 transitions. [2022-04-27 10:31:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 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 10:31:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 32 transitions. [2022-04-27 10:31:29,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 32 transitions. [2022-04-27 10:31:29,719 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 10:31:29,720 INFO L225 Difference]: With dead ends: 27 [2022-04-27 10:31:29,720 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 10:31:29,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-04-27 10:31:29,722 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:29,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:31:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 10:31:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-27 10:31:29,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:29,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:29,735 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:29,735 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:29,736 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 10:31:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 10:31:29,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:29,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:29,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 10:31:29,737 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 10:31:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:29,738 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 10:31:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 10:31:29,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:29,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:29,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:29,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-27 10:31:29,739 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 15 [2022-04-27 10:31:29,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:29,739 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-27 10:31:29,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 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 10:31:29,740 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 10:31:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 10:31:29,740 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:29,740 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:29,774 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 10:31:29,958 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 10:31:29,958 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:29,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:29,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 3 times [2022-04-27 10:31:29,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:29,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890610089] [2022-04-27 10:31:29,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:29,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:30,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:30,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {634#true} is VALID [2022-04-27 10:31:30,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {634#true} assume true; {634#true} is VALID [2022-04-27 10:31:30,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {634#true} {634#true} #34#return; {634#true} is VALID [2022-04-27 10:31:30,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {634#true} call ULTIMATE.init(); {650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:30,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {634#true} is VALID [2022-04-27 10:31:30,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {634#true} assume true; {634#true} is VALID [2022-04-27 10:31:30,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {634#true} {634#true} #34#return; {634#true} is VALID [2022-04-27 10:31:30,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {634#true} call #t~ret5 := main(); {634#true} is VALID [2022-04-27 10:31:30,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {634#true} ~x~0 := 1;~y~0 := 0; {639#(= main_~y~0 0)} is VALID [2022-04-27 10:31:30,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {639#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {640#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 10:31:30,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {640#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {641#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 10:31:30,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {642#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 10:31:30,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {642#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {643#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 10:31:30,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {643#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {644#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 10:31:30,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {644#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {645#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 10:31:30,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {645#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {646#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 10:31:30,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {647#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 10:31:30,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {647#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {648#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 10:31:30,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {648#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {649#(and (<= main_~y~0 10) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:31:30,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {649#(and (<= main_~y~0 10) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {635#false} is VALID [2022-04-27 10:31:30,195 INFO L272 TraceCheckUtils]: 17: Hoare triple {635#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {635#false} is VALID [2022-04-27 10:31:30,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {635#false} ~cond := #in~cond; {635#false} is VALID [2022-04-27 10:31:30,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {635#false} assume 0 == ~cond; {635#false} is VALID [2022-04-27 10:31:30,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {635#false} assume !false; {635#false} is VALID [2022-04-27 10:31:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:30,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:30,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890610089] [2022-04-27 10:31:30,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890610089] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:30,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523269314] [2022-04-27 10:31:30,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:31:30,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:30,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:30,220 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 10:31:30,235 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 10:31:30,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-27 10:31:30,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:31:30,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 10:31:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:30,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:30,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {634#true} call ULTIMATE.init(); {634#true} is VALID [2022-04-27 10:31:30,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {634#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {634#true} is VALID [2022-04-27 10:31:30,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {634#true} assume true; {634#true} is VALID [2022-04-27 10:31:30,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {634#true} {634#true} #34#return; {634#true} is VALID [2022-04-27 10:31:30,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {634#true} call #t~ret5 := main(); {634#true} is VALID [2022-04-27 10:31:30,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {634#true} ~x~0 := 1;~y~0 := 0; {639#(= main_~y~0 0)} is VALID [2022-04-27 10:31:30,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {639#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {640#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 10:31:30,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {640#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {641#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 10:31:30,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {642#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 10:31:30,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {642#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {643#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 10:31:30,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {643#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {644#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 10:31:30,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {644#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {645#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 10:31:30,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {645#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {646#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 10:31:30,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {647#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 10:31:30,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {647#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {648#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 10:31:30,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {648#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {699#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 10:31:30,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {699#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {635#false} is VALID [2022-04-27 10:31:30,489 INFO L272 TraceCheckUtils]: 17: Hoare triple {635#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {635#false} is VALID [2022-04-27 10:31:30,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {635#false} ~cond := #in~cond; {635#false} is VALID [2022-04-27 10:31:30,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {635#false} assume 0 == ~cond; {635#false} is VALID [2022-04-27 10:31:30,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {635#false} assume !false; {635#false} is VALID [2022-04-27 10:31:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:30,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:30,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {635#false} assume !false; {635#false} is VALID [2022-04-27 10:31:30,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {635#false} assume 0 == ~cond; {635#false} is VALID [2022-04-27 10:31:30,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {635#false} ~cond := #in~cond; {635#false} is VALID [2022-04-27 10:31:30,772 INFO L272 TraceCheckUtils]: 17: Hoare triple {635#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {635#false} is VALID [2022-04-27 10:31:30,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {727#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {635#false} is VALID [2022-04-27 10:31:30,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {727#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-27 10:31:30,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {735#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {731#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-27 10:31:30,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {739#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {735#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-27 10:31:30,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {743#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {739#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-27 10:31:30,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {747#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {743#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-27 10:31:30,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {751#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {747#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:31:30,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {755#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {751#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-27 10:31:30,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {759#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {755#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:31:30,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {763#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {759#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-27 10:31:30,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {767#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {763#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-27 10:31:30,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {634#true} ~x~0 := 1;~y~0 := 0; {767#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-27 10:31:30,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {634#true} call #t~ret5 := main(); {634#true} is VALID [2022-04-27 10:31:30,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {634#true} {634#true} #34#return; {634#true} is VALID [2022-04-27 10:31:30,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {634#true} assume true; {634#true} is VALID [2022-04-27 10:31:30,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {634#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {634#true} is VALID [2022-04-27 10:31:30,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {634#true} call ULTIMATE.init(); {634#true} is VALID [2022-04-27 10:31:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:30,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523269314] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:30,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:30,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-27 10:31:30,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774464415] [2022-04-27 10:31:30,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:30,782 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 10:31:30,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:30,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (4), 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 10:31:30,804 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 10:31:30,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 10:31:30,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:30,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 10:31:30,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-27 10:31:30,806 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (4), 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 10:31:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:34,446 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-27 10:31:34,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 10:31:34,446 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 10:31:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:34,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (4), 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 10:31:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 50 transitions. [2022-04-27 10:31:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (4), 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 10:31:34,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 50 transitions. [2022-04-27 10:31:34,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 50 transitions. [2022-04-27 10:31:34,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:34,573 INFO L225 Difference]: With dead ends: 39 [2022-04-27 10:31:34,574 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 10:31:34,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=643, Invalid=1613, Unknown=0, NotChecked=0, Total=2256 [2022-04-27 10:31:34,576 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:34,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:31:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 10:31:34,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 10:31:34,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:34,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:34,614 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:34,614 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:34,616 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-27 10:31:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-27 10:31:34,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:34,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:34,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 10:31:34,616 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 10:31:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:34,618 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-27 10:31:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-27 10:31:34,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:34,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:34,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:34,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-27 10:31:34,619 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 21 [2022-04-27 10:31:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:34,619 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-27 10:31:34,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (4), 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 10:31:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-27 10:31:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 10:31:34,620 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:34,620 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:34,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 10:31:34,837 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 10:31:34,837 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:34,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:34,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 4 times [2022-04-27 10:31:34,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:34,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416940394] [2022-04-27 10:31:34,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:34,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:35,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:35,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {1061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1033#true} is VALID [2022-04-27 10:31:35,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-27 10:31:35,308 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1033#true} {1033#true} #34#return; {1033#true} is VALID [2022-04-27 10:31:35,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {1033#true} call ULTIMATE.init(); {1061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:35,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1033#true} is VALID [2022-04-27 10:31:35,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-27 10:31:35,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1033#true} #34#return; {1033#true} is VALID [2022-04-27 10:31:35,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {1033#true} call #t~ret5 := main(); {1033#true} is VALID [2022-04-27 10:31:35,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {1033#true} ~x~0 := 1;~y~0 := 0; {1038#(= main_~y~0 0)} is VALID [2022-04-27 10:31:35,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {1038#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1039#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 10:31:35,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {1039#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1040#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 10:31:35,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {1040#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1041#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 10:31:35,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {1041#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1042#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 10:31:35,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {1042#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1043#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 10:31:35,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {1043#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1044#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 10:31:35,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {1044#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1045#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 10:31:35,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {1045#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1046#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 10:31:35,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {1046#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1047#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 10:31:35,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {1047#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1048#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 10:31:35,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {1048#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1049#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 10:31:35,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {1049#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1050#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 10:31:35,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {1050#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1051#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 10:31:35,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {1051#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1052#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 10:31:35,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {1052#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1053#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 10:31:35,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {1053#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1054#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-27 10:31:35,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {1054#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1055#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-27 10:31:35,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {1055#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1056#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-27 10:31:35,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {1056#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1057#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-27 10:31:35,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {1057#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1058#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-27 10:31:35,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {1058#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1059#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-27 10:31:35,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {1059#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1060#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 22))} is VALID [2022-04-27 10:31:35,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {1060#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 22))} assume !(~y~0 % 4294967296 < 1024); {1034#false} is VALID [2022-04-27 10:31:35,328 INFO L272 TraceCheckUtils]: 29: Hoare triple {1034#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1034#false} is VALID [2022-04-27 10:31:35,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {1034#false} ~cond := #in~cond; {1034#false} is VALID [2022-04-27 10:31:35,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {1034#false} assume 0 == ~cond; {1034#false} is VALID [2022-04-27 10:31:35,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2022-04-27 10:31:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:35,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:35,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416940394] [2022-04-27 10:31:35,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416940394] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:35,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593577321] [2022-04-27 10:31:35,329 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:31:35,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:35,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:35,330 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 10:31:35,346 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 10:31:35,402 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:31:35,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:31:35,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-27 10:31:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:35,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:35,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {1033#true} call ULTIMATE.init(); {1033#true} is VALID [2022-04-27 10:31:35,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1033#true} is VALID [2022-04-27 10:31:35,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-27 10:31:35,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1033#true} #34#return; {1033#true} is VALID [2022-04-27 10:31:35,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {1033#true} call #t~ret5 := main(); {1033#true} is VALID [2022-04-27 10:31:35,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {1033#true} ~x~0 := 1;~y~0 := 0; {1038#(= main_~y~0 0)} is VALID [2022-04-27 10:31:35,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {1038#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1039#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 10:31:35,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {1039#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1040#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 10:31:35,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {1040#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1041#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 10:31:35,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {1041#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1042#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 10:31:35,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {1042#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1043#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 10:31:35,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {1043#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1044#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 10:31:35,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {1044#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1045#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 10:31:35,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {1045#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1046#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 10:31:35,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {1046#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1047#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 10:31:35,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {1047#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1048#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 10:31:35,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {1048#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1049#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 10:31:35,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {1049#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1050#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 10:31:35,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {1050#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1051#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 10:31:35,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {1051#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1052#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 10:31:35,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {1052#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1053#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 10:31:35,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {1053#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1054#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-27 10:31:35,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {1054#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1055#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-27 10:31:35,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {1055#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1056#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-27 10:31:35,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {1056#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1057#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-27 10:31:35,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {1057#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1058#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-27 10:31:35,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {1058#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1059#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-27 10:31:35,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {1059#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1146#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-27 10:31:35,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {1146#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {1034#false} is VALID [2022-04-27 10:31:35,806 INFO L272 TraceCheckUtils]: 29: Hoare triple {1034#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1034#false} is VALID [2022-04-27 10:31:35,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {1034#false} ~cond := #in~cond; {1034#false} is VALID [2022-04-27 10:31:35,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {1034#false} assume 0 == ~cond; {1034#false} is VALID [2022-04-27 10:31:35,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2022-04-27 10:31:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:35,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:36,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2022-04-27 10:31:36,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {1034#false} assume 0 == ~cond; {1034#false} is VALID [2022-04-27 10:31:36,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {1034#false} ~cond := #in~cond; {1034#false} is VALID [2022-04-27 10:31:36,714 INFO L272 TraceCheckUtils]: 29: Hoare triple {1034#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1034#false} is VALID [2022-04-27 10:31:36,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {1174#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {1034#false} is VALID [2022-04-27 10:31:36,719 INFO L290 TraceCheckUtils]: 27: Hoare triple {1178#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1174#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-27 10:31:36,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {1182#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1178#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {1186#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1182#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {1190#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1186#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {1194#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1190#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {1198#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1194#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {1202#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1198#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {1206#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1202#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {1210#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1206#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {1214#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1210#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {1218#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1214#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {1222#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1218#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {1226#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1222#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {1230#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1226#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {1234#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1230#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {1238#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1234#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {1242#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1238#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {1246#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1242#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {1250#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1246#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {1254#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1250#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {1258#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1254#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {1262#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1258#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {1033#true} ~x~0 := 1;~y~0 := 0; {1262#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-27 10:31:36,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {1033#true} call #t~ret5 := main(); {1033#true} is VALID [2022-04-27 10:31:36,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1033#true} #34#return; {1033#true} is VALID [2022-04-27 10:31:36,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-27 10:31:36,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1033#true} is VALID [2022-04-27 10:31:36,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {1033#true} call ULTIMATE.init(); {1033#true} is VALID [2022-04-27 10:31:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:36,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593577321] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:36,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:36,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-27 10:31:36,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400773910] [2022-04-27 10:31:36,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:36,743 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 10:31:36,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:36,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 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 10:31:36,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:36,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 10:31:36,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:36,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 10:31:36,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 10:31:36,780 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 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 10:32:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:32:57,373 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2022-04-27 10:32:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-27 10:32:57,373 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 10:32:57,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:32:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 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 10:32:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 86 transitions. [2022-04-27 10:32:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 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 10:32:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 86 transitions. [2022-04-27 10:32:57,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 86 transitions. [2022-04-27 10:32:57,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:32:57,612 INFO L225 Difference]: With dead ends: 63 [2022-04-27 10:32:57,612 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 10:32:57,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 80.2s TimeCoverageRelationStatistics Valid=2443, Invalid=6677, Unknown=0, NotChecked=0, Total=9120 [2022-04-27 10:32:57,614 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 10:32:57,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 10:32:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 10:32:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 10:32:57,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:32:57,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:32:57,675 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:32:57,676 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:32:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:32:57,677 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-27 10:32:57,677 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-27 10:32:57,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:32:57,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:32:57,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-27 10:32:57,678 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-27 10:32:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:32:57,679 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-27 10:32:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-27 10:32:57,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:32:57,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:32:57,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:32:57,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:32:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:32:57,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-27 10:32:57,682 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 33 [2022-04-27 10:32:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:32:57,682 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-27 10:32:57,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 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 10:32:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-27 10:32:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-27 10:32:57,683 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:32:57,683 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:32:57,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 10:32:57,893 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 10:32:57,893 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:32:57,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:32:57,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1947289956, now seen corresponding path program 5 times [2022-04-27 10:32:57,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:32:57,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998435079] [2022-04-27 10:32:57,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:32:57,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:32:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:59,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:32:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:59,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {1772#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1720#true} is VALID [2022-04-27 10:32:59,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {1720#true} assume true; {1720#true} is VALID [2022-04-27 10:32:59,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1720#true} {1720#true} #34#return; {1720#true} is VALID [2022-04-27 10:32:59,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {1720#true} call ULTIMATE.init(); {1772#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:32:59,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {1772#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1720#true} is VALID [2022-04-27 10:32:59,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {1720#true} assume true; {1720#true} is VALID [2022-04-27 10:32:59,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1720#true} {1720#true} #34#return; {1720#true} is VALID [2022-04-27 10:32:59,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {1720#true} call #t~ret5 := main(); {1720#true} is VALID [2022-04-27 10:32:59,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {1720#true} ~x~0 := 1;~y~0 := 0; {1725#(= main_~y~0 0)} is VALID [2022-04-27 10:32:59,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {1725#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1726#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 10:32:59,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {1726#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1727#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 10:32:59,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {1727#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1728#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 10:32:59,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {1728#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1729#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 10:32:59,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {1729#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1730#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 10:32:59,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {1730#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1731#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 10:32:59,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {1731#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1732#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 10:32:59,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {1732#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1733#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 10:32:59,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {1733#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1734#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 10:32:59,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {1734#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1735#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 10:32:59,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {1735#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1736#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 10:32:59,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {1736#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1737#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 10:32:59,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {1737#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1738#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 10:32:59,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {1738#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1739#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 10:32:59,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {1739#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1740#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 10:32:59,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {1740#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1741#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-27 10:32:59,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {1741#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1742#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-27 10:32:59,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {1742#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1743#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-27 10:32:59,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {1743#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1744#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-27 10:32:59,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {1744#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1745#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-27 10:32:59,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {1745#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1746#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-27 10:32:59,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {1746#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1747#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-27 10:32:59,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {1747#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1748#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-27 10:32:59,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {1748#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1749#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-27 10:32:59,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {1749#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1750#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-27 10:32:59,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {1750#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1751#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-27 10:32:59,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {1751#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1752#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-27 10:32:59,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {1752#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1753#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-27 10:32:59,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {1753#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1754#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-27 10:32:59,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {1754#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1755#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-27 10:32:59,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {1755#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1756#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-27 10:32:59,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {1756#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1757#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-27 10:32:59,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {1757#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1758#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-27 10:32:59,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {1758#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1759#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-27 10:32:59,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {1759#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1760#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-27 10:32:59,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {1760#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1761#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-27 10:32:59,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {1761#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1762#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-27 10:32:59,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {1762#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1763#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-27 10:32:59,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {1763#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1764#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-27 10:32:59,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {1764#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1765#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-27 10:32:59,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {1765#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1766#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-27 10:32:59,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {1766#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1767#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-27 10:32:59,246 INFO L290 TraceCheckUtils]: 48: Hoare triple {1767#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1768#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-27 10:32:59,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {1768#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1769#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-27 10:32:59,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {1769#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1770#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-27 10:32:59,249 INFO L290 TraceCheckUtils]: 51: Hoare triple {1770#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1771#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 46))} is VALID [2022-04-27 10:32:59,249 INFO L290 TraceCheckUtils]: 52: Hoare triple {1771#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 46))} assume !(~y~0 % 4294967296 < 1024); {1721#false} is VALID [2022-04-27 10:32:59,249 INFO L272 TraceCheckUtils]: 53: Hoare triple {1721#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1721#false} is VALID [2022-04-27 10:32:59,250 INFO L290 TraceCheckUtils]: 54: Hoare triple {1721#false} ~cond := #in~cond; {1721#false} is VALID [2022-04-27 10:32:59,250 INFO L290 TraceCheckUtils]: 55: Hoare triple {1721#false} assume 0 == ~cond; {1721#false} is VALID [2022-04-27 10:32:59,250 INFO L290 TraceCheckUtils]: 56: Hoare triple {1721#false} assume !false; {1721#false} is VALID [2022-04-27 10:32:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:32:59,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:32:59,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998435079] [2022-04-27 10:32:59,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998435079] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:32:59,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328113731] [2022-04-27 10:32:59,251 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 10:32:59,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:32:59,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:32:59,257 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 10:32:59,258 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 10:33:36,275 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-04-27 10:33:36,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:33:36,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 95 conjunts are in the unsatisfiable core [2022-04-27 10:33:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:33:36,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:33:36,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {1720#true} call ULTIMATE.init(); {1720#true} is VALID [2022-04-27 10:33:36,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {1720#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1720#true} is VALID [2022-04-27 10:33:36,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {1720#true} assume true; {1720#true} is VALID [2022-04-27 10:33:36,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1720#true} {1720#true} #34#return; {1720#true} is VALID [2022-04-27 10:33:36,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {1720#true} call #t~ret5 := main(); {1720#true} is VALID [2022-04-27 10:33:36,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {1720#true} ~x~0 := 1;~y~0 := 0; {1725#(= main_~y~0 0)} is VALID [2022-04-27 10:33:36,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {1725#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1726#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 10:33:36,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {1726#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1727#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 10:33:36,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {1727#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1728#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 10:33:36,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {1728#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1729#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 10:33:36,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {1729#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1730#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 10:33:36,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {1730#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1731#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 10:33:36,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {1731#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1732#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 10:33:36,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {1732#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1733#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 10:33:36,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {1733#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1734#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 10:33:36,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {1734#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1735#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 10:33:36,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {1735#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1736#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 10:33:36,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {1736#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1737#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 10:33:36,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {1737#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1738#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 10:33:36,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {1738#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1739#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 10:33:36,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {1739#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1740#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 10:33:36,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {1740#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1741#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-27 10:33:36,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {1741#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1742#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-27 10:33:36,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {1742#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1743#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-27 10:33:36,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {1743#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1744#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-27 10:33:36,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {1744#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1745#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-27 10:33:36,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {1745#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1746#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-27 10:33:36,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {1746#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1747#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-27 10:33:36,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {1747#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1748#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-27 10:33:36,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {1748#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1749#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-27 10:33:36,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {1749#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1750#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-27 10:33:36,867 INFO L290 TraceCheckUtils]: 31: Hoare triple {1750#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1751#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-27 10:33:36,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {1751#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1752#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-27 10:33:36,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {1752#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1753#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-27 10:33:36,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {1753#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1754#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-27 10:33:36,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {1754#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1755#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-27 10:33:36,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {1755#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1756#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-27 10:33:36,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {1756#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1757#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-27 10:33:36,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {1757#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1758#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-27 10:33:36,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {1758#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1759#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-27 10:33:36,877 INFO L290 TraceCheckUtils]: 40: Hoare triple {1759#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1760#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-27 10:33:36,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {1760#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1761#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-27 10:33:36,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {1761#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1762#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-27 10:33:36,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {1762#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1763#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-27 10:33:36,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {1763#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1764#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-27 10:33:36,887 INFO L290 TraceCheckUtils]: 45: Hoare triple {1764#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1765#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-27 10:33:36,896 INFO L290 TraceCheckUtils]: 46: Hoare triple {1765#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1766#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-27 10:33:36,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {1766#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1767#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-27 10:33:36,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {1767#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1768#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-27 10:33:36,897 INFO L290 TraceCheckUtils]: 49: Hoare triple {1768#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1769#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-27 10:33:36,898 INFO L290 TraceCheckUtils]: 50: Hoare triple {1769#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1770#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-27 10:33:36,898 INFO L290 TraceCheckUtils]: 51: Hoare triple {1770#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1929#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-27 10:33:36,899 INFO L290 TraceCheckUtils]: 52: Hoare triple {1929#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {1721#false} is VALID [2022-04-27 10:33:36,899 INFO L272 TraceCheckUtils]: 53: Hoare triple {1721#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1721#false} is VALID [2022-04-27 10:33:36,899 INFO L290 TraceCheckUtils]: 54: Hoare triple {1721#false} ~cond := #in~cond; {1721#false} is VALID [2022-04-27 10:33:36,899 INFO L290 TraceCheckUtils]: 55: Hoare triple {1721#false} assume 0 == ~cond; {1721#false} is VALID [2022-04-27 10:33:36,899 INFO L290 TraceCheckUtils]: 56: Hoare triple {1721#false} assume !false; {1721#false} is VALID [2022-04-27 10:33:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:33:36,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:33:39,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {1721#false} assume !false; {1721#false} is VALID [2022-04-27 10:33:39,701 INFO L290 TraceCheckUtils]: 55: Hoare triple {1721#false} assume 0 == ~cond; {1721#false} is VALID [2022-04-27 10:33:39,701 INFO L290 TraceCheckUtils]: 54: Hoare triple {1721#false} ~cond := #in~cond; {1721#false} is VALID [2022-04-27 10:33:39,701 INFO L272 TraceCheckUtils]: 53: Hoare triple {1721#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1721#false} is VALID [2022-04-27 10:33:39,705 INFO L290 TraceCheckUtils]: 52: Hoare triple {1957#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {1721#false} is VALID [2022-04-27 10:33:39,706 INFO L290 TraceCheckUtils]: 51: Hoare triple {1961#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1957#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-27 10:33:39,707 INFO L290 TraceCheckUtils]: 50: Hoare triple {1965#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1961#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,707 INFO L290 TraceCheckUtils]: 49: Hoare triple {1969#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1965#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,708 INFO L290 TraceCheckUtils]: 48: Hoare triple {1973#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1969#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,708 INFO L290 TraceCheckUtils]: 47: Hoare triple {1977#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1973#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,709 INFO L290 TraceCheckUtils]: 46: Hoare triple {1981#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1977#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,710 INFO L290 TraceCheckUtils]: 45: Hoare triple {1985#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1981#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,710 INFO L290 TraceCheckUtils]: 44: Hoare triple {1989#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1985#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,711 INFO L290 TraceCheckUtils]: 43: Hoare triple {1993#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1989#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {1997#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1993#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {2001#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1997#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {2005#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2001#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {2009#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2005#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {2013#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2009#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {2017#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2013#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {2021#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2017#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {2025#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2021#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {2029#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2025#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {2033#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2029#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {2037#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2033#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {2041#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2037#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {2045#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2041#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {2049#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2045#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {2053#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2049#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {2057#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2053#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {2061#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2057#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {2065#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2061#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {2069#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2065#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {2073#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2069#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {2077#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2073#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {2081#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2077#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {2085#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2081#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {2089#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2085#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {2093#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2089#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {2097#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2093#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {2101#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2097#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {2105#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2101#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {2109#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2105#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {2113#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2109#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {2117#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2113#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {2121#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2117#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {2125#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2121#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {2129#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2125#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {2133#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2129#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {2137#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2133#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {2141#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2137#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {1720#true} ~x~0 := 1;~y~0 := 0; {2141#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-27 10:33:39,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {1720#true} call #t~ret5 := main(); {1720#true} is VALID [2022-04-27 10:33:39,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1720#true} {1720#true} #34#return; {1720#true} is VALID [2022-04-27 10:33:39,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {1720#true} assume true; {1720#true} is VALID [2022-04-27 10:33:39,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {1720#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1720#true} is VALID [2022-04-27 10:33:39,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {1720#true} call ULTIMATE.init(); {1720#true} is VALID [2022-04-27 10:33:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:33:39,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328113731] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:33:39,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:33:39,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-27 10:33:39,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984160621] [2022-04-27 10:33:39,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:33:39,764 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 97 states have internal predecessors, (104), 2 states have call successors, (4), 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 57 [2022-04-27 10:33:39,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:33:39,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 98 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 97 states have internal predecessors, (104), 2 states have call successors, (4), 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 10:33:39,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:33:39,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-04-27 10:33:39,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:33:39,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-04-27 10:33:39,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2022-04-27 10:33:39,832 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 98 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 97 states have internal predecessors, (104), 2 states have call successors, (4), 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 10:34:19,794 WARN L232 SmtUtils]: Spent 5.33s on a formula simplification. DAG size of input: 196 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:35:02,178 WARN L232 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 192 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:35:41,635 WARN L232 SmtUtils]: Spent 7.12s on a formula simplification. DAG size of input: 188 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:36:23,997 WARN L232 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 184 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:37:05,033 WARN L232 SmtUtils]: Spent 5.67s on a formula simplification. DAG size of input: 180 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:39:23,473 WARN L232 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 168 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:40:12,335 WARN L232 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 164 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)