./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:02:26,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:02:26,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:02:26,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:02:26,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:02:26,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:02:26,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:02:26,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:02:26,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:02:26,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:02:26,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:02:26,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:02:26,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:02:26,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:02:26,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:02:26,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:02:26,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:02:26,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:02:26,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:02:26,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:02:26,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:02:26,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:02:26,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:02:26,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:02:26,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:02:26,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:02:26,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:02:26,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:02:26,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:02:26,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:02:26,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:02:26,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:02:26,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:02:26,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:02:26,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:02:26,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:02:26,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:02:26,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:02:26,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:02:26,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:02:26,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:02:26,897 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:02:26,921 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:02:26,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:02:26,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:02:26,922 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:02:26,923 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:02:26,923 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:02:26,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:02:26,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:02:26,924 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:02:26,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:02:26,925 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:02:26,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:02:26,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:02:26,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:02:26,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:02:26,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:02:26,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:02:26,926 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:02:26,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:02:26,926 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:02:26,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:02:26,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:02:26,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:02:26,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:02:26,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:02:26,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:02:26,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:02:26,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:02:26,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:02:26,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:02:26,929 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:02:26,929 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:02:26,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:02:26,929 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 [2022-02-20 17:02:27,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:02:27,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:02:27,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:02:27,138 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:02:27,139 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:02:27,140 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2022-02-20 17:02:27,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4770ca5c4/4ea743175c2d4b71813bdecfa7deb247/FLAG4a9e26e54 [2022-02-20 17:02:27,513 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:02:27,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2022-02-20 17:02:27,524 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4770ca5c4/4ea743175c2d4b71813bdecfa7deb247/FLAG4a9e26e54 [2022-02-20 17:02:27,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4770ca5c4/4ea743175c2d4b71813bdecfa7deb247 [2022-02-20 17:02:27,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:02:27,946 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:02:27,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:02:27,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:02:27,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:02:27,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:02:27" (1/1) ... [2022-02-20 17:02:27,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a92b143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:27, skipping insertion in model container [2022-02-20 17:02:27,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:02:27" (1/1) ... [2022-02-20 17:02:27,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:02:27,974 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:02:28,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2022-02-20 17:02:28,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2022-02-20 17:02:28,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2022-02-20 17:02:28,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2022-02-20 17:02:28,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2022-02-20 17:02:28,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2022-02-20 17:02:28,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2022-02-20 17:02:28,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2022-02-20 17:02:28,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2022-02-20 17:02:28,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2022-02-20 17:02:28,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2022-02-20 17:02:28,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2022-02-20 17:02:28,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2022-02-20 17:02:28,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2022-02-20 17:02:28,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2022-02-20 17:02:28,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2022-02-20 17:02:28,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:02:28,117 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:02:28,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2022-02-20 17:02:28,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2022-02-20 17:02:28,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2022-02-20 17:02:28,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2022-02-20 17:02:28,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2022-02-20 17:02:28,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2022-02-20 17:02:28,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2022-02-20 17:02:28,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2022-02-20 17:02:28,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2022-02-20 17:02:28,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2022-02-20 17:02:28,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2022-02-20 17:02:28,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2022-02-20 17:02:28,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2022-02-20 17:02:28,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2022-02-20 17:02:28,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2022-02-20 17:02:28,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2022-02-20 17:02:28,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:02:28,167 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:02:28,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:28 WrapperNode [2022-02-20 17:02:28,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:02:28,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:02:28,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:02:28,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:02:28,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:28" (1/1) ... [2022-02-20 17:02:28,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:28" (1/1) ... [2022-02-20 17:02:28,202 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 192 [2022-02-20 17:02:28,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:02:28,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:02:28,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:02:28,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:02:28,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:28" (1/1) ... [2022-02-20 17:02:28,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:28" (1/1) ... [2022-02-20 17:02:28,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:28" (1/1) ... [2022-02-20 17:02:28,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:28" (1/1) ... [2022-02-20 17:02:28,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:28" (1/1) ... [2022-02-20 17:02:28,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:28" (1/1) ... [2022-02-20 17:02:28,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:28" (1/1) ... [2022-02-20 17:02:28,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:02:28,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:02:28,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:02:28,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:02:28,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:28" (1/1) ... [2022-02-20 17:02:28,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:02:28,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:02:28,267 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-02-20 17:02:28,269 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-02-20 17:02:28,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:02:28,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:02:28,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:02:28,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:02:28,348 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:02:28,349 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:02:28,512 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:02:28,517 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:02:28,517 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 17:02:28,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:02:28 BoogieIcfgContainer [2022-02-20 17:02:28,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:02:28,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:02:28,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:02:28,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:02:28,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:02:27" (1/3) ... [2022-02-20 17:02:28,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9159295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:02:28, skipping insertion in model container [2022-02-20 17:02:28,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:28" (2/3) ... [2022-02-20 17:02:28,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9159295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:02:28, skipping insertion in model container [2022-02-20 17:02:28,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:02:28" (3/3) ... [2022-02-20 17:02:28,524 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2022-02-20 17:02:28,527 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:02:28,527 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-02-20 17:02:28,556 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:02:28,576 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:02:28,591 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-02-20 17:02:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 59 states have internal predecessors, (81), 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-02-20 17:02:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:02:28,619 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:28,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:28,620 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:28,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:28,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1241029004, now seen corresponding path program 1 times [2022-02-20 17:02:28,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:28,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822521039] [2022-02-20 17:02:28,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:28,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:28,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {63#true} is VALID [2022-02-20 17:02:28,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {63#true} is VALID [2022-02-20 17:02:28,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {63#true} is VALID [2022-02-20 17:02:28,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {63#true} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {63#true} is VALID [2022-02-20 17:02:28,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {63#true} assume main_~main__i~0#1 < main_~main__len~0#1; {63#true} is VALID [2022-02-20 17:02:28,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {63#true} assume main_~main__j~0#1 < main_~main__limit~0#1; {63#true} is VALID [2022-02-20 17:02:28,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {63#true} assume 1 + main_~main__i~0#1 < main_~main__len~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 1 + main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {65#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} is VALID [2022-02-20 17:02:28,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {65#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~0#1; {64#false} is VALID [2022-02-20 17:02:28,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {64#false} assume !false; {64#false} is VALID [2022-02-20 17:02:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:28,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:28,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822521039] [2022-02-20 17:02:28,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822521039] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:28,872 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:28,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:02:28,873 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930105396] [2022-02-20 17:02:28,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:28,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2022-02-20 17:02:28,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:28,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-02-20 17:02:28,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:28,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:02:28,893 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:28,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:02:28,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:02:28,914 INFO L87 Difference]: Start difference. First operand has 60 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 59 states have internal predecessors, (81), 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 has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-02-20 17:02:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:29,014 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2022-02-20 17:02:29,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:02:29,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2022-02-20 17:02:29,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-02-20 17:02:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 17:02:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-02-20 17:02:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 17:02:29,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-02-20 17:02:29,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:29,132 INFO L225 Difference]: With dead ends: 83 [2022-02-20 17:02:29,132 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 17:02:29,134 INFO L932 BasicCegarLoop]: 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-02-20 17:02:29,136 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 58 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:29,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 110 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 17:02:29,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2022-02-20 17:02:29,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:29,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 54 states have internal predecessors, (59), 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-02-20 17:02:29,181 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 54 states have internal predecessors, (59), 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-02-20 17:02:29,182 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 54 states have internal predecessors, (59), 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-02-20 17:02:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:29,186 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-02-20 17:02:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-02-20 17:02:29,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:29,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:29,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 54 states have internal predecessors, (59), 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 72 states. [2022-02-20 17:02:29,187 INFO L87 Difference]: Start difference. First operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 54 states have internal predecessors, (59), 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 72 states. [2022-02-20 17:02:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:29,190 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-02-20 17:02:29,191 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-02-20 17:02:29,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:29,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:29,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:29,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 54 states have internal predecessors, (59), 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-02-20 17:02:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-02-20 17:02:29,195 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 9 [2022-02-20 17:02:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:29,195 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-02-20 17:02:29,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-02-20 17:02:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-02-20 17:02:29,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:02:29,196 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:29,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:29,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:02:29,197 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:29,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:29,198 INFO L85 PathProgramCache]: Analyzing trace with hash -182802478, now seen corresponding path program 1 times [2022-02-20 17:02:29,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:29,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858218150] [2022-02-20 17:02:29,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:29,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:29,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {362#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {362#true} is VALID [2022-02-20 17:02:29,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {362#true} is VALID [2022-02-20 17:02:29,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {364#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} is VALID [2022-02-20 17:02:29,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {364#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {364#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} is VALID [2022-02-20 17:02:29,251 INFO L290 TraceCheckUtils]: 4: Hoare triple {364#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} assume main_~main__i~0#1 < main_~main__len~0#1; {364#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} is VALID [2022-02-20 17:02:29,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {364#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} assume main_~main__j~0#1 < main_~main__limit~0#1; {364#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} is VALID [2022-02-20 17:02:29,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {364#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} assume 1 + main_~main__i~0#1 < main_~main__len~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 1 + main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {364#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} is VALID [2022-02-20 17:02:29,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {364#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {365#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))} is VALID [2022-02-20 17:02:29,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~1#1; {363#false} is VALID [2022-02-20 17:02:29,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {363#false} assume !false; {363#false} is VALID [2022-02-20 17:02:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:29,265 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:29,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858218150] [2022-02-20 17:02:29,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858218150] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:29,265 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:29,266 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:02:29,266 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712912563] [2022-02-20 17:02:29,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:29,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2022-02-20 17:02:29,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:29,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-02-20 17:02:29,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:29,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:02:29,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:02:29,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:02:29,276 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-02-20 17:02:29,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:29,416 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-02-20 17:02:29,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:02:29,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2022-02-20 17:02:29,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-02-20 17:02:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-02-20 17:02:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-02-20 17:02:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-02-20 17:02:29,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 80 transitions. [2022-02-20 17:02:29,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:29,483 INFO L225 Difference]: With dead ends: 73 [2022-02-20 17:02:29,483 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 17:02:29,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-20 17:02:29,485 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 97 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:29,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 69 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 17:02:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2022-02-20 17:02:29,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:29,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 53 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 52 states have internal predecessors, (57), 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-02-20 17:02:29,497 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 53 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 52 states have internal predecessors, (57), 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-02-20 17:02:29,498 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 53 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 52 states have internal predecessors, (57), 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-02-20 17:02:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:29,506 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2022-02-20 17:02:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-02-20 17:02:29,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:29,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:29,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 52 states have internal predecessors, (57), 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 71 states. [2022-02-20 17:02:29,509 INFO L87 Difference]: Start difference. First operand has 53 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 52 states have internal predecessors, (57), 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 71 states. [2022-02-20 17:02:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:29,513 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2022-02-20 17:02:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-02-20 17:02:29,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:29,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:29,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:29,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 52 states have internal predecessors, (57), 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-02-20 17:02:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-02-20 17:02:29,518 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2022-02-20 17:02:29,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:29,518 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-02-20 17:02:29,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-02-20 17:02:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-02-20 17:02:29,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:02:29,519 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:29,519 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:29,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:02:29,521 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:29,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:29,522 INFO L85 PathProgramCache]: Analyzing trace with hash -179156060, now seen corresponding path program 1 times [2022-02-20 17:02:29,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:29,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060268431] [2022-02-20 17:02:29,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:29,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:29,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {647#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {647#true} is VALID [2022-02-20 17:02:29,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {647#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {647#true} is VALID [2022-02-20 17:02:29,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {647#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {647#true} is VALID [2022-02-20 17:02:29,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {647#true} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {649#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} is VALID [2022-02-20 17:02:29,582 INFO L290 TraceCheckUtils]: 4: Hoare triple {649#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} assume main_~main__i~0#1 < main_~main__len~0#1; {649#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} is VALID [2022-02-20 17:02:29,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} assume main_~main__j~0#1 < main_~main__limit~0#1; {649#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} is VALID [2022-02-20 17:02:29,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {649#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} assume !(1 + main_~main__i~0#1 < main_~main__len~0#1); {649#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} is VALID [2022-02-20 17:02:29,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {649#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {650#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))} is VALID [2022-02-20 17:02:29,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {650#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~2#1; {648#false} is VALID [2022-02-20 17:02:29,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {648#false} assume !false; {648#false} is VALID [2022-02-20 17:02:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:29,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:29,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060268431] [2022-02-20 17:02:29,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060268431] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:29,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:29,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:02:29,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406905393] [2022-02-20 17:02:29,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:29,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2022-02-20 17:02:29,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:29,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-02-20 17:02:29,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:29,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:02:29,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:29,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:02:29,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:02:29,595 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-02-20 17:02:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:29,767 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2022-02-20 17:02:29,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:02:29,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2022-02-20 17:02:29,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-02-20 17:02:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2022-02-20 17:02:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-02-20 17:02:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2022-02-20 17:02:29,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 158 transitions. [2022-02-20 17:02:29,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:29,908 INFO L225 Difference]: With dead ends: 143 [2022-02-20 17:02:29,908 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 17:02:29,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:29,909 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 76 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:29,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 148 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 17:02:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2022-02-20 17:02:29,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:29,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 52 states, 39 states have (on average 1.435897435897436) internal successors, (56), 51 states have internal predecessors, (56), 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-02-20 17:02:29,917 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 52 states, 39 states have (on average 1.435897435897436) internal successors, (56), 51 states have internal predecessors, (56), 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-02-20 17:02:29,917 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 52 states, 39 states have (on average 1.435897435897436) internal successors, (56), 51 states have internal predecessors, (56), 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-02-20 17:02:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:29,919 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-02-20 17:02:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-02-20 17:02:29,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:29,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:29,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 39 states have (on average 1.435897435897436) internal successors, (56), 51 states have internal predecessors, (56), 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 93 states. [2022-02-20 17:02:29,920 INFO L87 Difference]: Start difference. First operand has 52 states, 39 states have (on average 1.435897435897436) internal successors, (56), 51 states have internal predecessors, (56), 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 93 states. [2022-02-20 17:02:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:29,922 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-02-20 17:02:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-02-20 17:02:29,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:29,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:29,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:29,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.435897435897436) internal successors, (56), 51 states have internal predecessors, (56), 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-02-20 17:02:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-02-20 17:02:29,924 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2022-02-20 17:02:29,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:29,924 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-02-20 17:02:29,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-02-20 17:02:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-02-20 17:02:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 17:02:29,925 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:29,925 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:29,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:02:29,925 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:29,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:29,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1258866483, now seen corresponding path program 1 times [2022-02-20 17:02:29,926 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:29,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176302201] [2022-02-20 17:02:29,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:29,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:29,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {1053#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {1053#true} is VALID [2022-02-20 17:02:29,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {1053#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1053#true} is VALID [2022-02-20 17:02:29,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {1053#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {1055#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} is VALID [2022-02-20 17:02:29,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {1055#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {1055#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} is VALID [2022-02-20 17:02:29,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {1055#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} assume main_~main__i~0#1 < main_~main__len~0#1; {1055#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} is VALID [2022-02-20 17:02:29,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {1055#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} assume main_~main__j~0#1 < main_~main__limit~0#1; {1055#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} is VALID [2022-02-20 17:02:29,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {1055#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} assume !(1 + main_~main__i~0#1 < main_~main__len~0#1); {1055#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} is VALID [2022-02-20 17:02:29,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {1055#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {1055#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} is VALID [2022-02-20 17:02:29,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {1055#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {1056#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 0))} is VALID [2022-02-20 17:02:29,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {1056#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~3#1; {1054#false} is VALID [2022-02-20 17:02:29,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2022-02-20 17:02:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:29,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:29,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176302201] [2022-02-20 17:02:29,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176302201] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:29,968 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:29,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:02:29,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900319406] [2022-02-20 17:02:29,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:29,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 11 [2022-02-20 17:02:29,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:29,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-02-20 17:02:29,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:29,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:02:29,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:29,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:02:29,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:02:29,978 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-02-20 17:02:30,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:30,109 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-02-20 17:02:30,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:02:30,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 11 [2022-02-20 17:02:30,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-02-20 17:02:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-02-20 17:02:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-02-20 17:02:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-02-20 17:02:30,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 98 transitions. [2022-02-20 17:02:30,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:30,166 INFO L225 Difference]: With dead ends: 92 [2022-02-20 17:02:30,166 INFO L226 Difference]: Without dead ends: 90 [2022-02-20 17:02:30,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-20 17:02:30,170 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 89 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:30,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 101 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:30,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-02-20 17:02:30,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 50. [2022-02-20 17:02:30,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:30,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 50 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 49 states have internal predecessors, (54), 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-02-20 17:02:30,187 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 50 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 49 states have internal predecessors, (54), 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-02-20 17:02:30,187 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 50 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 49 states have internal predecessors, (54), 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-02-20 17:02:30,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:30,189 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-02-20 17:02:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-02-20 17:02:30,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:30,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:30,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 49 states have internal predecessors, (54), 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 90 states. [2022-02-20 17:02:30,190 INFO L87 Difference]: Start difference. First operand has 50 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 49 states have internal predecessors, (54), 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 90 states. [2022-02-20 17:02:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:30,191 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-02-20 17:02:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-02-20 17:02:30,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:30,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:30,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:30,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 49 states have internal predecessors, (54), 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-02-20 17:02:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-02-20 17:02:30,193 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2022-02-20 17:02:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:30,193 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-02-20 17:02:30,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-02-20 17:02:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-02-20 17:02:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:02:30,194 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:30,194 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:30,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:02:30,195 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:30,195 INFO L85 PathProgramCache]: Analyzing trace with hash 420636790, now seen corresponding path program 1 times [2022-02-20 17:02:30,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:30,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938160561] [2022-02-20 17:02:30,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:30,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:30,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {1395#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {1395#true} is VALID [2022-02-20 17:02:30,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {1395#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1395#true} is VALID [2022-02-20 17:02:30,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {1395#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {1395#true} is VALID [2022-02-20 17:02:30,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {1395#true} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {1397#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} is VALID [2022-02-20 17:02:30,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {1397#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} assume main_~main__i~0#1 < main_~main__len~0#1; {1397#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} is VALID [2022-02-20 17:02:30,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {1397#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} assume main_~main__j~0#1 < main_~main__limit~0#1; {1397#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} is VALID [2022-02-20 17:02:30,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {1397#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} assume 1 + main_~main__i~0#1 < main_~main__len~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 1 + main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {1397#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} is VALID [2022-02-20 17:02:30,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {1397#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {1397#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} is VALID [2022-02-20 17:02:30,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {1397#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1397#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} is VALID [2022-02-20 17:02:30,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {1397#(not (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|))} assume !!(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {1398#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))} is VALID [2022-02-20 17:02:30,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {1398#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~6#1; {1396#false} is VALID [2022-02-20 17:02:30,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {1396#false} assume !false; {1396#false} is VALID [2022-02-20 17:02:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:30,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:30,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938160561] [2022-02-20 17:02:30,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938160561] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:30,240 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:30,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:02:30,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110705566] [2022-02-20 17:02:30,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:30,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2022-02-20 17:02:30,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:30,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-02-20 17:02:30,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:30,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:02:30,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:30,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:02:30,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:02:30,258 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-02-20 17:02:30,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:30,357 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-02-20 17:02:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:02:30,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2022-02-20 17:02:30,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-02-20 17:02:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-02-20 17:02:30,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-02-20 17:02:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-02-20 17:02:30,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-02-20 17:02:30,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:30,409 INFO L225 Difference]: With dead ends: 69 [2022-02-20 17:02:30,410 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 17:02:30,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:30,410 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 66 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:30,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 85 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:30,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 17:02:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2022-02-20 17:02:30,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:30,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 48 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 47 states have internal predecessors, (52), 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-02-20 17:02:30,418 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 48 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 47 states have internal predecessors, (52), 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-02-20 17:02:30,418 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 48 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 47 states have internal predecessors, (52), 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-02-20 17:02:30,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:30,419 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-02-20 17:02:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-02-20 17:02:30,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:30,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:30,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 47 states have internal predecessors, (52), 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 67 states. [2022-02-20 17:02:30,420 INFO L87 Difference]: Start difference. First operand has 48 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 47 states have internal predecessors, (52), 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 67 states. [2022-02-20 17:02:30,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:30,421 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-02-20 17:02:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-02-20 17:02:30,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:30,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:30,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:30,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 47 states have internal predecessors, (52), 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-02-20 17:02:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-02-20 17:02:30,423 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2022-02-20 17:02:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:30,423 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-02-20 17:02:30,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-02-20 17:02:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-02-20 17:02:30,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:02:30,424 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:30,424 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:30,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 17:02:30,424 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:30,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:30,425 INFO L85 PathProgramCache]: Analyzing trace with hash -370151221, now seen corresponding path program 1 times [2022-02-20 17:02:30,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:30,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169108061] [2022-02-20 17:02:30,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:30,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:30,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {1668#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {1668#true} is VALID [2022-02-20 17:02:30,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {1668#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1668#true} is VALID [2022-02-20 17:02:30,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {1668#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {1670#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:30,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {1670#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {1670#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:30,464 INFO L290 TraceCheckUtils]: 4: Hoare triple {1670#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume main_~main__i~0#1 < main_~main__len~0#1; {1670#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:30,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {1670#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume main_~main__j~0#1 < main_~main__limit~0#1; {1671#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:30,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {1671#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(1 + main_~main__i~0#1 < main_~main__len~0#1); {1671#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:30,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {1671#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {1671#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:30,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {1671#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {1671#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:30,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {1671#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~3#1);havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {1672#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1| 0))} is VALID [2022-02-20 17:02:30,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {1672#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~4#1; {1669#false} is VALID [2022-02-20 17:02:30,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {1669#false} assume !false; {1669#false} is VALID [2022-02-20 17:02:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:30,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:30,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169108061] [2022-02-20 17:02:30,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169108061] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:30,468 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:30,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:30,468 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367117418] [2022-02-20 17:02:30,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:30,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2022-02-20 17:02:30,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:30,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-20 17:02:30,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:30,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:30,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:30,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:30,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:30,477 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-20 17:02:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:30,650 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-02-20 17:02:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:02:30,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2022-02-20 17:02:30,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-20 17:02:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-02-20 17:02:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-20 17:02:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-02-20 17:02:30,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 93 transitions. [2022-02-20 17:02:30,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:30,728 INFO L225 Difference]: With dead ends: 87 [2022-02-20 17:02:30,728 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 17:02:30,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:02:30,729 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 104 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:30,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 139 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:30,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 17:02:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2022-02-20 17:02:30,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:30,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 46 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 45 states have internal predecessors, (50), 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-02-20 17:02:30,740 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 46 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 45 states have internal predecessors, (50), 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-02-20 17:02:30,740 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 46 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 45 states have internal predecessors, (50), 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-02-20 17:02:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:30,741 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-02-20 17:02:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-02-20 17:02:30,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:30,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:30,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 45 states have internal predecessors, (50), 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 85 states. [2022-02-20 17:02:30,742 INFO L87 Difference]: Start difference. First operand has 46 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 45 states have internal predecessors, (50), 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 85 states. [2022-02-20 17:02:30,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:30,743 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-02-20 17:02:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-02-20 17:02:30,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:30,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:30,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:30,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 45 states have internal predecessors, (50), 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-02-20 17:02:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-02-20 17:02:30,745 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 12 [2022-02-20 17:02:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:30,745 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-02-20 17:02:30,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-20 17:02:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-02-20 17:02:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:02:30,745 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:30,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:30,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 17:02:30,746 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:30,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:30,746 INFO L85 PathProgramCache]: Analyzing trace with hash 154842714, now seen corresponding path program 1 times [2022-02-20 17:02:30,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:30,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750921016] [2022-02-20 17:02:30,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:30,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:30,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {1996#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {1996#true} is VALID [2022-02-20 17:02:30,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {1996#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1996#true} is VALID [2022-02-20 17:02:30,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {1996#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {1996#true} is VALID [2022-02-20 17:02:30,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {1996#true} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {1996#true} is VALID [2022-02-20 17:02:30,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {1996#true} assume main_~main__i~0#1 < main_~main__len~0#1; {1996#true} is VALID [2022-02-20 17:02:30,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {1996#true} assume main_~main__j~0#1 < main_~main__limit~0#1; {1996#true} is VALID [2022-02-20 17:02:30,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {1996#true} assume 1 + main_~main__i~0#1 < main_~main__len~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 1 + main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {1996#true} is VALID [2022-02-20 17:02:30,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {1996#true} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {1998#(or (and (not (<= 0 |ULTIMATE.start_main_~main__i~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0)) (and (<= 0 |ULTIMATE.start_main_~main__i~0#1|) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 1)))} is VALID [2022-02-20 17:02:30,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {1998#(or (and (not (<= 0 |ULTIMATE.start_main_~main__i~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0)) (and (<= 0 |ULTIMATE.start_main_~main__i~0#1|) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 1)))} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1999#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} is VALID [2022-02-20 17:02:30,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {1999#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {1999#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} is VALID [2022-02-20 17:02:30,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {1999#(<= 0 |ULTIMATE.start_main_~main__i~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {2000#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0))} is VALID [2022-02-20 17:02:30,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {2000#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~7#1; {1997#false} is VALID [2022-02-20 17:02:30,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {1997#false} assume !false; {1997#false} is VALID [2022-02-20 17:02:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:30,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:30,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750921016] [2022-02-20 17:02:30,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750921016] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:30,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:30,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:30,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465879500] [2022-02-20 17:02:30,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:30,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) Word has length 13 [2022-02-20 17:02:30,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:30,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-02-20 17:02:30,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:30,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:30,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:30,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:30,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:30,817 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-02-20 17:02:31,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:31,008 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2022-02-20 17:02:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:02:31,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) Word has length 13 [2022-02-20 17:02:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-02-20 17:02:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-02-20 17:02:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-02-20 17:02:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-02-20 17:02:31,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 83 transitions. [2022-02-20 17:02:31,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:31,068 INFO L225 Difference]: With dead ends: 75 [2022-02-20 17:02:31,068 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 17:02:31,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:02:31,068 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 118 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:31,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 67 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:31,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 17:02:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2022-02-20 17:02:31,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:31,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 44 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 43 states have internal predecessors, (48), 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-02-20 17:02:31,079 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 44 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 43 states have internal predecessors, (48), 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-02-20 17:02:31,079 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 44 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 43 states have internal predecessors, (48), 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-02-20 17:02:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:31,080 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-02-20 17:02:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-02-20 17:02:31,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:31,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:31,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 43 states have internal predecessors, (48), 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 73 states. [2022-02-20 17:02:31,081 INFO L87 Difference]: Start difference. First operand has 44 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 43 states have internal predecessors, (48), 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 73 states. [2022-02-20 17:02:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:31,082 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-02-20 17:02:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-02-20 17:02:31,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:31,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:31,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:31,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 43 states have internal predecessors, (48), 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-02-20 17:02:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-02-20 17:02:31,084 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 13 [2022-02-20 17:02:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:31,084 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-02-20 17:02:31,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-02-20 17:02:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-02-20 17:02:31,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:02:31,085 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:31,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:31,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 17:02:31,085 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:31,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:31,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1410218132, now seen corresponding path program 1 times [2022-02-20 17:02:31,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:31,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413413991] [2022-02-20 17:02:31,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:31,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:31,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {2290#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {2290#true} is VALID [2022-02-20 17:02:31,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {2290#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2290#true} is VALID [2022-02-20 17:02:31,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {2290#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {2290#true} is VALID [2022-02-20 17:02:31,117 INFO L290 TraceCheckUtils]: 3: Hoare triple {2290#true} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {2292#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,117 INFO L290 TraceCheckUtils]: 4: Hoare triple {2292#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} assume main_~main__i~0#1 < main_~main__len~0#1; {2292#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {2292#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} assume main_~main__j~0#1 < main_~main__limit~0#1; {2292#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {2292#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} assume !(1 + main_~main__i~0#1 < main_~main__len~0#1); {2292#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {2292#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {2292#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {2292#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {2292#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {2292#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~3#1);havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {2292#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {2292#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__j~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {2293#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))} is VALID [2022-02-20 17:02:31,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {2293#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~5#1; {2291#false} is VALID [2022-02-20 17:02:31,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {2291#false} assume !false; {2291#false} is VALID [2022-02-20 17:02:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:31,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:31,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413413991] [2022-02-20 17:02:31,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413413991] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:31,120 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:31,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:02:31,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663593754] [2022-02-20 17:02:31,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:31,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Word has length 13 [2022-02-20 17:02:31,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:31,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 17:02:31,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:31,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:02:31,129 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:31,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:02:31,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:02:31,130 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 17:02:31,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:31,248 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-02-20 17:02:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:02:31,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Word has length 13 [2022-02-20 17:02:31,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 17:02:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-02-20 17:02:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 17:02:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-02-20 17:02:31,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 89 transitions. [2022-02-20 17:02:31,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:31,316 INFO L225 Difference]: With dead ends: 83 [2022-02-20 17:02:31,316 INFO L226 Difference]: Without dead ends: 81 [2022-02-20 17:02:31,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-20 17:02:31,317 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 69 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:31,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 95 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-02-20 17:02:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 42. [2022-02-20 17:02:31,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:31,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 42 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 41 states have internal predecessors, (46), 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-02-20 17:02:31,349 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 42 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 41 states have internal predecessors, (46), 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-02-20 17:02:31,349 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 42 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 41 states have internal predecessors, (46), 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-02-20 17:02:31,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:31,350 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-02-20 17:02:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-02-20 17:02:31,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:31,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:31,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 41 states have internal predecessors, (46), 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 81 states. [2022-02-20 17:02:31,351 INFO L87 Difference]: Start difference. First operand has 42 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 41 states have internal predecessors, (46), 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 81 states. [2022-02-20 17:02:31,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:31,352 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-02-20 17:02:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-02-20 17:02:31,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:31,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:31,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:31,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 41 states have internal predecessors, (46), 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-02-20 17:02:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-02-20 17:02:31,365 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2022-02-20 17:02:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:31,365 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-02-20 17:02:31,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 17:02:31,366 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 17:02:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:02:31,366 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:31,366 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:31,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 17:02:31,366 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:31,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash 505160957, now seen corresponding path program 1 times [2022-02-20 17:02:31,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:31,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161984791] [2022-02-20 17:02:31,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:31,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {2598#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {2598#true} is VALID [2022-02-20 17:02:31,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {2598#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2598#true} is VALID [2022-02-20 17:02:31,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {2598#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {2600#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:31,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {2600#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {2600#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:31,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {2600#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume main_~main__i~0#1 < main_~main__len~0#1; {2600#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:31,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {2600#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume main_~main__j~0#1 < main_~main__limit~0#1; {2601#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:31,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {2601#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume 1 + main_~main__i~0#1 < main_~main__len~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 1 + main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {2601#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:31,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {2601#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {2601#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:31,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {2601#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2601#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:31,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {2601#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {2601#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:31,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {2601#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {2601#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:31,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {2601#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~7#1);havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {2602#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))} is VALID [2022-02-20 17:02:31,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {2602#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~8#1; {2599#false} is VALID [2022-02-20 17:02:31,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {2599#false} assume !false; {2599#false} is VALID [2022-02-20 17:02:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:31,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:31,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161984791] [2022-02-20 17:02:31,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161984791] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:31,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:31,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:31,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11759655] [2022-02-20 17:02:31,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:31,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) Word has length 14 [2022-02-20 17:02:31,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:31,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-02-20 17:02:31,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:31,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:31,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:31,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:31,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:31,417 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-02-20 17:02:31,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:31,535 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-02-20 17:02:31,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:02:31,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) Word has length 14 [2022-02-20 17:02:31,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-02-20 17:02:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-02-20 17:02:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-02-20 17:02:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-02-20 17:02:31,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2022-02-20 17:02:31,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:31,579 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:02:31,579 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 17:02:31,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:02:31,580 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 83 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:31,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 78 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:31,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 17:02:31,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-02-20 17:02:31,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:31,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 40 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 39 states have internal predecessors, (44), 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-02-20 17:02:31,602 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 40 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 39 states have internal predecessors, (44), 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-02-20 17:02:31,602 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 40 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 39 states have internal predecessors, (44), 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-02-20 17:02:31,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:31,603 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-02-20 17:02:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-02-20 17:02:31,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:31,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:31,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 39 states have internal predecessors, (44), 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 55 states. [2022-02-20 17:02:31,604 INFO L87 Difference]: Start difference. First operand has 40 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 39 states have internal predecessors, (44), 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 55 states. [2022-02-20 17:02:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:31,605 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-02-20 17:02:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-02-20 17:02:31,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:31,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:31,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:31,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 39 states have internal predecessors, (44), 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-02-20 17:02:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-02-20 17:02:31,607 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2022-02-20 17:02:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:31,607 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-02-20 17:02:31,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-02-20 17:02:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-02-20 17:02:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:02:31,608 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:31,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:31,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 17:02:31,608 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:31,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:31,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1519875391, now seen corresponding path program 1 times [2022-02-20 17:02:31,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:31,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455386243] [2022-02-20 17:02:31,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:31,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:31,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {2830#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {2830#true} is VALID [2022-02-20 17:02:31,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {2830#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2830#true} is VALID [2022-02-20 17:02:31,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {2830#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {2830#true} is VALID [2022-02-20 17:02:31,668 INFO L290 TraceCheckUtils]: 3: Hoare triple {2830#true} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,669 INFO L290 TraceCheckUtils]: 4: Hoare triple {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} assume main_~main__i~0#1 < main_~main__len~0#1; {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} assume main_~main__j~0#1 < main_~main__limit~0#1; {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} assume 1 + main_~main__i~0#1 < main_~main__len~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 1 + main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~7#1);havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:31,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {2832#(<= 0 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__j~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {2833#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 0))} is VALID [2022-02-20 17:02:31,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {2833#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~9#1; {2831#false} is VALID [2022-02-20 17:02:31,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {2831#false} assume !false; {2831#false} is VALID [2022-02-20 17:02:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:31,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:31,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455386243] [2022-02-20 17:02:31,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455386243] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:31,674 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:31,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:02:31,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977720301] [2022-02-20 17:02:31,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:31,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 15 [2022-02-20 17:02:31,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:31,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-02-20 17:02:31,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:31,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:02:31,684 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:02:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:02:31,684 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-02-20 17:02:31,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:31,777 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-02-20 17:02:31,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:02:31,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 15 [2022-02-20 17:02:31,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-02-20 17:02:31,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-02-20 17:02:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-02-20 17:02:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-02-20 17:02:31,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2022-02-20 17:02:31,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:31,823 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:02:31,823 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 17:02:31,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-20 17:02:31,824 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 58 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:31,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 58 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:31,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 17:02:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2022-02-20 17:02:31,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:31,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 38 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 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-02-20 17:02:31,835 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 38 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 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-02-20 17:02:31,836 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 38 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 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-02-20 17:02:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:31,837 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-02-20 17:02:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-02-20 17:02:31,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:31,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:31,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 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 55 states. [2022-02-20 17:02:31,837 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 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 55 states. [2022-02-20 17:02:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:31,838 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-02-20 17:02:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-02-20 17:02:31,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:31,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:31,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:31,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 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-02-20 17:02:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-02-20 17:02:31,839 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2022-02-20 17:02:31,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:31,839 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-02-20 17:02:31,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-02-20 17:02:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-02-20 17:02:31,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:02:31,840 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:31,840 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:31,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 17:02:31,840 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:31,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:31,841 INFO L85 PathProgramCache]: Analyzing trace with hash 128507268, now seen corresponding path program 1 times [2022-02-20 17:02:31,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:31,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667081138] [2022-02-20 17:02:31,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:31,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:31,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {3056#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {3056#true} is VALID [2022-02-20 17:02:31,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {3056#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3056#true} is VALID [2022-02-20 17:02:31,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {3056#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {3056#true} is VALID [2022-02-20 17:02:31,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {3056#true} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {3056#true} is VALID [2022-02-20 17:02:31,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {3056#true} assume main_~main__i~0#1 < main_~main__len~0#1; {3056#true} is VALID [2022-02-20 17:02:31,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {3056#true} assume main_~main__j~0#1 < main_~main__limit~0#1; {3056#true} is VALID [2022-02-20 17:02:31,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {3056#true} assume 1 + main_~main__i~0#1 < main_~main__len~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 1 + main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {3058#(<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)} is VALID [2022-02-20 17:02:31,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {3058#(<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {3058#(<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)} is VALID [2022-02-20 17:02:31,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {3058#(<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3058#(<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)} is VALID [2022-02-20 17:02:31,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {3058#(<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {3058#(<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)} is VALID [2022-02-20 17:02:31,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {3058#(<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {3058#(<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)} is VALID [2022-02-20 17:02:31,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {3058#(<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~7#1);havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {3058#(<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)} is VALID [2022-02-20 17:02:31,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {3058#(<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__j~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {3058#(<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)} is VALID [2022-02-20 17:02:31,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {3058#(<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~9#1);main_~main____CPAchecker_TMP_1~0#1 := main_~main__j~0#1;main_~main__j~0#1 := 1 + main_~main__j~0#1;main_~main____CPAchecker_TMP_2~0#1 := main_~main__i~0#1;main_~main__i~0#1 := 1 + main_~main__i~0#1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {3059#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))} is VALID [2022-02-20 17:02:31,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {3059#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~10#1; {3057#false} is VALID [2022-02-20 17:02:31,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {3057#false} assume !false; {3057#false} is VALID [2022-02-20 17:02:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:31,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:31,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667081138] [2022-02-20 17:02:31,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667081138] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:31,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:31,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:02:31,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221303998] [2022-02-20 17:02:31,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:31,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 16 [2022-02-20 17:02:31,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:31,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-02-20 17:02:31,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:31,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:02:31,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:31,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:02:31,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:02:31,914 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-02-20 17:02:32,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:32,027 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-02-20 17:02:32,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:02:32,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 16 [2022-02-20 17:02:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-02-20 17:02:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-02-20 17:02:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-02-20 17:02:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-02-20 17:02:32,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-02-20 17:02:32,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:32,070 INFO L225 Difference]: With dead ends: 65 [2022-02-20 17:02:32,070 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 17:02:32,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-20 17:02:32,071 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 40 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:32,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 97 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:32,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 17:02:32,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2022-02-20 17:02:32,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:32,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 35 states have internal predecessors, (40), 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-02-20 17:02:32,080 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 35 states have internal predecessors, (40), 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-02-20 17:02:32,080 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 35 states have internal predecessors, (40), 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-02-20 17:02:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:32,081 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-02-20 17:02:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2022-02-20 17:02:32,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:32,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:32,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 35 states have internal predecessors, (40), 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 63 states. [2022-02-20 17:02:32,082 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 35 states have internal predecessors, (40), 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 63 states. [2022-02-20 17:02:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:32,082 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-02-20 17:02:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2022-02-20 17:02:32,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:32,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:32,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:32,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 35 states have internal predecessors, (40), 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-02-20 17:02:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-02-20 17:02:32,083 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2022-02-20 17:02:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:32,084 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-02-20 17:02:32,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-02-20 17:02:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-02-20 17:02:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 17:02:32,084 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:32,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:32,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 17:02:32,084 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:32,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:32,084 INFO L85 PathProgramCache]: Analyzing trace with hash -311237848, now seen corresponding path program 1 times [2022-02-20 17:02:32,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:32,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136176858] [2022-02-20 17:02:32,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:32,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:32,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {3305#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {3305#true} is VALID [2022-02-20 17:02:32,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {3305#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3305#true} is VALID [2022-02-20 17:02:32,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {3305#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 17:02:32,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 17:02:32,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} assume main_~main__i~0#1 < main_~main__len~0#1; {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 17:02:32,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} assume main_~main__j~0#1 < main_~main__limit~0#1; {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 17:02:32,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} assume 1 + main_~main__i~0#1 < main_~main__len~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 1 + main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 17:02:32,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 17:02:32,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 17:02:32,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} assume !!(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 17:02:32,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 17:02:32,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~7#1);havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 17:02:32,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__j~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 17:02:32,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {3307#(= |ULTIMATE.start_main_~main__i~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~9#1);main_~main____CPAchecker_TMP_1~0#1 := main_~main__j~0#1;main_~main__j~0#1 := 1 + main_~main__j~0#1;main_~main____CPAchecker_TMP_2~0#1 := main_~main__i~0#1;main_~main__i~0#1 := 1 + main_~main__i~0#1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {3308#(<= 1 |ULTIMATE.start_main_~main__i~0#1|)} is VALID [2022-02-20 17:02:32,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {3308#(<= 1 |ULTIMATE.start_main_~main__i~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~10#1);havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~11#1;main_~__VERIFIER_assert__cond~11#1 := main_~__tmp_12~0#1; {3309#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0))} is VALID [2022-02-20 17:02:32,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {3309#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~11#1; {3306#false} is VALID [2022-02-20 17:02:32,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {3306#false} assume !false; {3306#false} is VALID [2022-02-20 17:02:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:32,133 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:32,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136176858] [2022-02-20 17:02:32,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136176858] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:32,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:32,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:32,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922600334] [2022-02-20 17:02:32,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:32,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) Word has length 17 [2022-02-20 17:02:32,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:32,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-02-20 17:02:32,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:32,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:32,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:32,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:32,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:32,145 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-02-20 17:02:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:32,350 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-02-20 17:02:32,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:02:32,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) Word has length 17 [2022-02-20 17:02:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-02-20 17:02:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-02-20 17:02:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-02-20 17:02:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-02-20 17:02:32,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2022-02-20 17:02:32,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:32,403 INFO L225 Difference]: With dead ends: 70 [2022-02-20 17:02:32,403 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 17:02:32,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:02:32,404 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 68 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:32,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 93 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:02:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 17:02:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 34. [2022-02-20 17:02:32,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:32,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 34 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 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-02-20 17:02:32,418 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 34 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 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-02-20 17:02:32,418 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 34 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 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-02-20 17:02:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:32,419 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-02-20 17:02:32,419 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-02-20 17:02:32,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:32,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:32,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 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 68 states. [2022-02-20 17:02:32,419 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 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 68 states. [2022-02-20 17:02:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:32,420 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-02-20 17:02:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-02-20 17:02:32,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:32,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:32,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:32,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 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-02-20 17:02:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-02-20 17:02:32,421 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2022-02-20 17:02:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:32,422 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-02-20 17:02:32,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-02-20 17:02:32,422 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-02-20 17:02:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:02:32,422 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:32,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:32,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 17:02:32,422 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:32,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1058434549, now seen corresponding path program 1 times [2022-02-20 17:02:32,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:32,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916386854] [2022-02-20 17:02:32,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:32,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:32,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {3569#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {3569#true} is VALID [2022-02-20 17:02:32,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {3569#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3569#true} is VALID [2022-02-20 17:02:32,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {3569#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {3571#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:32,462 INFO L290 TraceCheckUtils]: 3: Hoare triple {3571#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {3571#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:32,463 INFO L290 TraceCheckUtils]: 4: Hoare triple {3571#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume main_~main__i~0#1 < main_~main__len~0#1; {3571#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:32,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {3571#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume main_~main__j~0#1 < main_~main__limit~0#1; {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:32,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume 1 + main_~main__i~0#1 < main_~main__len~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 1 + main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:32,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:32,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:32,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:32,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:32,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~7#1);havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:32,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__j~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:32,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {3572#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~9#1);main_~main____CPAchecker_TMP_1~0#1 := main_~main__j~0#1;main_~main__j~0#1 := 1 + main_~main__j~0#1;main_~main____CPAchecker_TMP_2~0#1 := main_~main__i~0#1;main_~main__i~0#1 := 1 + main_~main__i~0#1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {3573#(<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:32,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {3573#(<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~10#1);havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~11#1;main_~__VERIFIER_assert__cond~11#1 := main_~__tmp_12~0#1; {3573#(<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:32,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {3573#(<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~11#1);havoc main_~__tmp_13~0#1;main_~__tmp_13~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~12#1;main_~__VERIFIER_assert__cond~12#1 := main_~__tmp_13~0#1; {3574#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0))} is VALID [2022-02-20 17:02:32,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {3574#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~12#1; {3570#false} is VALID [2022-02-20 17:02:32,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {3570#false} assume !false; {3570#false} is VALID [2022-02-20 17:02:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:32,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:32,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916386854] [2022-02-20 17:02:32,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916386854] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:32,468 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:32,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:02:32,468 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152205904] [2022-02-20 17:02:32,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:32,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) Word has length 18 [2022-02-20 17:02:32,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:32,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-02-20 17:02:32,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:32,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:02:32,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:32,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:02:32,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:02:32,480 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-02-20 17:02:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:32,667 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-02-20 17:02:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:02:32,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) Word has length 18 [2022-02-20 17:02:32,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-02-20 17:02:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-02-20 17:02:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-02-20 17:02:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-02-20 17:02:32,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2022-02-20 17:02:32,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:32,717 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:02:32,717 INFO L226 Difference]: Without dead ends: 56 [2022-02-20 17:02:32,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:02:32,717 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 82 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:32,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 76 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-20 17:02:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2022-02-20 17:02:32,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:32,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 32 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 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-02-20 17:02:32,731 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 32 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 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-02-20 17:02:32,732 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 32 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 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-02-20 17:02:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:32,732 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-02-20 17:02:32,732 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-02-20 17:02:32,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:32,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:32,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 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 56 states. [2022-02-20 17:02:32,733 INFO L87 Difference]: Start difference. First operand has 32 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 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 56 states. [2022-02-20 17:02:32,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:32,734 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-02-20 17:02:32,734 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-02-20 17:02:32,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:32,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:32,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:32,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 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-02-20 17:02:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-02-20 17:02:32,735 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2022-02-20 17:02:32,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:32,735 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-02-20 17:02:32,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-02-20 17:02:32,735 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-20 17:02:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:02:32,736 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:32,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:32,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 17:02:32,736 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:32,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1548271503, now seen corresponding path program 1 times [2022-02-20 17:02:32,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:32,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201695685] [2022-02-20 17:02:32,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:32,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:32,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {3804#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {3804#true} is VALID [2022-02-20 17:02:32,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {3804#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3804#true} is VALID [2022-02-20 17:02:32,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {3804#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {3804#true} is VALID [2022-02-20 17:02:32,771 INFO L290 TraceCheckUtils]: 3: Hoare triple {3804#true} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:32,771 INFO L290 TraceCheckUtils]: 4: Hoare triple {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume main_~main__i~0#1 < main_~main__len~0#1; {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:32,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume main_~main__j~0#1 < main_~main__limit~0#1; {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:32,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume 1 + main_~main__i~0#1 < main_~main__len~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 1 + main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:32,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:32,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:32,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume !!(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:32,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:32,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~7#1);havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:32,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__j~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:32,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {3806#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~9#1);main_~main____CPAchecker_TMP_1~0#1 := main_~main__j~0#1;main_~main__j~0#1 := 1 + main_~main__j~0#1;main_~main____CPAchecker_TMP_2~0#1 := main_~main__i~0#1;main_~main__i~0#1 := 1 + main_~main__i~0#1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {3807#(<= 1 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:32,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {3807#(<= 1 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~10#1);havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~11#1;main_~__VERIFIER_assert__cond~11#1 := main_~__tmp_12~0#1; {3807#(<= 1 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:32,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {3807#(<= 1 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~11#1);havoc main_~__tmp_13~0#1;main_~__tmp_13~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~12#1;main_~__VERIFIER_assert__cond~12#1 := main_~__tmp_13~0#1; {3807#(<= 1 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:32,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {3807#(<= 1 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~12#1);havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 <= main_~main__j~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~13#1;main_~__VERIFIER_assert__cond~13#1 := main_~__tmp_14~0#1; {3808#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0))} is VALID [2022-02-20 17:02:32,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {3808#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~13#1; {3805#false} is VALID [2022-02-20 17:02:32,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {3805#false} assume !false; {3805#false} is VALID [2022-02-20 17:02:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:32,779 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:32,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201695685] [2022-02-20 17:02:32,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201695685] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:32,779 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:32,779 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:32,779 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354308010] [2022-02-20 17:02:32,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:32,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) Word has length 19 [2022-02-20 17:02:32,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:32,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-02-20 17:02:32,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:32,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:32,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:32,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:32,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:32,795 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-02-20 17:02:33,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,048 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-02-20 17:02:33,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:02:33,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) Word has length 19 [2022-02-20 17:02:33,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-02-20 17:02:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2022-02-20 17:02:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-02-20 17:02:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2022-02-20 17:02:33,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 97 transitions. [2022-02-20 17:02:33,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:33,115 INFO L225 Difference]: With dead ends: 83 [2022-02-20 17:02:33,115 INFO L226 Difference]: Without dead ends: 81 [2022-02-20 17:02:33,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:02:33,116 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 72 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:33,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 135 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:02:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-02-20 17:02:33,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 30. [2022-02-20 17:02:33,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:33,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 30 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 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-02-20 17:02:33,132 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 30 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 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-02-20 17:02:33,132 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 30 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 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-02-20 17:02:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,133 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-02-20 17:02:33,133 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-02-20 17:02:33,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:33,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:33,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 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 81 states. [2022-02-20 17:02:33,134 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 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 81 states. [2022-02-20 17:02:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,135 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-02-20 17:02:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-02-20 17:02:33,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:33,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:33,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:33,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 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-02-20 17:02:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-02-20 17:02:33,136 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2022-02-20 17:02:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:33,136 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-02-20 17:02:33,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-02-20 17:02:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-02-20 17:02:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:02:33,136 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:33,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:33,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 17:02:33,137 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:33,137 INFO L85 PathProgramCache]: Analyzing trace with hash 751780498, now seen corresponding path program 1 times [2022-02-20 17:02:33,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:33,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094999027] [2022-02-20 17:02:33,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:33,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:33,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {4107#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {4107#true} is VALID [2022-02-20 17:02:33,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {4107#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {4107#true} is VALID [2022-02-20 17:02:33,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {4107#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {4109#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:33,183 INFO L290 TraceCheckUtils]: 3: Hoare triple {4109#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {4109#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:33,184 INFO L290 TraceCheckUtils]: 4: Hoare triple {4109#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume main_~main__i~0#1 < main_~main__len~0#1; {4109#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:33,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {4109#(<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume main_~main__j~0#1 < main_~main__limit~0#1; {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:33,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume 1 + main_~main__i~0#1 < main_~main__len~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 1 + main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:33,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:33,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:33,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:33,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:33,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~7#1);havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:33,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__j~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:33,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {4110#(<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~9#1);main_~main____CPAchecker_TMP_1~0#1 := main_~main__j~0#1;main_~main__j~0#1 := 1 + main_~main__j~0#1;main_~main____CPAchecker_TMP_2~0#1 := main_~main__i~0#1;main_~main__i~0#1 := 1 + main_~main__i~0#1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {4111#(<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:33,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {4111#(<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~10#1);havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~11#1;main_~__VERIFIER_assert__cond~11#1 := main_~__tmp_12~0#1; {4111#(<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:33,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {4111#(<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~11#1);havoc main_~__tmp_13~0#1;main_~__tmp_13~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~12#1;main_~__VERIFIER_assert__cond~12#1 := main_~__tmp_13~0#1; {4111#(<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:33,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {4111#(<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~12#1);havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 <= main_~main__j~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~13#1;main_~__VERIFIER_assert__cond~13#1 := main_~__tmp_14~0#1; {4111#(<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} is VALID [2022-02-20 17:02:33,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {4111#(<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~13#1);main_~main____CPAchecker_TMP_3~0#1 := main_~main__j~0#1;main_~main__j~0#1 := 1 + main_~main__j~0#1;main_~main____CPAchecker_TMP_4~0#1 := main_~main__i~0#1;main_~main__i~0#1 := 1 + main_~main__i~0#1;havoc main_~__tmp_15~0#1;main_~__tmp_15~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~14#1;main_~__VERIFIER_assert__cond~14#1 := main_~__tmp_15~0#1; {4112#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~14#1| 0))} is VALID [2022-02-20 17:02:33,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {4112#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~14#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~14#1; {4108#false} is VALID [2022-02-20 17:02:33,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {4108#false} assume !false; {4108#false} is VALID [2022-02-20 17:02:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:33,193 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:33,193 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094999027] [2022-02-20 17:02:33,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094999027] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:33,193 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:33,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:02:33,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596876471] [2022-02-20 17:02:33,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:33,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) Word has length 20 [2022-02-20 17:02:33,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:33,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-02-20 17:02:33,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:33,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:02:33,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:33,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:02:33,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:02:33,209 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-02-20 17:02:33,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,440 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-02-20 17:02:33,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:02:33,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) Word has length 20 [2022-02-20 17:02:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-02-20 17:02:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-02-20 17:02:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-02-20 17:02:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-02-20 17:02:33,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2022-02-20 17:02:33,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:33,486 INFO L225 Difference]: With dead ends: 56 [2022-02-20 17:02:33,487 INFO L226 Difference]: Without dead ends: 54 [2022-02-20 17:02:33,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:02:33,487 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 65 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:33,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 73 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:02:33,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-20 17:02:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 28. [2022-02-20 17:02:33,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:33,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-02-20 17:02:33,502 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-02-20 17:02:33,503 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-02-20 17:02:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,503 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-02-20 17:02:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-02-20 17:02:33,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:33,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:33,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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 54 states. [2022-02-20 17:02:33,504 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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 54 states. [2022-02-20 17:02:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,504 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-02-20 17:02:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-02-20 17:02:33,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:33,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:33,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:33,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-02-20 17:02:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-02-20 17:02:33,505 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2022-02-20 17:02:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:33,505 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-02-20 17:02:33,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-02-20 17:02:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-02-20 17:02:33,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 17:02:33,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:33,505 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:33,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 17:02:33,505 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 17:02:33,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:33,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1830363126, now seen corresponding path program 1 times [2022-02-20 17:02:33,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:33,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235752276] [2022-02-20 17:02:33,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:33,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:33,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {4332#true} assume { :begin_inline_ULTIMATE.init } 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(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {4332#true} is VALID [2022-02-20 17:02:33,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {4332#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__limit~0#1, main_~main__len~0#1, main_~main__i~0#1, main_~main__j~0#1, main_~main__bufsize~0#1;havoc main_~main__len~0#1;havoc main_~main__i~0#1;havoc main_~main__j~0#1;havoc main_~main__bufsize~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__bufsize~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {4332#true} is VALID [2022-02-20 17:02:33,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {4332#true} assume !(main_~main__bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__len~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~main__limit~0#1 := main_~main__bufsize~0#1 - 4;main_~main__i~0#1 := 0; {4332#true} is VALID [2022-02-20 17:02:33,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {4332#true} assume main_~main__i~0#1 < main_~main__len~0#1;main_~main__j~0#1 := 0; {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:33,539 INFO L290 TraceCheckUtils]: 4: Hoare triple {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume main_~main__i~0#1 < main_~main__len~0#1; {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:33,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume main_~main__j~0#1 < main_~main__limit~0#1; {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:33,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume 1 + main_~main__i~0#1 < main_~main__len~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 1 + main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:33,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:33,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:33,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume !!(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:33,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:33,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~7#1);havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:33,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__j~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} is VALID [2022-02-20 17:02:33,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {4334#(= |ULTIMATE.start_main_~main__j~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~9#1);main_~main____CPAchecker_TMP_1~0#1 := main_~main__j~0#1;main_~main__j~0#1 := 1 + main_~main__j~0#1;main_~main____CPAchecker_TMP_2~0#1 := main_~main__i~0#1;main_~main__i~0#1 := 1 + main_~main__i~0#1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__i~0#1 < main_~main__len~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {4335#(<= 1 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:33,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {4335#(<= 1 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~10#1);havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 <= main_~main__i~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~11#1;main_~__VERIFIER_assert__cond~11#1 := main_~__tmp_12~0#1; {4335#(<= 1 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:33,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {4335#(<= 1 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~11#1);havoc main_~__tmp_13~0#1;main_~__tmp_13~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~12#1;main_~__VERIFIER_assert__cond~12#1 := main_~__tmp_13~0#1; {4335#(<= 1 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:33,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {4335#(<= 1 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~12#1);havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 <= main_~main__j~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~13#1;main_~__VERIFIER_assert__cond~13#1 := main_~__tmp_14~0#1; {4335#(<= 1 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:33,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {4335#(<= 1 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~13#1);main_~main____CPAchecker_TMP_3~0#1 := main_~main__j~0#1;main_~main__j~0#1 := 1 + main_~main__j~0#1;main_~main____CPAchecker_TMP_4~0#1 := main_~main__i~0#1;main_~main__i~0#1 := 1 + main_~main__i~0#1;havoc main_~__tmp_15~0#1;main_~__tmp_15~0#1 := (if main_~main__j~0#1 < main_~main__bufsize~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~14#1;main_~__VERIFIER_assert__cond~14#1 := main_~__tmp_15~0#1; {4336#(<= 2 |ULTIMATE.start_main_~main__j~0#1|)} is VALID [2022-02-20 17:02:33,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {4336#(<= 2 |ULTIMATE.start_main_~main__j~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~14#1);havoc main_~__tmp_16~0#1;main_~__tmp_16~0#1 := (if 0 <= main_~main__j~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~15#1;main_~__VERIFIER_assert__cond~15#1 := main_~__tmp_16~0#1; {4337#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~15#1| 0))} is VALID [2022-02-20 17:02:33,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {4337#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~15#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~15#1; {4333#false} is VALID [2022-02-20 17:02:33,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {4333#false} assume !false; {4333#false} is VALID [2022-02-20 17:02:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:33,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:33,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235752276] [2022-02-20 17:02:33,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235752276] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:33,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:33,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:02:33,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69094300] [2022-02-20 17:02:33,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:33,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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) Word has length 21 [2022-02-20 17:02:33,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:33,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-02-20 17:02:33,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:33,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:02:33,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:33,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:02:33,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:02:33,557 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-02-20 17:02:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,908 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2022-02-20 17:02:33,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:02:33,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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) Word has length 21 [2022-02-20 17:02:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-02-20 17:02:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2022-02-20 17:02:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-02-20 17:02:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2022-02-20 17:02:33,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 143 transitions. [2022-02-20 17:02:34,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:34,005 INFO L225 Difference]: With dead ends: 121 [2022-02-20 17:02:34,005 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:02:34,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:02:34,006 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 121 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:34,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 188 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:02:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:02:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:02:34,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:34,006 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-02-20 17:02:34,006 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-02-20 17:02:34,006 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-02-20 17:02:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:34,006 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:02:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:02:34,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:34,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:34,007 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-02-20 17:02:34,007 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-02-20 17:02:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:34,007 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:02:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:02:34,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:34,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:34,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:34,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:34,007 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-02-20 17:02:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:02:34,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-02-20 17:02:34,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:34,007 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:02:34,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-02-20 17:02:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:02:34,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:34,009 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-02-20 17:02:34,009 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-02-20 17:02:34,009 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-02-20 17:02:34,009 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-02-20 17:02:34,010 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-02-20 17:02:34,010 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-02-20 17:02:34,010 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-02-20 17:02:34,010 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-02-20 17:02:34,010 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-02-20 17:02:34,010 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-02-20 17:02:34,010 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-02-20 17:02:34,010 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-02-20 17:02:34,010 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-02-20 17:02:34,010 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-02-20 17:02:34,010 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-02-20 17:02:34,010 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-02-20 17:02:34,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 17:02:34,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.