/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-invariants/linear-inequality-inv-a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 12:23:17,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:23:17,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:23:17,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:23:17,698 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:23:17,699 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:23:17,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:23:17,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:23:17,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:23:17,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:23:17,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:23:17,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:23:17,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:23:17,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:23:17,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:23:17,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:23:17,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:23:17,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:23:17,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:23:17,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:23:17,731 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:23:17,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:23:17,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:23:17,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:23:17,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:23:17,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:23:17,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:23:17,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:23:17,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:23:17,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:23:17,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:23:17,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:23:17,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:23:17,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:23:17,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:23:17,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:23:17,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:23:17,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:23:17,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:23:17,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:23:17,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:23:17,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:23:17,752 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-07 12:23:17,788 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:23:17,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:23:17,788 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:23:17,789 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:23:17,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:23:17,789 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:23:17,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:23:17,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:23:17,790 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:23:17,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:23:17,791 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:23:17,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:23:17,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:23:17,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:23:17,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:23:17,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:23:17,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:23:17,793 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:23:17,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:23:17,793 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:23:17,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:23:17,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:23:17,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:23:17,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:23:17,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:23:17,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:23:17,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:23:17,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:23:17,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:23:17,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:23:17,795 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:23:17,795 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:23:17,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:23:17,795 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-07 12:23:17,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:23:18,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:23:18,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:23:18,025 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:23:18,027 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:23:18,028 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c [2022-04-07 12:23:18,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8631af4fc/698a61691fbc47aea11458367af62d67/FLAGb147d6d2c [2022-04-07 12:23:18,436 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:23:18,437 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c [2022-04-07 12:23:18,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8631af4fc/698a61691fbc47aea11458367af62d67/FLAGb147d6d2c [2022-04-07 12:23:18,853 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8631af4fc/698a61691fbc47aea11458367af62d67 [2022-04-07 12:23:18,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:23:18,857 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:23:18,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:23:18,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:23:18,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:23:18,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:23:18" (1/1) ... [2022-04-07 12:23:18,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2f1a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:23:18, skipping insertion in model container [2022-04-07 12:23:18,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:23:18" (1/1) ... [2022-04-07 12:23:18,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:23:18,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:23:19,071 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-invariants/linear-inequality-inv-a.c[557,570] [2022-04-07 12:23:19,074 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-invariants/linear-inequality-inv-a.c[613,626] [2022-04-07 12:23:19,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:23:19,081 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:23:19,096 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-invariants/linear-inequality-inv-a.c[557,570] [2022-04-07 12:23:19,097 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-invariants/linear-inequality-inv-a.c[613,626] [2022-04-07 12:23:19,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:23:19,109 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:23:19,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:23:19 WrapperNode [2022-04-07 12:23:19,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:23:19,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:23:19,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:23:19,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:23:19,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:23:19" (1/1) ... [2022-04-07 12:23:19,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:23:19" (1/1) ... [2022-04-07 12:23:19,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:23:19" (1/1) ... [2022-04-07 12:23:19,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:23:19" (1/1) ... [2022-04-07 12:23:19,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:23:19" (1/1) ... [2022-04-07 12:23:19,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:23:19" (1/1) ... [2022-04-07 12:23:19,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:23:19" (1/1) ... [2022-04-07 12:23:19,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:23:19,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:23:19,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:23:19,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:23:19,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:23:19" (1/1) ... [2022-04-07 12:23:19,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:23:19,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:23:19,172 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-07 12:23:19,200 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-07 12:23:19,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:23:19,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:23:19,225 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:23:19,225 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:23:19,226 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:23:19,226 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:23:19,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:23:19,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2022-04-07 12:23:19,226 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:23:19,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:23:19,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:23:19,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:23:19,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:23:19,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:23:19,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:23:19,285 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:23:19,287 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:23:19,418 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:23:19,442 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:23:19,443 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 12:23:19,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:23:19 BoogieIcfgContainer [2022-04-07 12:23:19,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:23:19,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:23:19,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:23:19,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:23:19,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:23:18" (1/3) ... [2022-04-07 12:23:19,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68479ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:23:19, skipping insertion in model container [2022-04-07 12:23:19,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:23:19" (2/3) ... [2022-04-07 12:23:19,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68479ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:23:19, skipping insertion in model container [2022-04-07 12:23:19,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:23:19" (3/3) ... [2022-04-07 12:23:19,472 INFO L111 eAbstractionObserver]: Analyzing ICFG linear-inequality-inv-a.c [2022-04-07 12:23:19,476 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:23:19,476 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-04-07 12:23:19,527 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:23:19,534 INFO L340 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 [2022-04-07 12:23:19,534 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-04-07 12:23:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:23:19,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-07 12:23:19,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:23:19,565 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:23:19,566 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:23:19,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:23:19,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1624254505, now seen corresponding path program 1 times [2022-04-07 12:23:19,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:23:19,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666639120] [2022-04-07 12:23:19,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:23:19,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:23:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:19,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:23:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:19,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-07 12:23:19,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-07 12:23:19,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #38#return; {21#true} is VALID [2022-04-07 12:23:19,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:23:19,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-07 12:23:19,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-07 12:23:19,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #38#return; {21#true} is VALID [2022-04-07 12:23:19,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret7 := main(); {21#true} is VALID [2022-04-07 12:23:19,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {21#true} is VALID [2022-04-07 12:23:19,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {26#(and (= main_~i~0 0) (not (<= main_~n~0 (* 256 (div main_~n~0 256)))))} is VALID [2022-04-07 12:23:19,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#(and (= main_~i~0 0) (not (<= main_~n~0 (* 256 (div main_~n~0 256)))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {22#false} is VALID [2022-04-07 12:23:19,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {22#false} is VALID [2022-04-07 12:23:19,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-07 12:23:19,851 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-07 12:23:19,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:23:19,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666639120] [2022-04-07 12:23:19,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666639120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:23:19,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:23:19,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 12:23:19,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928990081] [2022-04-07 12:23:19,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:23:19,859 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-07 12:23:19,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:23:19,863 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:19,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:23:19,889 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 12:23:19,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:23:19,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 12:23:19,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 12:23:19,910 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:20,034 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-07 12:23:20,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 12:23:20,034 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-07 12:23:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:23:20,035 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-04-07 12:23:20,048 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-04-07 12:23:20,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2022-04-07 12:23:20,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:23:20,106 INFO L225 Difference]: With dead ends: 29 [2022-04-07 12:23:20,106 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 12:23:20,109 INFO L912 BasicCegarLoop]: 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-07 12:23:20,111 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:23:20,112 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 27 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:23:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 12:23:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 12:23:20,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:23:20,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:20,138 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:20,139 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:20,141 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 12:23:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 12:23:20,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:20,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:20,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 12:23:20,142 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 12:23:20,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:20,144 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 12:23:20,145 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 12:23:20,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:20,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:20,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:23:20,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:23:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-07 12:23:20,148 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2022-04-07 12:23:20,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:23:20,149 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-07 12:23:20,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:20,149 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 12:23:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 12:23:20,149 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:23:20,150 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:23:20,150 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 12:23:20,150 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:23:20,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:23:20,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1187666007, now seen corresponding path program 1 times [2022-04-07 12:23:20,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:23:20,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267381702] [2022-04-07 12:23:20,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:23:20,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:23:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:20,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:23:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:20,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {118#true} is VALID [2022-04-07 12:23:20,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2022-04-07 12:23:20,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} #38#return; {118#true} is VALID [2022-04-07 12:23:20,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:23:20,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {118#true} is VALID [2022-04-07 12:23:20,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} assume true; {118#true} is VALID [2022-04-07 12:23:20,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} #38#return; {118#true} is VALID [2022-04-07 12:23:20,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} call #t~ret7 := main(); {118#true} is VALID [2022-04-07 12:23:20,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {118#true} is VALID [2022-04-07 12:23:20,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {123#(= main_~s~0 0)} is VALID [2022-04-07 12:23:20,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {124#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-07 12:23:20,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {124#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {124#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-07 12:23:20,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {124#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {119#false} is VALID [2022-04-07 12:23:20,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-04-07 12:23:20,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-07 12:23:20,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:23:20,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267381702] [2022-04-07 12:23:20,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267381702] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:23:20,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110994464] [2022-04-07 12:23:20,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:23:20,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:23:20,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:23:20,259 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-07 12:23:20,313 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-07 12:23:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:20,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 12:23:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:20,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:23:20,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {118#true} is VALID [2022-04-07 12:23:20,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {118#true} is VALID [2022-04-07 12:23:20,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} assume true; {118#true} is VALID [2022-04-07 12:23:20,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} #38#return; {118#true} is VALID [2022-04-07 12:23:20,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} call #t~ret7 := main(); {118#true} is VALID [2022-04-07 12:23:20,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {118#true} is VALID [2022-04-07 12:23:20,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {123#(= main_~s~0 0)} is VALID [2022-04-07 12:23:20,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {150#(= (+ main_~s~0 (* (- 1) (mod main_~v~0 256))) 0)} is VALID [2022-04-07 12:23:20,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {150#(= (+ main_~s~0 (* (- 1) (mod main_~v~0 256))) 0)} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {150#(= (+ main_~s~0 (* (- 1) (mod main_~v~0 256))) 0)} is VALID [2022-04-07 12:23:20,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {150#(= (+ main_~s~0 (* (- 1) (mod main_~v~0 256))) 0)} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {119#false} is VALID [2022-04-07 12:23:20,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-04-07 12:23:20,430 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-07 12:23:20,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:23:20,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-04-07 12:23:20,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {119#false} is VALID [2022-04-07 12:23:20,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {163#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-07 12:23:20,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {170#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {163#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-07 12:23:20,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {170#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-07 12:23:20,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {118#true} is VALID [2022-04-07 12:23:20,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} call #t~ret7 := main(); {118#true} is VALID [2022-04-07 12:23:20,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} #38#return; {118#true} is VALID [2022-04-07 12:23:20,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} assume true; {118#true} is VALID [2022-04-07 12:23:20,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {118#true} is VALID [2022-04-07 12:23:20,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {118#true} is VALID [2022-04-07 12:23:20,844 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-07 12:23:20,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110994464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:23:20,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:23:20,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-07 12:23:20,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705367883] [2022-04-07 12:23:20,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:23:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have 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-07 12:23:20,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:23:20,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:20,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:23:20,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:23:20,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:23:20,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:23:20,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:23:20,876 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:21,168 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-07 12:23:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:23:21,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have 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-07 12:23:21,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:23:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-07 12:23:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-07 12:23:21,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-07 12:23:21,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:23:21,219 INFO L225 Difference]: With dead ends: 32 [2022-04-07 12:23:21,219 INFO L226 Difference]: Without dead ends: 26 [2022-04-07 12:23:21,219 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:23:21,220 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:23:21,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 28 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:23:21,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-07 12:23:21,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2022-04-07 12:23:21,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:23:21,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:21,235 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:21,235 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:21,239 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-07 12:23:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-07 12:23:21,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:21,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:21,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-07 12:23:21,240 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-07 12:23:21,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:21,248 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-07 12:23:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-07 12:23:21,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:21,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:21,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:23:21,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:23:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-07 12:23:21,250 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2022-04-07 12:23:21,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:23:21,250 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-07 12:23:21,250 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-07 12:23:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 12:23:21,251 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:23:21,251 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:23:21,275 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-07 12:23:21,466 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:23:21,467 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:23:21,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:23:21,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1115879670, now seen corresponding path program 1 times [2022-04-07 12:23:21,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:23:21,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025843920] [2022-04-07 12:23:21,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:23:21,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:23:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:21,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:23:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:21,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {335#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-04-07 12:23:21,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-07 12:23:21,605 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #38#return; {327#true} is VALID [2022-04-07 12:23:21,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {335#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:23:21,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-04-07 12:23:21,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-07 12:23:21,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #38#return; {327#true} is VALID [2022-04-07 12:23:21,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret7 := main(); {327#true} is VALID [2022-04-07 12:23:21,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {327#true} is VALID [2022-04-07 12:23:21,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {327#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {332#(= main_~s~0 0)} is VALID [2022-04-07 12:23:21,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {332#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {333#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-07 12:23:21,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {333#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:21,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:21,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:21,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {328#false} is VALID [2022-04-07 12:23:21,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-07 12:23:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:23:21,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:23:21,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025843920] [2022-04-07 12:23:21,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025843920] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:23:21,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932219346] [2022-04-07 12:23:21,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:23:21,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:23:21,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:23:21,624 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-07 12:23:21,641 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-07 12:23:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:21,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:23:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:21,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:23:22,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2022-04-07 12:23:22,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-04-07 12:23:22,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-07 12:23:22,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #38#return; {327#true} is VALID [2022-04-07 12:23:22,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret7 := main(); {327#true} is VALID [2022-04-07 12:23:22,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {327#true} is VALID [2022-04-07 12:23:22,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {327#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {332#(= main_~s~0 0)} is VALID [2022-04-07 12:23:22,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {332#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {333#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-07 12:23:22,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {333#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:22,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:22,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:22,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {334#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {328#false} is VALID [2022-04-07 12:23:22,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-07 12:23:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:23:22,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:23:24,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-07 12:23:24,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {378#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {328#false} is VALID [2022-04-07 12:23:24,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {378#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {378#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-07 12:23:24,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {378#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {378#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-07 12:23:24,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {388#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {378#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-07 12:23:24,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {392#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {388#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-07 12:23:24,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {327#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {392#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-07 12:23:24,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {327#true} is VALID [2022-04-07 12:23:24,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret7 := main(); {327#true} is VALID [2022-04-07 12:23:24,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #38#return; {327#true} is VALID [2022-04-07 12:23:24,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-07 12:23:24,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-04-07 12:23:24,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2022-04-07 12:23:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:23:24,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932219346] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:23:24,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:23:24,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-04-07 12:23:24,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565928661] [2022-04-07 12:23:24,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:23:24,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 12:23:24,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:23:24,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:24,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:23:24,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 12:23:24,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:23:24,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 12:23:24,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-07 12:23:24,529 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:24,754 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-07 12:23:24,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:23:24,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 12:23:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:23:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-07 12:23:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-07 12:23:24,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-07 12:23:24,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:23:24,804 INFO L225 Difference]: With dead ends: 30 [2022-04-07 12:23:24,805 INFO L226 Difference]: Without dead ends: 22 [2022-04-07 12:23:24,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:23:24,806 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:23:24,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 18 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:23:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-07 12:23:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-07 12:23:24,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:23:24,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:24,826 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:24,826 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:24,827 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-07 12:23:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-07 12:23:24,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:24,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:24,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-07 12:23:24,828 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-07 12:23:24,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:24,829 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-07 12:23:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-07 12:23:24,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:24,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:24,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:23:24,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:23:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-07 12:23:24,831 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2022-04-07 12:23:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:23:24,832 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-07 12:23:24,832 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-07 12:23:24,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 12:23:24,832 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:23:24,833 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:23:24,853 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-07 12:23:25,033 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 12:23:25,034 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:23:25,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:23:25,034 INFO L85 PathProgramCache]: Analyzing trace with hash 234096681, now seen corresponding path program 2 times [2022-04-07 12:23:25,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:23:25,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752092184] [2022-04-07 12:23:25,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:23:25,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:23:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:25,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:23:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:25,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {545#true} is VALID [2022-04-07 12:23:25,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#true} assume true; {545#true} is VALID [2022-04-07 12:23:25,183 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {545#true} {545#true} #38#return; {545#true} is VALID [2022-04-07 12:23:25,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {545#true} call ULTIMATE.init(); {555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:23:25,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {545#true} is VALID [2022-04-07 12:23:25,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {545#true} assume true; {545#true} is VALID [2022-04-07 12:23:25,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {545#true} {545#true} #38#return; {545#true} is VALID [2022-04-07 12:23:25,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {545#true} call #t~ret7 := main(); {545#true} is VALID [2022-04-07 12:23:25,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {545#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {545#true} is VALID [2022-04-07 12:23:25,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {545#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {550#(= main_~s~0 0)} is VALID [2022-04-07 12:23:25,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {551#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-07 12:23:25,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {551#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {552#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:25,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {552#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {553#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:25,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {553#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {554#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-07 12:23:25,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {554#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-07 12:23:25,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {546#false} is VALID [2022-04-07 12:23:25,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {546#false} assume !false; {546#false} is VALID [2022-04-07 12:23:25,191 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-07 12:23:25,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:23:25,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752092184] [2022-04-07 12:23:25,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752092184] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:23:25,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838219193] [2022-04-07 12:23:25,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:23:25,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:23:25,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:23:25,193 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-07 12:23:25,195 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-07 12:23:25,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:23:25,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:23:25,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 12:23:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:25,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:23:26,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {545#true} call ULTIMATE.init(); {545#true} is VALID [2022-04-07 12:23:26,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {545#true} is VALID [2022-04-07 12:23:26,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {545#true} assume true; {545#true} is VALID [2022-04-07 12:23:26,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {545#true} {545#true} #38#return; {545#true} is VALID [2022-04-07 12:23:26,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {545#true} call #t~ret7 := main(); {545#true} is VALID [2022-04-07 12:23:26,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {545#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {545#true} is VALID [2022-04-07 12:23:26,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {545#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {550#(= main_~s~0 0)} is VALID [2022-04-07 12:23:26,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {551#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-07 12:23:26,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {551#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {552#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:26,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {552#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {553#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:26,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {553#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {589#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 765 (mod main_~v~0 256))))} is VALID [2022-04-07 12:23:26,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {589#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 765 (mod main_~v~0 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {589#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 765 (mod main_~v~0 256))))} is VALID [2022-04-07 12:23:26,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {589#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 765 (mod main_~v~0 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {546#false} is VALID [2022-04-07 12:23:26,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {546#false} assume !false; {546#false} is VALID [2022-04-07 12:23:26,795 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-07 12:23:26,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:23:33,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {546#false} assume !false; {546#false} is VALID [2022-04-07 12:23:33,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {602#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {546#false} is VALID [2022-04-07 12:23:33,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {602#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {602#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-07 12:23:33,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {609#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {602#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-07 12:23:33,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {613#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {609#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-07 12:23:33,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {617#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {613#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-07 12:23:33,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {621#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {617#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:23:33,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {545#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {621#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-07 12:23:33,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {545#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {545#true} is VALID [2022-04-07 12:23:33,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {545#true} call #t~ret7 := main(); {545#true} is VALID [2022-04-07 12:23:33,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {545#true} {545#true} #38#return; {545#true} is VALID [2022-04-07 12:23:33,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {545#true} assume true; {545#true} is VALID [2022-04-07 12:23:33,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {545#true} is VALID [2022-04-07 12:23:33,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {545#true} call ULTIMATE.init(); {545#true} is VALID [2022-04-07 12:23:33,420 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-07 12:23:33,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838219193] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:23:33,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:23:33,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-07 12:23:33,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155420127] [2022-04-07 12:23:33,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:23:33,421 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 12:23:33,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:23:33,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:33,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:23:33,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 12:23:33,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:23:33,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 12:23:33,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:23:33,460 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:34,070 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-07 12:23:34,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-07 12:23:34,071 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 12:23:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:23:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2022-04-07 12:23:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2022-04-07 12:23:34,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 49 transitions. [2022-04-07 12:23:34,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:23:34,156 INFO L225 Difference]: With dead ends: 44 [2022-04-07 12:23:34,156 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 12:23:34,157 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=423, Unknown=0, NotChecked=0, Total=650 [2022-04-07 12:23:34,157 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 75 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:23:34,158 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 33 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:23:34,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 12:23:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2022-04-07 12:23:34,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:23:34,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:34,183 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:34,183 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:34,187 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-07 12:23:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-07 12:23:34,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:34,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:34,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-07 12:23:34,188 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-07 12:23:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:34,190 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-07 12:23:34,191 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-07 12:23:34,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:34,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:34,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:23:34,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:23:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-07 12:23:34,198 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2022-04-07 12:23:34,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:23:34,199 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-07 12:23:34,199 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:34,199 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-07 12:23:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 12:23:34,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:23:34,203 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:23:34,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 12:23:34,429 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:23:34,429 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:23:34,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:23:34,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1001187082, now seen corresponding path program 2 times [2022-04-07 12:23:34,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:23:34,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130549575] [2022-04-07 12:23:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:23:34,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:23:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:34,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:23:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:34,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {848#true} is VALID [2022-04-07 12:23:34,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#true} assume true; {848#true} is VALID [2022-04-07 12:23:34,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {848#true} {848#true} #38#return; {848#true} is VALID [2022-04-07 12:23:34,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:23:34,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {848#true} is VALID [2022-04-07 12:23:34,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2022-04-07 12:23:34,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #38#return; {848#true} is VALID [2022-04-07 12:23:34,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret7 := main(); {848#true} is VALID [2022-04-07 12:23:34,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {848#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {848#true} is VALID [2022-04-07 12:23:34,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {853#(= main_~s~0 0)} is VALID [2022-04-07 12:23:34,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {854#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-07 12:23:34,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {854#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {855#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:34,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {855#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {856#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:34,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {856#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {857#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-07 12:23:34,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {857#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {858#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-07 12:23:34,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {858#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-07 12:23:34,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-07 12:23:34,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-07 12:23:34,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume ~s~0 % 4294967296 > 65025; {849#false} is VALID [2022-04-07 12:23:34,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {849#false} assume !false; {849#false} is VALID [2022-04-07 12:23:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:23:34,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:23:34,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130549575] [2022-04-07 12:23:34,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130549575] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:23:34,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445294070] [2022-04-07 12:23:34,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:23:34,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:23:34,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:23:34,645 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-07 12:23:34,647 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-07 12:23:34,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:23:34,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:23:34,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 12:23:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:34,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:23:35,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {848#true} is VALID [2022-04-07 12:23:35,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {848#true} is VALID [2022-04-07 12:23:35,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2022-04-07 12:23:35,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #38#return; {848#true} is VALID [2022-04-07 12:23:35,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret7 := main(); {848#true} is VALID [2022-04-07 12:23:35,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {848#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {848#true} is VALID [2022-04-07 12:23:35,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {853#(= main_~s~0 0)} is VALID [2022-04-07 12:23:35,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {854#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-07 12:23:35,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {854#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {855#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:35,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {855#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {856#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:35,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {856#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {857#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-07 12:23:35,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {857#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {858#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-07 12:23:35,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {858#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-07 12:23:35,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-07 12:23:35,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-07 12:23:35,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {859#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume ~s~0 % 4294967296 > 65025; {849#false} is VALID [2022-04-07 12:23:35,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {849#false} assume !false; {849#false} is VALID [2022-04-07 12:23:35,859 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:23:35,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:23:45,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {849#false} assume !false; {849#false} is VALID [2022-04-07 12:23:45,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {915#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {849#false} is VALID [2022-04-07 12:23:45,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {915#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {915#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-07 12:23:45,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {915#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {915#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-07 12:23:45,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {925#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {915#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-07 12:23:45,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {929#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {925#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-07 12:23:45,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {933#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {929#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-07 12:23:45,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {937#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {933#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-07 12:23:45,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {941#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {937#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:23:45,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {945#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {941#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-07 12:23:45,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {945#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-07 12:23:45,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {848#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {848#true} is VALID [2022-04-07 12:23:45,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret7 := main(); {848#true} is VALID [2022-04-07 12:23:45,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #38#return; {848#true} is VALID [2022-04-07 12:23:45,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2022-04-07 12:23:45,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {848#true} is VALID [2022-04-07 12:23:45,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {848#true} is VALID [2022-04-07 12:23:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:23:45,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445294070] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:23:45,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:23:45,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2022-04-07 12:23:45,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085795133] [2022-04-07 12:23:45,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:23:45,062 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 12:23:45,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:23:45,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:45,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:23:45,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-07 12:23:45,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:23:45,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-07 12:23:45,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:23:45,099 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:45,660 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-07 12:23:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-07 12:23:45,661 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 12:23:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:23:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2022-04-07 12:23:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2022-04-07 12:23:45,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 57 transitions. [2022-04-07 12:23:45,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:23:45,770 INFO L225 Difference]: With dead ends: 46 [2022-04-07 12:23:45,770 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 12:23:45,770 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2022-04-07 12:23:45,771 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:23:45,771 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 33 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:23:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 12:23:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-04-07 12:23:45,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:23:45,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:45,809 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:45,810 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:45,811 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-07 12:23:45,811 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-07 12:23:45,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:45,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:45,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-07 12:23:45,812 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-07 12:23:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:45,813 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-07 12:23:45,813 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-07 12:23:45,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:45,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:45,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:23:45,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:23:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-07 12:23:45,814 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2022-04-07 12:23:45,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:23:45,815 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-07 12:23:45,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-07 12:23:45,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 12:23:45,815 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:23:45,816 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:23:45,837 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-07 12:23:46,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:23:46,031 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:23:46,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:23:46,032 INFO L85 PathProgramCache]: Analyzing trace with hash -605562839, now seen corresponding path program 3 times [2022-04-07 12:23:46,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:23:46,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352568131] [2022-04-07 12:23:46,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:23:46,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:23:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:46,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:23:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:46,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {1190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1174#true} is VALID [2022-04-07 12:23:46,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-07 12:23:46,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1174#true} {1174#true} #38#return; {1174#true} is VALID [2022-04-07 12:23:46,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:23:46,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {1190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1174#true} is VALID [2022-04-07 12:23:46,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-07 12:23:46,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #38#return; {1174#true} is VALID [2022-04-07 12:23:46,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret7 := main(); {1174#true} is VALID [2022-04-07 12:23:46,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1174#true} is VALID [2022-04-07 12:23:46,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {1174#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1179#(= main_~s~0 0)} is VALID [2022-04-07 12:23:46,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1180#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-07 12:23:46,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {1180#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1181#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:46,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {1181#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1182#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:46,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {1182#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1183#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-07 12:23:46,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {1183#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1184#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-07 12:23:46,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {1184#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1185#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-07 12:23:46,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {1185#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1186#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-07 12:23:46,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {1186#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1187#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:46,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {1187#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1188#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-07 12:23:46,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1189#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-07 12:23:46,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {1189#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1189#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-07 12:23:46,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {1189#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {1175#false} is VALID [2022-04-07 12:23:46,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2022-04-07 12:23:46,314 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-07 12:23:46,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:23:46,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352568131] [2022-04-07 12:23:46,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352568131] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:23:46,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559114101] [2022-04-07 12:23:46,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:23:46,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:23:46,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:23:46,320 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-07 12:23:46,321 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-07 12:23:46,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-07 12:23:46,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:23:46,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 12:23:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:46,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:23:48,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1174#true} is VALID [2022-04-07 12:23:48,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1174#true} is VALID [2022-04-07 12:23:48,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-07 12:23:48,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #38#return; {1174#true} is VALID [2022-04-07 12:23:48,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret7 := main(); {1174#true} is VALID [2022-04-07 12:23:48,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1174#true} is VALID [2022-04-07 12:23:48,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {1174#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1179#(= main_~s~0 0)} is VALID [2022-04-07 12:23:48,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1180#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-07 12:23:48,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {1180#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1181#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:48,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {1181#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1182#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:48,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {1182#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1183#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-07 12:23:48,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {1183#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1184#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-07 12:23:48,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {1184#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1185#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-07 12:23:48,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {1185#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1186#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-07 12:23:48,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {1186#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1187#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-07 12:23:48,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {1187#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1188#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-07 12:23:48,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1242#(and (<= main_~s~0 (+ 2295 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-07 12:23:48,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {1242#(and (<= main_~s~0 (+ 2295 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1242#(and (<= main_~s~0 (+ 2295 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} is VALID [2022-04-07 12:23:48,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {1242#(and (<= main_~s~0 (+ 2295 (mod main_~v~0 256))) (<= (mod main_~v~0 256) main_~s~0))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {1175#false} is VALID [2022-04-07 12:23:48,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2022-04-07 12:23:48,736 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-07 12:23:48,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:24:00,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2022-04-07 12:24:00,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {1255#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {1175#false} is VALID [2022-04-07 12:24:00,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {1255#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1255#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-07 12:24:00,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {1262#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1255#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-07 12:24:00,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {1266#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1262#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-07 12:24:00,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {1270#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1266#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-07 12:24:00,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {1274#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1270#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:24:00,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {1278#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1274#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-07 12:24:00,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {1282#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1278#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-07 12:24:00,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {1286#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1282#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-07 12:24:00,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {1290#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1286#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-07 12:24:00,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {1294#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1290#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-07 12:24:00,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {1298#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1294#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-07 12:24:00,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {1174#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1298#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-07 12:24:00,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1174#true} is VALID [2022-04-07 12:24:00,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret7 := main(); {1174#true} is VALID [2022-04-07 12:24:00,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #38#return; {1174#true} is VALID [2022-04-07 12:24:00,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-07 12:24:00,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1174#true} is VALID [2022-04-07 12:24:00,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1174#true} is VALID [2022-04-07 12:24:00,675 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-07 12:24:00,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559114101] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:24:00,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:24:00,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-07 12:24:00,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135855057] [2022-04-07 12:24:00,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:24:00,679 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 12:24:00,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:24:00,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:00,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:24:00,722 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-07 12:24:00,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:24:00,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-07 12:24:00,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=398, Unknown=0, NotChecked=0, Total=650 [2022-04-07 12:24:00,723 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:24:02,141 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-04-07 12:24:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-07 12:24:02,141 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 12:24:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:24:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 85 transitions. [2022-04-07 12:24:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 85 transitions. [2022-04-07 12:24:02,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 85 transitions. [2022-04-07 12:24:02,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:24:02,276 INFO L225 Difference]: With dead ends: 74 [2022-04-07 12:24:02,276 INFO L226 Difference]: Without dead ends: 68 [2022-04-07 12:24:02,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=875, Invalid=1575, Unknown=0, NotChecked=0, Total=2450 [2022-04-07 12:24:02,278 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 137 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:24:02,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 38 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 12:24:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-07 12:24:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 37. [2022-04-07 12:24:02,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:24:02,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:02,344 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:02,344 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:24:02,346 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-07 12:24:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-07 12:24:02,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:24:02,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:24:02,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-07 12:24:02,347 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-07 12:24:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:24:02,349 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-07 12:24:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-07 12:24:02,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:24:02,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:24:02,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:24:02,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:24:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-04-07 12:24:02,351 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 20 [2022-04-07 12:24:02,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:24:02,351 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-04-07 12:24:02,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-07 12:24:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 12:24:02,352 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:24:02,352 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:24:02,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-07 12:24:02,559 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:24:02,560 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:24:02,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:24:02,560 INFO L85 PathProgramCache]: Analyzing trace with hash -524068618, now seen corresponding path program 3 times [2022-04-07 12:24:02,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:24:02,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203590707] [2022-04-07 12:24:02,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:24:02,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:24:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:24:02,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:24:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:24:02,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {1691#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1671#true} is VALID [2022-04-07 12:24:02,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-07 12:24:02,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1671#true} {1671#true} #38#return; {1671#true} is VALID [2022-04-07 12:24:02,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1691#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:24:02,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {1691#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1671#true} is VALID [2022-04-07 12:24:02,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-07 12:24:02,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #38#return; {1671#true} is VALID [2022-04-07 12:24:02,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret7 := main(); {1671#true} is VALID [2022-04-07 12:24:02,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1671#true} is VALID [2022-04-07 12:24:02,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {1671#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1676#(= main_~s~0 0)} is VALID [2022-04-07 12:24:02,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {1676#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1677#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-07 12:24:02,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {1677#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1678#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:02,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {1678#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1679#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:02,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {1679#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1680#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-07 12:24:02,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {1680#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1681#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-07 12:24:02,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {1681#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1682#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-07 12:24:02,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {1682#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1683#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-07 12:24:02,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {1683#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1684#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:02,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {1684#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1685#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-07 12:24:02,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1686#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:02,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {1686#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1687#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-07 12:24:02,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {1687#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1688#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:02,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {1688#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1689#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:02,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {1689#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:02,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:02,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:02,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {1672#false} is VALID [2022-04-07 12:24:02,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2022-04-07 12:24:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:24:02,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:24:02,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203590707] [2022-04-07 12:24:02,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203590707] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:24:02,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459194512] [2022-04-07 12:24:02,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:24:02,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:24:02,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:24:02,873 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:24:02,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-07 12:24:03,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-04-07 12:24:03,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:24:03,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-07 12:24:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:24:03,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:24:05,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1671#true} is VALID [2022-04-07 12:24:05,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1671#true} is VALID [2022-04-07 12:24:05,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-07 12:24:05,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #38#return; {1671#true} is VALID [2022-04-07 12:24:05,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret7 := main(); {1671#true} is VALID [2022-04-07 12:24:05,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1671#true} is VALID [2022-04-07 12:24:05,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {1671#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1676#(= main_~s~0 0)} is VALID [2022-04-07 12:24:05,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {1676#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1677#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-07 12:24:05,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {1677#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1678#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:05,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {1678#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1679#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:05,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {1679#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1680#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-07 12:24:05,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {1680#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1681#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-07 12:24:05,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {1681#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1682#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-07 12:24:05,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {1682#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1683#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-07 12:24:05,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {1683#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1684#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:05,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {1684#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1685#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-07 12:24:05,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1686#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:05,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {1686#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1687#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-07 12:24:05,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {1687#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1688#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:05,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {1688#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1689#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:05,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {1689#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:05,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:05,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:05,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {1690#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume ~s~0 % 4294967296 > 65025; {1672#false} is VALID [2022-04-07 12:24:05,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2022-04-07 12:24:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:24:05,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:24:25,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2022-04-07 12:24:25,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {1770#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {1672#false} is VALID [2022-04-07 12:24:25,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {1770#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {1770#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-07 12:24:25,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {1770#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {1770#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-07 12:24:25,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {1780#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1770#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-07 12:24:25,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {1784#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1780#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-07 12:24:25,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {1788#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1784#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-07 12:24:25,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {1792#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1788#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-07 12:24:25,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {1796#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1792#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:24:25,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {1800#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1796#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-07 12:24:25,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {1804#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1800#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-07 12:24:25,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {1808#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1804#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-07 12:24:25,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {1812#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1808#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-07 12:24:25,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {1816#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1812#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-07 12:24:25,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {1820#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1816#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:24:25,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {1824#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1820#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} is VALID [2022-04-07 12:24:25,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1824#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:24:25,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {1832#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {1828#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} is VALID [2022-04-07 12:24:25,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {1671#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {1832#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} is VALID [2022-04-07 12:24:25,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {1671#true} is VALID [2022-04-07 12:24:25,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret7 := main(); {1671#true} is VALID [2022-04-07 12:24:25,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #38#return; {1671#true} is VALID [2022-04-07 12:24:25,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-07 12:24:25,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1671#true} is VALID [2022-04-07 12:24:25,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1671#true} is VALID [2022-04-07 12:24:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:24:25,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459194512] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:24:25,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:24:25,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 33 [2022-04-07 12:24:25,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560491987] [2022-04-07 12:24:25,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:24:25,363 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-07 12:24:25,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:24:25,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:25,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:24:25,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-07 12:24:25,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:24:25,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-07 12:24:25,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2022-04-07 12:24:25,459 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:27,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:24:27,047 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2022-04-07 12:24:27,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-07 12:24:27,047 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-07 12:24:27,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:24:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 101 transitions. [2022-04-07 12:24:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 101 transitions. [2022-04-07 12:24:27,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 101 transitions. [2022-04-07 12:24:27,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:24:27,404 INFO L225 Difference]: With dead ends: 78 [2022-04-07 12:24:27,404 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 12:24:27,405 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 23 SyntacticMatches, 15 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2022-04-07 12:24:27,406 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 127 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:24:27,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 28 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 12:24:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 12:24:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2022-04-07 12:24:27,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:24:27,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:27,469 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:27,470 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:24:27,471 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-07 12:24:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-07 12:24:27,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:24:27,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:24:27,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-07 12:24:27,472 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-07 12:24:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:24:27,473 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-07 12:24:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-07 12:24:27,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:24:27,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:24:27,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:24:27,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:24:27,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-04-07 12:24:27,475 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 25 [2022-04-07 12:24:27,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:24:27,475 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-04-07 12:24:27,476 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-07 12:24:27,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 12:24:27,476 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:24:27,476 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:24:27,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 12:24:27,682 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:24:27,683 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:24:27,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:24:27,683 INFO L85 PathProgramCache]: Analyzing trace with hash 645625897, now seen corresponding path program 4 times [2022-04-07 12:24:27,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:24:27,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352239815] [2022-04-07 12:24:27,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:24:27,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:24:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:24:28,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:24:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:24:28,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {2241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {2213#true} is VALID [2022-04-07 12:24:28,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {2213#true} assume true; {2213#true} is VALID [2022-04-07 12:24:28,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2213#true} {2213#true} #38#return; {2213#true} is VALID [2022-04-07 12:24:28,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {2213#true} call ULTIMATE.init(); {2241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:24:28,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {2241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {2213#true} is VALID [2022-04-07 12:24:28,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {2213#true} assume true; {2213#true} is VALID [2022-04-07 12:24:28,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2213#true} {2213#true} #38#return; {2213#true} is VALID [2022-04-07 12:24:28,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {2213#true} call #t~ret7 := main(); {2213#true} is VALID [2022-04-07 12:24:28,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {2213#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2213#true} is VALID [2022-04-07 12:24:28,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {2213#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2218#(= main_~s~0 0)} is VALID [2022-04-07 12:24:28,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {2218#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2219#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-07 12:24:28,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {2219#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2220#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:28,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {2220#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2221#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:28,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {2221#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2222#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-07 12:24:28,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {2222#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2223#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-07 12:24:28,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {2223#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2224#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-07 12:24:28,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {2224#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2225#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-07 12:24:28,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {2225#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2226#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:28,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {2226#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2227#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-07 12:24:28,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {2227#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2228#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:28,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {2228#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2229#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-07 12:24:28,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {2229#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2230#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:28,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {2230#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2231#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:28,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {2231#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2232#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:28,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {2232#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2233#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-07 12:24:28,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {2233#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2234#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-07 12:24:28,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {2234#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2235#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-07 12:24:28,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {2235#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2236#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:28,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {2236#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2237#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-07 12:24:28,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {2237#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2238#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-07 12:24:28,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {2238#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2239#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-07 12:24:28,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {2239#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2240#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-07 12:24:28,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {2240#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {2240#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-07 12:24:28,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {2240#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {2214#false} is VALID [2022-04-07 12:24:28,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {2214#false} assume !false; {2214#false} is VALID [2022-04-07 12:24:28,287 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-07 12:24:28,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:24:28,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352239815] [2022-04-07 12:24:28,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352239815] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:24:28,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602786721] [2022-04-07 12:24:28,287 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 12:24:28,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:24:28,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:24:28,291 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:24:28,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-07 12:24:28,372 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 12:24:28,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:24:28,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-07 12:24:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:24:28,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:24:32,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {2213#true} call ULTIMATE.init(); {2213#true} is VALID [2022-04-07 12:24:32,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {2213#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {2213#true} is VALID [2022-04-07 12:24:32,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {2213#true} assume true; {2213#true} is VALID [2022-04-07 12:24:32,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2213#true} {2213#true} #38#return; {2213#true} is VALID [2022-04-07 12:24:32,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {2213#true} call #t~ret7 := main(); {2213#true} is VALID [2022-04-07 12:24:32,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {2213#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2213#true} is VALID [2022-04-07 12:24:32,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {2213#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2218#(= main_~s~0 0)} is VALID [2022-04-07 12:24:32,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {2218#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2219#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-07 12:24:32,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {2219#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2220#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:32,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {2220#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2221#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:32,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {2221#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2222#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-07 12:24:32,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {2222#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2223#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-07 12:24:32,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {2223#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2224#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-07 12:24:32,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {2224#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2225#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-07 12:24:32,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {2225#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2226#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:32,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {2226#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2227#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-07 12:24:32,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {2227#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2228#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:32,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {2228#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2229#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-07 12:24:32,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {2229#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2230#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:32,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {2230#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2231#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:32,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {2231#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2232#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:32,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {2232#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2233#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-07 12:24:32,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {2233#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2234#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-07 12:24:32,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {2234#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2235#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-07 12:24:32,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {2235#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2236#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-07 12:24:32,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {2236#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2237#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-07 12:24:32,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {2237#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2238#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-07 12:24:32,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {2238#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2239#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-07 12:24:32,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {2239#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2329#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 5355 (mod main_~v~0 256))))} is VALID [2022-04-07 12:24:32,562 INFO L290 TraceCheckUtils]: 29: Hoare triple {2329#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 5355 (mod main_~v~0 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {2329#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 5355 (mod main_~v~0 256))))} is VALID [2022-04-07 12:24:32,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {2329#(and (<= (mod main_~v~0 256) main_~s~0) (<= main_~s~0 (+ 5355 (mod main_~v~0 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {2214#false} is VALID [2022-04-07 12:24:32,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {2214#false} assume !false; {2214#false} is VALID [2022-04-07 12:24:32,562 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-07 12:24:32,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:24:57,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {2214#false} assume !false; {2214#false} is VALID [2022-04-07 12:24:57,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {2342#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {2214#false} is VALID [2022-04-07 12:24:57,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {2342#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {2342#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-07 12:24:57,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {2349#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2342#(not (< (mod main_~s~0 4294967296) (mod main_~v~0 256)))} is VALID [2022-04-07 12:24:57,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {2353#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2349#(<= (div (+ (- 256) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div main_~s~0 4294967296) 1))} is VALID [2022-04-07 12:24:57,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {2357#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2353#(<= (div (+ (- 4294967807) (* (- 1) main_~s~0)) (- 4294967296)) (+ 3 (div (+ main_~s~0 (- 4294967296)) 4294967296)))} is VALID [2022-04-07 12:24:57,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {2361#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2357#(<= (div (+ (- 8589935358) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:24:57,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {2365#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2361#(<= (div (+ (- 12884902909) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-07 12:24:57,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {2369#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2365#(<= (div (+ (* (- 1) main_~s~0) (- 17179870460)) (- 4294967296)) (+ (div (+ (- 17179869184) main_~s~0) 4294967296) 9))} is VALID [2022-04-07 12:24:58,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {2373#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2369#(<= (div (+ (* (- 1) main_~s~0) (- 21474838011)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 11))} is VALID [2022-04-07 12:24:58,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {2377#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2373#(<= (div (+ (* (- 1) main_~s~0) (- 25769805562)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 13))} is VALID [2022-04-07 12:24:58,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {2381#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2377#(<= (div (+ (* (- 1) main_~s~0) (- 30064773113)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 15))} is VALID [2022-04-07 12:24:58,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {2385#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2381#(<= (div (+ (- 34359740664) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 34359738368)) 4294967296) 17))} is VALID [2022-04-07 12:24:58,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {2389#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2385#(<= (div (+ (- 38654708215) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ main_~s~0 (- 38654705664)) 4294967296)))} is VALID [2022-04-07 12:24:58,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {2393#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2389#(<= (div (+ (- 42949675766) (* (- 1) main_~s~0)) (- 4294967296)) (+ 21 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:24:58,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {2397#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2393#(<= (div (+ (* (- 1) main_~s~0) (- 47244643317)) (- 4294967296)) (+ 23 (div (+ main_~s~0 (- 47244640256)) 4294967296)))} is VALID [2022-04-07 12:24:58,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {2401#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2397#(<= (div (+ (- 51539610868) (* (- 1) main_~s~0)) (- 4294967296)) (+ 25 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:24:58,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {2405#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2401#(<= (div (+ (- 55834578419) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 27))} is VALID [2022-04-07 12:24:58,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {2409#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2405#(<= (div (+ (- 60129545970) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 29))} is VALID [2022-04-07 12:24:58,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {2413#(<= (div (+ (- 68719481072) (* (- 1) main_~s~0)) (- 4294967296)) (+ 33 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2409#(<= (div (+ (- 64424513521) (* (- 1) main_~s~0)) (- 4294967296)) (+ 31 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:24:58,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {2417#(<= (div (+ (* (- 1) main_~s~0) (- 73014448623)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 35))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2413#(<= (div (+ (- 68719481072) (* (- 1) main_~s~0)) (- 4294967296)) (+ 33 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-07 12:24:58,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {2421#(<= (div (+ (* (- 1) main_~s~0) (- 77309416174)) (- 4294967296)) (+ (div (+ (- 77309411328) main_~s~0) 4294967296) 37))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2417#(<= (div (+ (* (- 1) main_~s~0) (- 73014448623)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 35))} is VALID [2022-04-07 12:24:58,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {2425#(<= (div (+ (- 81604383725) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2421#(<= (div (+ (* (- 1) main_~s~0) (- 77309416174)) (- 4294967296)) (+ (div (+ (- 77309411328) main_~s~0) 4294967296) 37))} is VALID [2022-04-07 12:24:59,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {2429#(<= (div (+ (* (- 1) main_~s~0) (- 85899351276)) (- 4294967296)) (+ 41 (div (+ main_~s~0 (- 85899345920)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2425#(<= (div (+ (- 81604383725) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 39))} is VALID [2022-04-07 12:24:59,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {2433#(<= (div (+ (- 90194318827) (* (- 1) main_~s~0)) (- 4294967296)) (+ 43 (div (+ main_~s~0 (- 90194313216)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {2429#(<= (div (+ (* (- 1) main_~s~0) (- 85899351276)) (- 4294967296)) (+ 41 (div (+ main_~s~0 (- 85899345920)) 4294967296)))} is VALID [2022-04-07 12:24:59,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {2213#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {2433#(<= (div (+ (- 90194318827) (* (- 1) main_~s~0)) (- 4294967296)) (+ 43 (div (+ main_~s~0 (- 90194313216)) 4294967296)))} is VALID [2022-04-07 12:24:59,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {2213#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {2213#true} is VALID [2022-04-07 12:24:59,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {2213#true} call #t~ret7 := main(); {2213#true} is VALID [2022-04-07 12:24:59,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2213#true} {2213#true} #38#return; {2213#true} is VALID [2022-04-07 12:24:59,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {2213#true} assume true; {2213#true} is VALID [2022-04-07 12:24:59,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {2213#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {2213#true} is VALID [2022-04-07 12:24:59,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {2213#true} call ULTIMATE.init(); {2213#true} is VALID [2022-04-07 12:24:59,413 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-07 12:24:59,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602786721] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:24:59,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:24:59,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-07 12:24:59,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342737531] [2022-04-07 12:24:59,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:24:59,414 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-07 12:24:59,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:24:59,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:24:59,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:24:59,623 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-07 12:24:59,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:24:59,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-07 12:24:59,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1068, Invalid=1382, Unknown=0, NotChecked=0, Total=2450 [2022-04-07 12:24:59,624 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:03,505 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-07 12:25:03,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-07 12:25:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-07 12:25:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:25:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 157 transitions. [2022-04-07 12:25:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 157 transitions. [2022-04-07 12:25:03,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 157 transitions. [2022-04-07 12:25:03,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:25:03,802 INFO L225 Difference]: With dead ends: 134 [2022-04-07 12:25:03,802 INFO L226 Difference]: Without dead ends: 124 [2022-04-07 12:25:03,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 21 SyntacticMatches, 21 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3467, Invalid=6039, Unknown=0, NotChecked=0, Total=9506 [2022-04-07 12:25:03,806 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 324 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:25:03,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 43 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 12:25:03,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-07 12:25:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 61. [2022-04-07 12:25:03,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:25:03,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 57 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:03,923 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 57 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:03,923 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 57 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:03,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:03,926 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2022-04-07 12:25:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2022-04-07 12:25:03,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:03,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:03,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 57 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-07 12:25:03,927 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 57 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-07 12:25:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:03,930 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2022-04-07 12:25:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2022-04-07 12:25:03,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:03,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:03,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:25:03,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:25:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 57 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2022-04-07 12:25:03,933 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 32 [2022-04-07 12:25:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:25:03,933 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2022-04-07 12:25:03,933 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2022-04-07 12:25:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 12:25:03,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:25:03,934 INFO L499 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:25:03,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-07 12:25:04,154 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:25:04,154 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:25:04,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:25:04,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1558436086, now seen corresponding path program 4 times [2022-04-07 12:25:04,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:25:04,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351374362] [2022-04-07 12:25:04,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:25:04,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:25:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:04,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:25:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:04,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {3134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {3098#true} is VALID [2022-04-07 12:25:04,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {3098#true} assume true; {3098#true} is VALID [2022-04-07 12:25:04,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3098#true} {3098#true} #38#return; {3098#true} is VALID [2022-04-07 12:25:04,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {3098#true} call ULTIMATE.init(); {3134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:25:04,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {3134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {3098#true} is VALID [2022-04-07 12:25:04,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {3098#true} assume true; {3098#true} is VALID [2022-04-07 12:25:04,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3098#true} {3098#true} #38#return; {3098#true} is VALID [2022-04-07 12:25:04,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {3098#true} call #t~ret7 := main(); {3098#true} is VALID [2022-04-07 12:25:04,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {3098#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3098#true} is VALID [2022-04-07 12:25:04,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {3098#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3103#(= main_~s~0 0)} is VALID [2022-04-07 12:25:04,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {3103#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3104#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-07 12:25:04,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {3104#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3105#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:04,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {3105#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3106#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:04,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {3106#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3107#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-07 12:25:04,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {3107#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3108#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-07 12:25:04,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {3108#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3109#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-07 12:25:04,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {3109#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3110#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-07 12:25:04,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {3110#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3111#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:04,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {3111#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3112#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-07 12:25:04,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {3112#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3113#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:04,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {3113#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3114#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-07 12:25:04,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {3114#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3115#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:04,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {3115#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3116#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:04,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {3116#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3117#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:04,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {3117#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3118#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-07 12:25:04,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {3118#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3119#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-07 12:25:04,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {3119#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3120#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-07 12:25:04,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {3120#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3121#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:04,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {3121#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3122#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-07 12:25:04,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {3122#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3123#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-07 12:25:04,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {3123#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3124#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-07 12:25:04,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {3124#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3125#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:04,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {3125#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3126#(and (<= main_~s~0 5865) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:04,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {3126#(and (<= main_~s~0 5865) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3127#(and (<= 0 main_~s~0) (<= main_~s~0 6120))} is VALID [2022-04-07 12:25:04,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {3127#(and (<= 0 main_~s~0) (<= main_~s~0 6120))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3128#(and (<= main_~s~0 6375) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:04,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {3128#(and (<= main_~s~0 6375) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3129#(and (<= main_~s~0 6630) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:04,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {3129#(and (<= main_~s~0 6630) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3130#(and (<= main_~s~0 6885) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:04,980 INFO L290 TraceCheckUtils]: 34: Hoare triple {3130#(and (<= main_~s~0 6885) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3131#(and (<= main_~s~0 7140) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:04,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {3131#(and (<= main_~s~0 7140) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3132#(and (<= 0 main_~s~0) (<= main_~s~0 7395))} is VALID [2022-04-07 12:25:04,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {3132#(and (<= 0 main_~s~0) (<= main_~s~0 7395))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} is VALID [2022-04-07 12:25:04,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} is VALID [2022-04-07 12:25:04,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} is VALID [2022-04-07 12:25:04,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} assume ~s~0 % 4294967296 > 65025; {3099#false} is VALID [2022-04-07 12:25:04,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {3099#false} assume !false; {3099#false} is VALID [2022-04-07 12:25:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:25:04,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:25:04,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351374362] [2022-04-07 12:25:04,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351374362] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:25:04,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810426779] [2022-04-07 12:25:04,984 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 12:25:04,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:25:04,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:25:04,987 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:25:04,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-07 12:25:05,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 12:25:05,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:25:05,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-07 12:25:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:05,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:25:10,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {3098#true} call ULTIMATE.init(); {3098#true} is VALID [2022-04-07 12:25:10,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {3098#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {3098#true} is VALID [2022-04-07 12:25:10,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {3098#true} assume true; {3098#true} is VALID [2022-04-07 12:25:10,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3098#true} {3098#true} #38#return; {3098#true} is VALID [2022-04-07 12:25:10,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {3098#true} call #t~ret7 := main(); {3098#true} is VALID [2022-04-07 12:25:10,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {3098#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3098#true} is VALID [2022-04-07 12:25:10,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {3098#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3103#(= main_~s~0 0)} is VALID [2022-04-07 12:25:10,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {3103#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3104#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-07 12:25:10,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {3104#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3105#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:10,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {3105#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3106#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:10,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {3106#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3107#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-07 12:25:10,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {3107#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3108#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-07 12:25:10,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {3108#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3109#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-07 12:25:10,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {3109#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3110#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-07 12:25:10,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {3110#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3111#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:10,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {3111#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3112#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-07 12:25:10,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {3112#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3113#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:10,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {3113#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3114#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-07 12:25:10,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {3114#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3115#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:10,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {3115#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3116#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:10,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {3116#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3117#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:10,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {3117#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3118#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-07 12:25:10,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {3118#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3119#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-07 12:25:10,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {3119#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3120#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-07 12:25:10,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {3120#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3121#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:10,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {3121#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3122#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-07 12:25:10,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {3122#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3123#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-07 12:25:10,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {3123#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3124#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-07 12:25:10,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {3124#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3125#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:10,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {3125#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3126#(and (<= main_~s~0 5865) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:10,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {3126#(and (<= main_~s~0 5865) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3127#(and (<= 0 main_~s~0) (<= main_~s~0 6120))} is VALID [2022-04-07 12:25:10,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {3127#(and (<= 0 main_~s~0) (<= main_~s~0 6120))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3128#(and (<= main_~s~0 6375) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:10,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {3128#(and (<= main_~s~0 6375) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3129#(and (<= main_~s~0 6630) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:10,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {3129#(and (<= main_~s~0 6630) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3130#(and (<= main_~s~0 6885) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:10,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {3130#(and (<= main_~s~0 6885) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3131#(and (<= main_~s~0 7140) (<= 0 main_~s~0))} is VALID [2022-04-07 12:25:10,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {3131#(and (<= main_~s~0 7140) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3132#(and (<= 0 main_~s~0) (<= main_~s~0 7395))} is VALID [2022-04-07 12:25:10,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {3132#(and (<= 0 main_~s~0) (<= main_~s~0 7395))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} is VALID [2022-04-07 12:25:10,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} is VALID [2022-04-07 12:25:10,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} is VALID [2022-04-07 12:25:10,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {3133#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} assume ~s~0 % 4294967296 > 65025; {3099#false} is VALID [2022-04-07 12:25:10,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {3099#false} assume !false; {3099#false} is VALID [2022-04-07 12:25:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:25:10,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:25:53,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {3099#false} assume !false; {3099#false} is VALID [2022-04-07 12:25:53,297 INFO L290 TraceCheckUtils]: 39: Hoare triple {3261#(not (< 65025 (mod main_~s~0 4294967296)))} assume ~s~0 % 4294967296 > 65025; {3099#false} is VALID [2022-04-07 12:25:53,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {3261#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~s~0 % 4294967296 < ~v~0 % 256 % 4294967296); {3261#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-07 12:25:53,297 INFO L290 TraceCheckUtils]: 37: Hoare triple {3261#(not (< 65025 (mod main_~s~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {3261#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-07 12:25:53,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {3271#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3261#(not (< 65025 (mod main_~s~0 4294967296)))} is VALID [2022-04-07 12:25:53,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {3275#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3271#(<= (div (+ (* (- 1) main_~s~0) 64770) (- 4294967296)) (+ (div (+ main_~s~0 (- 4294967296)) 4294967296) 1))} is VALID [2022-04-07 12:25:53,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {3279#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3275#(<= (div (+ (- 4294902781) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~s~0) 4294967296) 3))} is VALID [2022-04-07 12:25:53,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {3283#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3279#(<= (div (+ (- 8589870332) (* (- 1) main_~s~0)) (- 4294967296)) (+ 5 (div (+ main_~s~0 (- 12884901888)) 4294967296)))} is VALID [2022-04-07 12:25:53,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {3287#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3283#(<= (div (+ (- 12884837883) (* (- 1) main_~s~0)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:25:53,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {3291#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3287#(<= (div (+ (* (- 1) main_~s~0) (- 17179805434)) (- 4294967296)) (+ (div (+ main_~s~0 (- 21474836480)) 4294967296) 9))} is VALID [2022-04-07 12:25:53,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {3295#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3291#(<= (div (+ (- 21474772985) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 25769803776)) 4294967296) 11))} is VALID [2022-04-07 12:25:53,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {3299#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3295#(<= (div (+ (- 25769740536) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 30064771072)) 4294967296) 13))} is VALID [2022-04-07 12:25:53,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {3303#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3299#(<= (div (+ (- 30064708087) (* (- 1) main_~s~0)) (- 4294967296)) (+ 15 (div (+ main_~s~0 (- 34359738368)) 4294967296)))} is VALID [2022-04-07 12:25:53,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {3307#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3303#(<= (div (+ (- 34359675638) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 38654705664)) 4294967296) 17))} is VALID [2022-04-07 12:25:53,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {3311#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3307#(<= (div (+ (- 38654643189) (* (- 1) main_~s~0)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:25:53,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {3315#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3311#(<= (div (+ (* (- 1) main_~s~0) (- 42949610740)) (- 4294967296)) (+ (div (+ main_~s~0 (- 47244640256)) 4294967296) 21))} is VALID [2022-04-07 12:25:53,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {3319#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3315#(<= (div (+ (* (- 1) main_~s~0) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:25:53,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {3323#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3319#(<= (div (+ (- 51539545842) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 55834574848) main_~s~0) 4294967296) 25))} is VALID [2022-04-07 12:25:53,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {3327#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3323#(<= (div (+ (- 55834513393) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 60129542144)) 4294967296) 27))} is VALID [2022-04-07 12:25:53,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {3331#(<= (div (+ (* (- 1) main_~s~0) (- 64424448495)) (- 4294967296)) (+ 31 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3327#(<= (div (+ (- 60129480944) (* (- 1) main_~s~0)) (- 4294967296)) (+ 29 (div (+ (- 64424509440) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:25:53,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {3335#(<= (div (+ (- 68719416046) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 33))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3331#(<= (div (+ (* (- 1) main_~s~0) (- 64424448495)) (- 4294967296)) (+ 31 (div (+ main_~s~0 (- 68719476736)) 4294967296)))} is VALID [2022-04-07 12:25:53,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {3339#(<= (div (+ (- 73014383597) (* (- 1) main_~s~0)) (- 4294967296)) (+ 35 (div (+ (- 77309411328) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3335#(<= (div (+ (- 68719416046) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 73014444032) main_~s~0) 4294967296) 33))} is VALID [2022-04-07 12:25:53,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {3343#(<= (div (+ (- 77309351148) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 37))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3339#(<= (div (+ (- 73014383597) (* (- 1) main_~s~0)) (- 4294967296)) (+ 35 (div (+ (- 77309411328) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:25:53,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {3347#(<= (div (+ (- 81604318699) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 85899345920)) 4294967296) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3343#(<= (div (+ (- 77309351148) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ (- 81604378624) main_~s~0) 4294967296) 37))} is VALID [2022-04-07 12:25:53,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {3351#(<= (div (+ (* (- 1) main_~s~0) (- 85899286250)) (- 4294967296)) (+ 41 (div (+ main_~s~0 (- 90194313216)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3347#(<= (div (+ (- 81604318699) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 85899345920)) 4294967296) 39))} is VALID [2022-04-07 12:25:53,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {3355#(<= (div (+ (* (- 1) main_~s~0) (- 90194253801)) (- 4294967296)) (+ 43 (div (+ (- 94489280512) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3351#(<= (div (+ (* (- 1) main_~s~0) (- 85899286250)) (- 4294967296)) (+ 41 (div (+ main_~s~0 (- 90194313216)) 4294967296)))} is VALID [2022-04-07 12:25:53,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {3359#(<= (div (+ (* (- 1) main_~s~0) (- 94489221352)) (- 4294967296)) (+ (div (+ main_~s~0 (- 98784247808)) 4294967296) 45))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3355#(<= (div (+ (* (- 1) main_~s~0) (- 90194253801)) (- 4294967296)) (+ 43 (div (+ (- 94489280512) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:25:53,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {3363#(<= (div (+ (- 98784188903) (* (- 1) main_~s~0)) (- 4294967296)) (+ 47 (div (+ (- 103079215104) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3359#(<= (div (+ (* (- 1) main_~s~0) (- 94489221352)) (- 4294967296)) (+ (div (+ main_~s~0 (- 98784247808)) 4294967296) 45))} is VALID [2022-04-07 12:25:53,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {3367#(<= (div (+ (- 103079156454) (* (- 1) main_~s~0)) (- 4294967296)) (+ 49 (div (+ (- 107374182400) main_~s~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3363#(<= (div (+ (- 98784188903) (* (- 1) main_~s~0)) (- 4294967296)) (+ 47 (div (+ (- 103079215104) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:25:53,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {3371#(<= (div (+ (- 107374124005) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 111669149696)) 4294967296) 51))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3367#(<= (div (+ (- 103079156454) (* (- 1) main_~s~0)) (- 4294967296)) (+ 49 (div (+ (- 107374182400) main_~s~0) 4294967296)))} is VALID [2022-04-07 12:25:53,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {3375#(<= (div (+ (* (- 1) main_~s~0) (- 111669091556)) (- 4294967296)) (+ 53 (div (+ main_~s~0 (- 115964116992)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3371#(<= (div (+ (- 107374124005) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 111669149696)) 4294967296) 51))} is VALID [2022-04-07 12:25:53,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {3379#(<= (div (+ (- 115964059107) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 120259084288)) 4294967296) 55))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3375#(<= (div (+ (* (- 1) main_~s~0) (- 111669091556)) (- 4294967296)) (+ 53 (div (+ main_~s~0 (- 115964116992)) 4294967296)))} is VALID [2022-04-07 12:25:53,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {3383#(<= (div (+ (* (- 1) main_~s~0) (- 120259026658)) (- 4294967296)) (+ (div (+ main_~s~0 (- 124554051584)) 4294967296) 57))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3379#(<= (div (+ (- 115964059107) (* (- 1) main_~s~0)) (- 4294967296)) (+ (div (+ main_~s~0 (- 120259084288)) 4294967296) 55))} is VALID [2022-04-07 12:25:53,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {3387#(<= (div (+ (- 124553994209) (* (- 1) main_~s~0)) (- 4294967296)) (+ 59 (div (+ main_~s~0 (- 128849018880)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {3383#(<= (div (+ (* (- 1) main_~s~0) (- 120259026658)) (- 4294967296)) (+ (div (+ main_~s~0 (- 124554051584)) 4294967296) 57))} is VALID [2022-04-07 12:25:53,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {3098#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {3387#(<= (div (+ (- 124553994209) (* (- 1) main_~s~0)) (- 4294967296)) (+ 59 (div (+ main_~s~0 (- 128849018880)) 4294967296)))} is VALID [2022-04-07 12:25:53,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {3098#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {3098#true} is VALID [2022-04-07 12:25:53,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {3098#true} call #t~ret7 := main(); {3098#true} is VALID [2022-04-07 12:25:53,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3098#true} {3098#true} #38#return; {3098#true} is VALID [2022-04-07 12:25:53,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {3098#true} assume true; {3098#true} is VALID [2022-04-07 12:25:53,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {3098#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {3098#true} is VALID [2022-04-07 12:25:53,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {3098#true} call ULTIMATE.init(); {3098#true} is VALID [2022-04-07 12:25:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:25:53,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810426779] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:25:53,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:25:53,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 65 [2022-04-07 12:25:53,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305804470] [2022-04-07 12:25:53,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:25:53,617 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-07 12:25:53,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:25:53,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:53,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:25:53,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-07 12:25:53,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:25:53,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-07 12:25:53,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2022-04-07 12:25:53,877 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:59,174 INFO L93 Difference]: Finished difference Result 142 states and 189 transitions. [2022-04-07 12:25:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-07 12:25:59,175 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-07 12:25:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:25:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 189 transitions. [2022-04-07 12:25:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 189 transitions. [2022-04-07 12:25:59,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 189 transitions. [2022-04-07 12:25:59,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:25:59,633 INFO L225 Difference]: With dead ends: 142 [2022-04-07 12:25:59,633 INFO L226 Difference]: Without dead ends: 92 [2022-04-07 12:25:59,637 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 23 SyntacticMatches, 31 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2791 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=6048, Invalid=9954, Unknown=0, NotChecked=0, Total=16002 [2022-04-07 12:25:59,638 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 341 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-07 12:25:59,638 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 33 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-07 12:25:59,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-07 12:25:59,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2022-04-07 12:25:59,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:25:59,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 77 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:59,778 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 77 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:59,778 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 77 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:59,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:59,781 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-07 12:25:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-07 12:25:59,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:59,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:59,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-07 12:25:59,782 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-07 12:25:59,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:59,784 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-07 12:25:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-07 12:25:59,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:59,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:59,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:25:59,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:25:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:59,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2022-04-07 12:25:59,786 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 41 [2022-04-07 12:25:59,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:25:59,786 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2022-04-07 12:25:59,787 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.123076923076923) internal successors, (73), 64 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2022-04-07 12:25:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-07 12:25:59,787 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:25:59,788 INFO L499 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:25:59,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-07 12:26:00,007 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-07 12:26:00,008 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:26:00,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:26:00,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1034766295, now seen corresponding path program 5 times [2022-04-07 12:26:00,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:26:00,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531263537] [2022-04-07 12:26:00,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:26:00,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:26:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:01,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:26:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:01,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {4124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {4072#true} is VALID [2022-04-07 12:26:01,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {4072#true} assume true; {4072#true} is VALID [2022-04-07 12:26:01,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4072#true} {4072#true} #38#return; {4072#true} is VALID [2022-04-07 12:26:01,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {4072#true} call ULTIMATE.init(); {4124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:26:01,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {4124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {4072#true} is VALID [2022-04-07 12:26:01,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {4072#true} assume true; {4072#true} is VALID [2022-04-07 12:26:01,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4072#true} {4072#true} #38#return; {4072#true} is VALID [2022-04-07 12:26:01,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {4072#true} call #t~ret7 := main(); {4072#true} is VALID [2022-04-07 12:26:01,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {4072#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {4072#true} is VALID [2022-04-07 12:26:01,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {4072#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {4077#(= main_~s~0 0)} is VALID [2022-04-07 12:26:01,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {4077#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4078#(and (<= 0 main_~s~0) (<= main_~s~0 255))} is VALID [2022-04-07 12:26:01,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {4078#(and (<= 0 main_~s~0) (<= main_~s~0 255))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4079#(and (<= main_~s~0 510) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {4079#(and (<= main_~s~0 510) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4080#(and (<= main_~s~0 765) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {4080#(and (<= main_~s~0 765) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4081#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} is VALID [2022-04-07 12:26:01,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {4081#(and (<= 0 main_~s~0) (<= main_~s~0 1020))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4082#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} is VALID [2022-04-07 12:26:01,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {4082#(and (<= 0 main_~s~0) (<= main_~s~0 1275))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4083#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} is VALID [2022-04-07 12:26:01,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {4083#(and (<= 0 main_~s~0) (<= main_~s~0 1530))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4084#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} is VALID [2022-04-07 12:26:01,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {4084#(and (<= 0 main_~s~0) (<= main_~s~0 1785))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4085#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {4085#(and (<= main_~s~0 2040) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4086#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} is VALID [2022-04-07 12:26:01,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {4086#(and (<= 0 main_~s~0) (<= main_~s~0 2295))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4087#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {4087#(and (<= main_~s~0 2550) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4088#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} is VALID [2022-04-07 12:26:01,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {4088#(and (<= 0 main_~s~0) (<= main_~s~0 2805))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4089#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {4089#(and (<= main_~s~0 3060) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4090#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {4090#(and (<= main_~s~0 3315) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4091#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {4091#(and (<= main_~s~0 3570) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4092#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} is VALID [2022-04-07 12:26:01,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {4092#(and (<= 0 main_~s~0) (<= main_~s~0 3825))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4093#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} is VALID [2022-04-07 12:26:01,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {4093#(and (<= 0 main_~s~0) (<= main_~s~0 4080))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4094#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} is VALID [2022-04-07 12:26:01,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {4094#(and (<= 0 main_~s~0) (<= main_~s~0 4335))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4095#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {4095#(and (<= main_~s~0 4590) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4096#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} is VALID [2022-04-07 12:26:01,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {4096#(and (<= 0 main_~s~0) (<= main_~s~0 4845))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4097#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} is VALID [2022-04-07 12:26:01,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {4097#(and (<= 0 main_~s~0) (<= main_~s~0 5100))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4098#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} is VALID [2022-04-07 12:26:01,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {4098#(and (<= 0 main_~s~0) (<= main_~s~0 5355))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4099#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {4099#(and (<= main_~s~0 5610) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4100#(and (<= main_~s~0 5865) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {4100#(and (<= main_~s~0 5865) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4101#(and (<= 0 main_~s~0) (<= main_~s~0 6120))} is VALID [2022-04-07 12:26:01,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {4101#(and (<= 0 main_~s~0) (<= main_~s~0 6120))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4102#(and (<= main_~s~0 6375) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {4102#(and (<= main_~s~0 6375) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4103#(and (<= main_~s~0 6630) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {4103#(and (<= main_~s~0 6630) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4104#(and (<= main_~s~0 6885) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {4104#(and (<= main_~s~0 6885) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4105#(and (<= main_~s~0 7140) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {4105#(and (<= main_~s~0 7140) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4106#(and (<= 0 main_~s~0) (<= main_~s~0 7395))} is VALID [2022-04-07 12:26:01,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {4106#(and (<= 0 main_~s~0) (<= main_~s~0 7395))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4107#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} is VALID [2022-04-07 12:26:01,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {4107#(and (<= 0 main_~s~0) (<= main_~s~0 7650))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4108#(and (<= main_~s~0 7905) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {4108#(and (<= main_~s~0 7905) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4109#(and (<= main_~s~0 8160) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {4109#(and (<= main_~s~0 8160) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4110#(and (<= main_~s~0 8415) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {4110#(and (<= main_~s~0 8415) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4111#(and (<= 0 main_~s~0) (<= main_~s~0 8670))} is VALID [2022-04-07 12:26:01,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {4111#(and (<= 0 main_~s~0) (<= main_~s~0 8670))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4112#(and (<= main_~s~0 8925) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {4112#(and (<= main_~s~0 8925) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4113#(and (<= 0 main_~s~0) (<= main_~s~0 9180))} is VALID [2022-04-07 12:26:01,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {4113#(and (<= 0 main_~s~0) (<= main_~s~0 9180))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4114#(and (<= main_~s~0 9435) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {4114#(and (<= main_~s~0 9435) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4115#(and (<= main_~s~0 9690) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,364 INFO L290 TraceCheckUtils]: 45: Hoare triple {4115#(and (<= main_~s~0 9690) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4116#(and (<= 0 main_~s~0) (<= main_~s~0 9945))} is VALID [2022-04-07 12:26:01,364 INFO L290 TraceCheckUtils]: 46: Hoare triple {4116#(and (<= 0 main_~s~0) (<= main_~s~0 9945))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4117#(and (<= 0 main_~s~0) (<= main_~s~0 10200))} is VALID [2022-04-07 12:26:01,365 INFO L290 TraceCheckUtils]: 47: Hoare triple {4117#(and (<= 0 main_~s~0) (<= main_~s~0 10200))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4118#(and (<= 0 main_~s~0) (<= main_~s~0 10455))} is VALID [2022-04-07 12:26:01,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {4118#(and (<= 0 main_~s~0) (<= main_~s~0 10455))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4119#(and (<= 0 main_~s~0) (<= main_~s~0 10710))} is VALID [2022-04-07 12:26:01,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {4119#(and (<= 0 main_~s~0) (<= main_~s~0 10710))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4120#(and (<= main_~s~0 10965) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,367 INFO L290 TraceCheckUtils]: 50: Hoare triple {4120#(and (<= main_~s~0 10965) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4121#(and (<= main_~s~0 11220) (<= 0 main_~s~0))} is VALID [2022-04-07 12:26:01,368 INFO L290 TraceCheckUtils]: 51: Hoare triple {4121#(and (<= main_~s~0 11220) (<= 0 main_~s~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4122#(and (<= 0 main_~s~0) (<= main_~s~0 11475))} is VALID [2022-04-07 12:26:01,369 INFO L290 TraceCheckUtils]: 52: Hoare triple {4122#(and (<= 0 main_~s~0) (<= main_~s~0 11475))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {4123#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-07 12:26:01,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {4123#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {4123#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} is VALID [2022-04-07 12:26:01,370 INFO L290 TraceCheckUtils]: 54: Hoare triple {4123#(and (<= (div main_~s~0 4294967296) 0) (<= main_~v~0 (+ main_~s~0 (* (div main_~v~0 256) 256))))} assume ~s~0 % 4294967296 < ~v~0 % 256 % 4294967296; {4073#false} is VALID [2022-04-07 12:26:01,370 INFO L290 TraceCheckUtils]: 55: Hoare triple {4073#false} assume !false; {4073#false} is VALID [2022-04-07 12:26:01,371 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-07 12:26:01,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:26:01,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531263537] [2022-04-07 12:26:01,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531263537] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:26:01,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988594001] [2022-04-07 12:26:01,372 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 12:26:01,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:26:01,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:26:01,375 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:26:01,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process