/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/heavy-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:16:54,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:16:54,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:16:54,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:16:54,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:16:54,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:16:54,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:16:54,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:16:54,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:16:54,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:16:54,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:16:54,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:16:54,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:16:54,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:16:54,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:16:54,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:16:54,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:16:54,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:16:54,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:16:54,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:16:54,782 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:16:54,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:16:54,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:16:54,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:16:54,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:16:54,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:16:54,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:16:54,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:16:54,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:16:54,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:16:54,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:16:54,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:16:54,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:16:54,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:16:54,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:16:54,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:16:54,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:16:54,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:16:54,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:16:54,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:16:54,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:16:54,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:16:54,801 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:16:54,823 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:16:54,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:16:54,824 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:16:54,824 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:16:54,825 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:16:54,825 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:16:54,825 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:16:54,825 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:16:54,825 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:16:54,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:16:54,826 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:16:54,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:16:54,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:16:54,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:16:54,827 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:16:54,827 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:16:54,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:16:54,827 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:16:54,828 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:16:54,828 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:16:54,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:16:54,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:16:54,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:16:54,828 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:16:54,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:54,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:16:54,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:16:54,828 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:16:54,829 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:16:54,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:16:54,829 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:16:54,829 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:16:54,829 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:16:54,829 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:16:55,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:16:55,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:16:55,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:16:55,039 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:16:55,039 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:16:55,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/heavy-2.c [2022-04-27 10:16:55,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/225cf3ae6/8c62c185757c4dc78cfa66068afe79af/FLAGa6418e205 [2022-04-27 10:16:55,462 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:16:55,462 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy-2.c [2022-04-27 10:16:55,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/225cf3ae6/8c62c185757c4dc78cfa66068afe79af/FLAGa6418e205 [2022-04-27 10:16:55,474 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/225cf3ae6/8c62c185757c4dc78cfa66068afe79af [2022-04-27 10:16:55,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:16:55,477 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:16:55,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:55,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:16:55,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:16:55,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:55" (1/1) ... [2022-04-27 10:16:55,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71244a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:55, skipping insertion in model container [2022-04-27 10:16:55,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:55" (1/1) ... [2022-04-27 10:16:55,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:16:55,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:16:55,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy-2.c[600,613] [2022-04-27 10:16:55,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:55,708 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:16:55,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy-2.c[600,613] [2022-04-27 10:16:55,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:55,797 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:16:55,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:55 WrapperNode [2022-04-27 10:16:55,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:55,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:16:55,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:16:55,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:16:55,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:55" (1/1) ... [2022-04-27 10:16:55,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:55" (1/1) ... [2022-04-27 10:16:55,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:55" (1/1) ... [2022-04-27 10:16:55,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:55" (1/1) ... [2022-04-27 10:16:55,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:55" (1/1) ... [2022-04-27 10:16:55,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:55" (1/1) ... [2022-04-27 10:16:55,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:55" (1/1) ... [2022-04-27 10:16:55,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:16:55,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:16:55,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:16:55,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:16:55,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:55" (1/1) ... [2022-04-27 10:16:55,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:55,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:55,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:16:55,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:16:55,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:16:55,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:16:55,879 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:16:55,880 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:16:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:16:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:16:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:16:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:16:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:16:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:16:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:16:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:16:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:16:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-27 10:16:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:16:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:16:55,933 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:16:55,934 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:16:56,102 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:16:56,106 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:16:56,107 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 10:16:56,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:56 BoogieIcfgContainer [2022-04-27 10:16:56,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:16:56,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:16:56,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:16:56,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:16:56,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:16:55" (1/3) ... [2022-04-27 10:16:56,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3386a1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:56, skipping insertion in model container [2022-04-27 10:16:56,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:55" (2/3) ... [2022-04-27 10:16:56,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3386a1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:56, skipping insertion in model container [2022-04-27 10:16:56,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:56" (3/3) ... [2022-04-27 10:16:56,115 INFO L111 eAbstractionObserver]: Analyzing ICFG heavy-2.c [2022-04-27 10:16:56,124 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:16:56,124 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:16:56,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:16:56,158 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b0e349a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@354dc288 [2022-04-27 10:16:56,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:16:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 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-27 10:16:56,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-27 10:16:56,168 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:56,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:56,169 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:56,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:56,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1947864061, now seen corresponding path program 1 times [2022-04-27 10:16:56,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:56,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437177733] [2022-04-27 10:16:56,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:56,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {22#true} is VALID [2022-04-27 10:16:56,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-27 10:16:56,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #54#return; {22#true} is VALID [2022-04-27 10:16:56,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:56,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {22#true} is VALID [2022-04-27 10:16:56,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-27 10:16:56,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #54#return; {22#true} is VALID [2022-04-27 10:16:56,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {22#true} is VALID [2022-04-27 10:16:56,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {22#true} is VALID [2022-04-27 10:16:56,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-27 10:16:56,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} assume 1 != ~a~0 % 4294967296; {23#false} is VALID [2022-04-27 10:16:56,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-27 10:16:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:56,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:56,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437177733] [2022-04-27 10:16:56,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437177733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:56,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:56,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:16:56,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280637371] [2022-04-27 10:16:56,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:56,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 9 [2022-04-27 10:16:56,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:56,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-27 10:16:56,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:56,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:16:56,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:56,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:16:56,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:16:56,343 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-27 10:16:56,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:56,463 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2022-04-27 10:16:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:16:56,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 9 [2022-04-27 10:16:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-27 10:16:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 10:16:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-27 10:16:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 10:16:56,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-27 10:16:56,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:56,555 INFO L225 Difference]: With dead ends: 42 [2022-04-27 10:16:56,556 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 10:16:56,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:16:56,561 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:56,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:16:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 10:16:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2022-04-27 10:16:56,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:56,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-27 10:16:56,582 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-27 10:16:56,582 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-27 10:16:56,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:56,584 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-27 10:16:56,584 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-27 10:16:56,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:56,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:56,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 23 states. [2022-04-27 10:16:56,585 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 23 states. [2022-04-27 10:16:56,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:56,586 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-27 10:16:56,587 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-27 10:16:56,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:56,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:56,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:56,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-27 10:16:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-27 10:16:56,589 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-04-27 10:16:56,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:56,590 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-27 10:16:56,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-27 10:16:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 10:16:56,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-27 10:16:56,591 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:56,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:56,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:16:56,592 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:56,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:56,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1947835231, now seen corresponding path program 1 times [2022-04-27 10:16:56,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:56,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642272194] [2022-04-27 10:16:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:56,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {157#true} is VALID [2022-04-27 10:16:56,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} assume true; {157#true} is VALID [2022-04-27 10:16:56,671 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {157#true} {157#true} #54#return; {157#true} is VALID [2022-04-27 10:16:56,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} call ULTIMATE.init(); {163#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:56,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {157#true} is VALID [2022-04-27 10:16:56,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} assume true; {157#true} is VALID [2022-04-27 10:16:56,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} #54#return; {157#true} is VALID [2022-04-27 10:16:56,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {157#true} is VALID [2022-04-27 10:16:56,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {162#(= main_~i~0 0)} is VALID [2022-04-27 10:16:56,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < 1048576); {158#false} is VALID [2022-04-27 10:16:56,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {158#false} assume 1 != ~a~0 % 4294967296; {158#false} is VALID [2022-04-27 10:16:56,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {158#false} assume !false; {158#false} is VALID [2022-04-27 10:16:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:56,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:56,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642272194] [2022-04-27 10:16:56,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642272194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:56,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:56,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:16:56,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478204465] [2022-04-27 10:16:56,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:56,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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 9 [2022-04-27 10:16:56,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:56,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-27 10:16:56,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:56,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:16:56,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:56,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:16:56,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:16:56,685 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-27 10:16:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:56,807 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-27 10:16:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:16:56,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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 9 [2022-04-27 10:16:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:56,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-27 10:16:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-27 10:16:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-27 10:16:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-27 10:16:56,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-27 10:16:56,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:56,855 INFO L225 Difference]: With dead ends: 36 [2022-04-27 10:16:56,855 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 10:16:56,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:16:56,857 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:56,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 20 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 10:16:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 16. [2022-04-27 10:16:56,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:56,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-27 10:16:56,864 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-27 10:16:56,865 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-27 10:16:56,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:56,866 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-27 10:16:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-27 10:16:56,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:56,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:56,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 33 states. [2022-04-27 10:16:56,869 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 33 states. [2022-04-27 10:16:56,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:56,871 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-27 10:16:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-27 10:16:56,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:56,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:56,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:56,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-27 10:16:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-27 10:16:56,874 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2022-04-27 10:16:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:56,874 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-27 10:16:56,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-27 10:16:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 10:16:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:16:56,875 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:56,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:56,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:16:56,876 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:56,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:56,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1310776898, now seen corresponding path program 1 times [2022-04-27 10:16:56,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:56,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612723804] [2022-04-27 10:16:56,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:56,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {319#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {313#true} is VALID [2022-04-27 10:16:56,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#true} assume true; {313#true} is VALID [2022-04-27 10:16:56,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {313#true} {313#true} #54#return; {313#true} is VALID [2022-04-27 10:16:56,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {313#true} call ULTIMATE.init(); {319#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:56,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {313#true} is VALID [2022-04-27 10:16:56,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#true} assume true; {313#true} is VALID [2022-04-27 10:16:56,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {313#true} {313#true} #54#return; {313#true} is VALID [2022-04-27 10:16:56,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {313#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {313#true} is VALID [2022-04-27 10:16:56,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {313#true} is VALID [2022-04-27 10:16:56,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#true} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {318#(= main_~j~0 0)} is VALID [2022-04-27 10:16:56,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {318#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < 1048576); {314#false} is VALID [2022-04-27 10:16:56,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {314#false} is VALID [2022-04-27 10:16:56,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#false} assume !(~i~0 % 4294967296 < 1048576); {314#false} is VALID [2022-04-27 10:16:56,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#false} assume 1 != ~a~0 % 4294967296; {314#false} is VALID [2022-04-27 10:16:56,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#false} assume !false; {314#false} is VALID [2022-04-27 10:16:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:56,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:56,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612723804] [2022-04-27 10:16:56,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612723804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:56,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:56,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:16:56,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520667675] [2022-04-27 10:16:56,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:56,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 12 [2022-04-27 10:16:56,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:56,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-27 10:16:56,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:56,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:16:56,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:56,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:16:56,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:16:56,997 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-27 10:16:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:57,082 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 10:16:57,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:16:57,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 12 [2022-04-27 10:16:57,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-27 10:16:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-27 10:16:57,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-27 10:16:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-27 10:16:57,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-27 10:16:57,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:57,151 INFO L225 Difference]: With dead ends: 40 [2022-04-27 10:16:57,151 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 10:16:57,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:16:57,154 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:57,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 20 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:16:57,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 10:16:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2022-04-27 10:16:57,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:57,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-27 10:16:57,162 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-27 10:16:57,162 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-27 10:16:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:57,163 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-04-27 10:16:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-04-27 10:16:57,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:57,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:57,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 31 states. [2022-04-27 10:16:57,164 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 31 states. [2022-04-27 10:16:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:57,165 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-04-27 10:16:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-04-27 10:16:57,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:57,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:57,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:57,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-27 10:16:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 10:16:57,168 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-27 10:16:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:57,168 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 10:16:57,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-27 10:16:57,168 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 10:16:57,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:16:57,169 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:57,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:57,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:16:57,170 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:57,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:57,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1718535333, now seen corresponding path program 1 times [2022-04-27 10:16:57,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:57,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660680084] [2022-04-27 10:16:57,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:57,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {480#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {474#true} is VALID [2022-04-27 10:16:57,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-27 10:16:57,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {474#true} {474#true} #54#return; {474#true} is VALID [2022-04-27 10:16:57,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {480#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:57,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {474#true} is VALID [2022-04-27 10:16:57,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-27 10:16:57,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #54#return; {474#true} is VALID [2022-04-27 10:16:57,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {474#true} is VALID [2022-04-27 10:16:57,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {474#true} is VALID [2022-04-27 10:16:57,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {474#true} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {474#true} is VALID [2022-04-27 10:16:57,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {479#(= main_~k~0 0)} is VALID [2022-04-27 10:16:57,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {479#(= main_~k~0 0)} assume !(~k~0 % 4294967296 < 1048576); {475#false} is VALID [2022-04-27 10:16:57,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {475#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {475#false} is VALID [2022-04-27 10:16:57,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {475#false} assume !(~j~0 % 4294967296 < 1048576); {475#false} is VALID [2022-04-27 10:16:57,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {475#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {475#false} is VALID [2022-04-27 10:16:57,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {475#false} assume !(~i~0 % 4294967296 < 1048576); {475#false} is VALID [2022-04-27 10:16:57,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {475#false} assume 1 != ~a~0 % 4294967296; {475#false} is VALID [2022-04-27 10:16:57,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-27 10:16:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:57,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:57,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660680084] [2022-04-27 10:16:57,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660680084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:57,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:57,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:16:57,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336309668] [2022-04-27 10:16:57,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:57,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 15 [2022-04-27 10:16:57,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:57,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-27 10:16:57,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:57,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:16:57,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:57,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:16:57,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:16:57,246 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-27 10:16:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:57,316 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-04-27 10:16:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:16:57,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 15 [2022-04-27 10:16:57,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-27 10:16:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 10:16:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-27 10:16:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 10:16:57,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-27 10:16:57,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:57,345 INFO L225 Difference]: With dead ends: 31 [2022-04-27 10:16:57,345 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 10:16:57,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:16:57,346 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:57,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:16:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 10:16:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-04-27 10:16:57,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:57,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-27 10:16:57,349 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-27 10:16:57,349 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-27 10:16:57,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:57,350 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-27 10:16:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-27 10:16:57,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:57,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:57,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 21 states. [2022-04-27 10:16:57,350 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 21 states. [2022-04-27 10:16:57,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:57,351 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-27 10:16:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-27 10:16:57,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:57,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:57,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:57,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-27 10:16:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-27 10:16:57,352 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2022-04-27 10:16:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:57,352 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-27 10:16:57,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-27 10:16:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 10:16:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:16:57,353 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:57,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:57,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:16:57,353 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:57,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:57,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1543508103, now seen corresponding path program 1 times [2022-04-27 10:16:57,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:57,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846943778] [2022-04-27 10:16:57,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:57,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {612#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {605#true} is VALID [2022-04-27 10:16:57,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 10:16:57,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {605#true} {605#true} #54#return; {605#true} is VALID [2022-04-27 10:16:57,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {612#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:57,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {612#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {605#true} is VALID [2022-04-27 10:16:57,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 10:16:57,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #54#return; {605#true} is VALID [2022-04-27 10:16:57,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {605#true} is VALID [2022-04-27 10:16:57,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {605#true} is VALID [2022-04-27 10:16:57,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {605#true} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {605#true} is VALID [2022-04-27 10:16:57,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {605#true} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {610#(= main_~k~0 0)} is VALID [2022-04-27 10:16:57,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {610#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {610#(= main_~k~0 0)} is VALID [2022-04-27 10:16:57,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {610#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {611#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 1))} is VALID [2022-04-27 10:16:57,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {611#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 1))} assume !(~k~0 % 4294967296 < 1048576); {606#false} is VALID [2022-04-27 10:16:57,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {606#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {606#false} is VALID [2022-04-27 10:16:57,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {606#false} assume !(~j~0 % 4294967296 < 1048576); {606#false} is VALID [2022-04-27 10:16:57,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {606#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {606#false} is VALID [2022-04-27 10:16:57,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {606#false} assume !(~i~0 % 4294967296 < 1048576); {606#false} is VALID [2022-04-27 10:16:57,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {606#false} assume 1 != ~a~0 % 4294967296; {606#false} is VALID [2022-04-27 10:16:57,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {606#false} assume !false; {606#false} is VALID [2022-04-27 10:16:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:57,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:57,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846943778] [2022-04-27 10:16:57,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846943778] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:57,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782692156] [2022-04-27 10:16:57,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:57,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:57,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:57,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:16:57,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:16:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 10:16:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:57,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {605#true} is VALID [2022-04-27 10:16:57,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {605#true} is VALID [2022-04-27 10:16:57,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 10:16:57,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #54#return; {605#true} is VALID [2022-04-27 10:16:57,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {605#true} is VALID [2022-04-27 10:16:57,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {631#(= main_~i~0 0)} is VALID [2022-04-27 10:16:57,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {631#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {631#(= main_~i~0 0)} is VALID [2022-04-27 10:16:57,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {631#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {638#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:57,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {638#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {638#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:57,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {638#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {645#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:57,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {645#(and (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0))} assume !(~k~0 % 4294967296 < 1048576); {606#false} is VALID [2022-04-27 10:16:57,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {606#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {606#false} is VALID [2022-04-27 10:16:57,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {606#false} assume !(~j~0 % 4294967296 < 1048576); {606#false} is VALID [2022-04-27 10:16:57,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {606#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {606#false} is VALID [2022-04-27 10:16:57,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {606#false} assume !(~i~0 % 4294967296 < 1048576); {606#false} is VALID [2022-04-27 10:16:57,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {606#false} assume 1 != ~a~0 % 4294967296; {606#false} is VALID [2022-04-27 10:16:57,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {606#false} assume !false; {606#false} is VALID [2022-04-27 10:16:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:57,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:16:57,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {606#false} assume !false; {606#false} is VALID [2022-04-27 10:16:57,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {606#false} assume 1 != ~a~0 % 4294967296; {606#false} is VALID [2022-04-27 10:16:57,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {606#false} assume !(~i~0 % 4294967296 < 1048576); {606#false} is VALID [2022-04-27 10:16:57,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {606#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {606#false} is VALID [2022-04-27 10:16:57,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {606#false} assume !(~j~0 % 4294967296 < 1048576); {606#false} is VALID [2022-04-27 10:16:57,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {606#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {606#false} is VALID [2022-04-27 10:16:57,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {685#(< (mod main_~k~0 4294967296) 1048576)} assume !(~k~0 % 4294967296 < 1048576); {606#false} is VALID [2022-04-27 10:16:57,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {689#(< (mod (+ main_~k~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {685#(< (mod main_~k~0 4294967296) 1048576)} is VALID [2022-04-27 10:16:57,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {689#(< (mod (+ main_~k~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {689#(< (mod (+ main_~k~0 1) 4294967296) 1048576)} is VALID [2022-04-27 10:16:57,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {605#true} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {689#(< (mod (+ main_~k~0 1) 4294967296) 1048576)} is VALID [2022-04-27 10:16:57,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {605#true} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {605#true} is VALID [2022-04-27 10:16:57,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {605#true} is VALID [2022-04-27 10:16:57,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {605#true} is VALID [2022-04-27 10:16:57,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #54#return; {605#true} is VALID [2022-04-27 10:16:57,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 10:16:57,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {605#true} is VALID [2022-04-27 10:16:57,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {605#true} is VALID [2022-04-27 10:16:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:57,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782692156] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:16:57,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:16:57,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2022-04-27 10:16:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531187988] [2022-04-27 10:16:57,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:16:57,791 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 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-27 10:16:57,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:57,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 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-27 10:16:57,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:57,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 10:16:57,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:57,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 10:16:57,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:16:57,813 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 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-27 10:16:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:58,065 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-27 10:16:58,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 10:16:58,066 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 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-27 10:16:58,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 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-27 10:16:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-04-27 10:16:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 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-27 10:16:58,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-04-27 10:16:58,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 58 transitions. [2022-04-27 10:16:58,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:58,111 INFO L225 Difference]: With dead ends: 49 [2022-04-27 10:16:58,112 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 10:16:58,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-04-27 10:16:58,112 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:58,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 68 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 10:16:58,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2022-04-27 10:16:58,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:58,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-27 10:16:58,122 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-27 10:16:58,122 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-27 10:16:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:58,123 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-27 10:16:58,123 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-27 10:16:58,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:58,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:58,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 38 states. [2022-04-27 10:16:58,124 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 38 states. [2022-04-27 10:16:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:58,125 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-27 10:16:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-27 10:16:58,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:58,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:58,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:58,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-27 10:16:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-27 10:16:58,126 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2022-04-27 10:16:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:58,126 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-27 10:16:58,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 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-27 10:16:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 10:16:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 10:16:58,127 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:58,130 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:58,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:16:58,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:58,344 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:58,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:58,344 INFO L85 PathProgramCache]: Analyzing trace with hash -272617773, now seen corresponding path program 2 times [2022-04-27 10:16:58,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:58,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782349987] [2022-04-27 10:16:58,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:58,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {930#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {920#true} is VALID [2022-04-27 10:16:58,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-27 10:16:58,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {920#true} {920#true} #54#return; {920#true} is VALID [2022-04-27 10:16:58,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {920#true} call ULTIMATE.init(); {930#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:58,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {930#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {920#true} is VALID [2022-04-27 10:16:58,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-27 10:16:58,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {920#true} {920#true} #54#return; {920#true} is VALID [2022-04-27 10:16:58,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {920#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {920#true} is VALID [2022-04-27 10:16:58,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {920#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {920#true} is VALID [2022-04-27 10:16:58,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {920#true} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {920#true} is VALID [2022-04-27 10:16:58,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {920#true} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {925#(= main_~k~0 0)} is VALID [2022-04-27 10:16:58,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {925#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {925#(= main_~k~0 0)} is VALID [2022-04-27 10:16:58,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {925#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {926#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-27 10:16:58,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {926#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {926#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-27 10:16:58,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {926#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {927#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-27 10:16:58,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {927#(and (<= 2 main_~k~0) (<= main_~k~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {927#(and (<= 2 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-27 10:16:58,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {927#(and (<= 2 main_~k~0) (<= main_~k~0 2))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {928#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-27 10:16:58,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {928#(and (<= 3 main_~k~0) (<= main_~k~0 3))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {928#(and (<= 3 main_~k~0) (<= main_~k~0 3))} is VALID [2022-04-27 10:16:58,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {928#(and (<= 3 main_~k~0) (<= main_~k~0 3))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {929#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 4))} is VALID [2022-04-27 10:16:58,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {929#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 4))} assume !(~k~0 % 4294967296 < 1048576); {921#false} is VALID [2022-04-27 10:16:58,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {921#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {921#false} is VALID [2022-04-27 10:16:58,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {921#false} assume !(~j~0 % 4294967296 < 1048576); {921#false} is VALID [2022-04-27 10:16:58,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {921#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {921#false} is VALID [2022-04-27 10:16:58,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {921#false} assume !(~i~0 % 4294967296 < 1048576); {921#false} is VALID [2022-04-27 10:16:58,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {921#false} assume 1 != ~a~0 % 4294967296; {921#false} is VALID [2022-04-27 10:16:58,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {921#false} assume !false; {921#false} is VALID [2022-04-27 10:16:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:58,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:58,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782349987] [2022-04-27 10:16:58,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782349987] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:58,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326903920] [2022-04-27 10:16:58,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:16:58,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:58,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:58,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:16:58,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:16:58,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 10:16:58,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:16:58,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 10:16:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:58,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {920#true} call ULTIMATE.init(); {920#true} is VALID [2022-04-27 10:16:58,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {920#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {920#true} is VALID [2022-04-27 10:16:58,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-27 10:16:58,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {920#true} {920#true} #54#return; {920#true} is VALID [2022-04-27 10:16:58,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {920#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {920#true} is VALID [2022-04-27 10:16:58,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {920#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {949#(= main_~a~0 1)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {949#(= main_~a~0 1)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {949#(= main_~a~0 1)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {949#(= main_~a~0 1)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {949#(= main_~a~0 1)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {949#(= main_~a~0 1)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {949#(= main_~a~0 1)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {949#(= main_~a~0 1)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {949#(= main_~a~0 1)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {949#(= main_~a~0 1)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {949#(= main_~a~0 1)} assume !(~k~0 % 4294967296 < 1048576); {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {949#(= main_~a~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {949#(= main_~a~0 1)} assume !(~j~0 % 4294967296 < 1048576); {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {949#(= main_~a~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {949#(= main_~a~0 1)} assume !(~i~0 % 4294967296 < 1048576); {949#(= main_~a~0 1)} is VALID [2022-04-27 10:16:58,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {949#(= main_~a~0 1)} assume 1 != ~a~0 % 4294967296; {921#false} is VALID [2022-04-27 10:16:58,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {921#false} assume !false; {921#false} is VALID [2022-04-27 10:16:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 10:16:58,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:16:58,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326903920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:58,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:16:58,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-04-27 10:16:58,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026835973] [2022-04-27 10:16:58,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:58,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 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 23 [2022-04-27 10:16:58,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:58,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 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-27 10:16:58,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:58,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:16:58,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:58,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:16:58,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:16:58,672 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 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-27 10:16:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:58,698 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 10:16:58,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:16:58,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 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 23 [2022-04-27 10:16:58,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 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-27 10:16:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-04-27 10:16:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 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-27 10:16:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-04-27 10:16:58,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2022-04-27 10:16:58,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:58,710 INFO L225 Difference]: With dead ends: 24 [2022-04-27 10:16:58,710 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:16:58,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:16:58,714 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:58,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:16:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:16:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:16:58,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:58,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:16:58,715 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:16:58,715 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:16:58,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:58,715 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:16:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:16:58,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:58,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:58,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:16:58,716 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:16:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:58,716 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:16:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:16:58,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:58,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:58,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:58,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:16:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:16:58,716 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-27 10:16:58,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:58,716 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:16:58,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 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-27 10:16:58,717 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:16:58,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:58,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:16:58,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 10:16:58,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-27 10:16:58,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:16:58,950 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 10:16:58,950 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 10:16:58,950 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 10:16:58,951 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:16:58,951 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:16:58,951 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:16:58,951 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:16:58,951 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:16:58,951 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:16:58,951 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:16:58,951 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 7 23) no Hoare annotation was computed. [2022-04-27 10:16:58,951 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 7 23) no Hoare annotation was computed. [2022-04-27 10:16:58,951 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2022-04-27 10:16:58,951 INFO L895 garLoopResultBuilder]: At program point L13-3(lines 13 15) the Hoare annotation is: (= main_~a~0 1) [2022-04-27 10:16:58,951 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2022-04-27 10:16:58,951 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 7 23) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-27 10:16:58,951 INFO L895 garLoopResultBuilder]: At program point L18(lines 8 23) the Hoare annotation is: false [2022-04-27 10:16:58,952 INFO L899 garLoopResultBuilder]: For program point L14-2(lines 14 15) no Hoare annotation was computed. [2022-04-27 10:16:58,952 INFO L895 garLoopResultBuilder]: At program point L14-3(lines 14 15) the Hoare annotation is: (= main_~a~0 1) [2022-04-27 10:16:58,952 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2022-04-27 10:16:58,952 INFO L895 garLoopResultBuilder]: At program point L12-3(lines 12 15) the Hoare annotation is: (= main_~a~0 1) [2022-04-27 10:16:58,952 INFO L899 garLoopResultBuilder]: For program point L12-4(lines 8 23) no Hoare annotation was computed. [2022-04-27 10:16:58,954 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-27 10:16:58,955 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:16:58,958 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:16:58,958 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:16:58,959 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:16:58,959 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:16:58,959 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:16:58,959 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2022-04-27 10:16:58,959 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 10:16:58,960 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-27 10:16:58,961 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:16:58,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:16:58 BoogieIcfgContainer [2022-04-27 10:16:58,966 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:16:58,967 INFO L158 Benchmark]: Toolchain (without parser) took 3490.10ms. Allocated memory was 184.5MB in the beginning and 289.4MB in the end (delta: 104.9MB). Free memory was 124.8MB in the beginning and 174.9MB in the end (delta: -50.1MB). Peak memory consumption was 55.8MB. Max. memory is 8.0GB. [2022-04-27 10:16:58,967 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:16:58,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.46ms. Allocated memory was 184.5MB in the beginning and 289.4MB in the end (delta: 104.9MB). Free memory was 124.6MB in the beginning and 226.5MB in the end (delta: -102.0MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. [2022-04-27 10:16:58,968 INFO L158 Benchmark]: Boogie Preprocessor took 23.61ms. Allocated memory is still 289.4MB. Free memory was 226.5MB in the beginning and 225.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:16:58,968 INFO L158 Benchmark]: RCFGBuilder took 285.55ms. Allocated memory is still 289.4MB. Free memory was 225.0MB in the beginning and 210.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 10:16:58,968 INFO L158 Benchmark]: TraceAbstraction took 2857.19ms. Allocated memory is still 289.4MB. Free memory was 210.4MB in the beginning and 174.9MB in the end (delta: 35.5MB). Peak memory consumption was 35.5MB. Max. memory is 8.0GB. [2022-04-27 10:16:58,969 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 318.46ms. Allocated memory was 184.5MB in the beginning and 289.4MB in the end (delta: 104.9MB). Free memory was 124.6MB in the beginning and 226.5MB in the end (delta: -102.0MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.61ms. Allocated memory is still 289.4MB. Free memory was 226.5MB in the beginning and 225.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 285.55ms. Allocated memory is still 289.4MB. Free memory was 225.0MB in the beginning and 210.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2857.19ms. Allocated memory is still 289.4MB. Free memory was 210.4MB in the beginning and 174.9MB in the end (delta: 35.5MB). Peak memory consumption was 35.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 161 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 85 mSDtfsCounter, 161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=5, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 56 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 17 NumberOfFragments, 31 HoareAnnotationTreeSize, 8 FomulaSimplifications, 358 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 125 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 3 NumberOfNonLiveVariables, 177 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 29/48 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: a == 1 - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: a == 1 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: a == 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 10:16:58,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...