./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-properties/list-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 857285933727e0d6539ccc24abeb7a5fe95b45c6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 08:13:43,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 08:13:43,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 08:13:43,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 08:13:43,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 08:13:43,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 08:13:43,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 08:13:43,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 08:13:43,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 08:13:43,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 08:13:43,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 08:13:43,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 08:13:43,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 08:13:43,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 08:13:43,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 08:13:43,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 08:13:43,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 08:13:43,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 08:13:43,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 08:13:43,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 08:13:43,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 08:13:43,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 08:13:43,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 08:13:43,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 08:13:43,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 08:13:43,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 08:13:43,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 08:13:43,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 08:13:43,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 08:13:43,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 08:13:43,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 08:13:43,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 08:13:43,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 08:13:43,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 08:13:43,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 08:13:43,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 08:13:43,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 08:13:43,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 08:13:43,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 08:13:43,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 08:13:43,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 08:13:43,218 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 08:13:43,239 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 08:13:43,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 08:13:43,239 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 08:13:43,240 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 08:13:43,240 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 08:13:43,240 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 08:13:43,240 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 08:13:43,240 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 08:13:43,240 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 08:13:43,241 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 08:13:43,241 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 08:13:43,241 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 08:13:43,241 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 08:13:43,241 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 08:13:43,241 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 08:13:43,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 08:13:43,242 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 08:13:43,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 08:13:43,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 08:13:43,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 08:13:43,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 08:13:43,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 08:13:43,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 08:13:43,243 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 08:13:43,243 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 08:13:43,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 08:13:43,243 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 08:13:43,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 08:13:43,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 08:13:43,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 08:13:43,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 08:13:43,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 08:13:43,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 08:13:43,244 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 08:13:43,244 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 08:13:43,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 08:13:43,245 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 08:13:43,245 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 08:13:43,245 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 08:13:43,245 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan 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 -> Taipan 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 -> 857285933727e0d6539ccc24abeb7a5fe95b45c6 [2020-12-09 08:13:43,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 08:13:43,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 08:13:43,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 08:13:43,457 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 08:13:43,457 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 08:13:43,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/../../sv-benchmarks/c/list-properties/list-2.i [2020-12-09 08:13:43,506 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/data/0750e9f83/7e50747bd56e4449b1c2ad2d8eaadaed/FLAGe0dabc046 [2020-12-09 08:13:43,906 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 08:13:43,906 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/sv-benchmarks/c/list-properties/list-2.i [2020-12-09 08:13:43,917 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/data/0750e9f83/7e50747bd56e4449b1c2ad2d8eaadaed/FLAGe0dabc046 [2020-12-09 08:13:43,927 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/data/0750e9f83/7e50747bd56e4449b1c2ad2d8eaadaed [2020-12-09 08:13:43,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 08:13:43,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 08:13:43,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 08:13:43,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 08:13:43,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 08:13:43,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:13:43" (1/1) ... [2020-12-09 08:13:43,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de21fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:43, skipping insertion in model container [2020-12-09 08:13:43,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:13:43" (1/1) ... [2020-12-09 08:13:43,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 08:13:43,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 08:13:44,138 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/sv-benchmarks/c/list-properties/list-2.i[23408,23421] [2020-12-09 08:13:44,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 08:13:44,146 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 08:13:44,176 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/sv-benchmarks/c/list-properties/list-2.i[23408,23421] [2020-12-09 08:13:44,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 08:13:44,212 INFO L208 MainTranslator]: Completed translation [2020-12-09 08:13:44,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:44 WrapperNode [2020-12-09 08:13:44,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 08:13:44,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 08:13:44,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 08:13:44,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 08:13:44,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:44" (1/1) ... [2020-12-09 08:13:44,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:44" (1/1) ... [2020-12-09 08:13:44,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 08:13:44,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 08:13:44,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 08:13:44,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 08:13:44,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:44" (1/1) ... [2020-12-09 08:13:44,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:44" (1/1) ... [2020-12-09 08:13:44,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:44" (1/1) ... [2020-12-09 08:13:44,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:44" (1/1) ... [2020-12-09 08:13:44,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:44" (1/1) ... [2020-12-09 08:13:44,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:44" (1/1) ... [2020-12-09 08:13:44,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:44" (1/1) ... [2020-12-09 08:13:44,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 08:13:44,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 08:13:44,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 08:13:44,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 08:13:44,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 08:13:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 08:13:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 08:13:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 08:13:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 08:13:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 08:13:44,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 08:13:44,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 08:13:44,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 08:13:44,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 08:13:44,544 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 08:13:44,545 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2020-12-09 08:13:44,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:13:44 BoogieIcfgContainer [2020-12-09 08:13:44,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 08:13:44,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 08:13:44,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 08:13:44,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 08:13:44,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:13:43" (1/3) ... [2020-12-09 08:13:44,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5470c3b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:13:44, skipping insertion in model container [2020-12-09 08:13:44,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:44" (2/3) ... [2020-12-09 08:13:44,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5470c3b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:13:44, skipping insertion in model container [2020-12-09 08:13:44,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:13:44" (3/3) ... [2020-12-09 08:13:44,554 INFO L111 eAbstractionObserver]: Analyzing ICFG list-2.i [2020-12-09 08:13:44,566 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 08:13:44,569 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 08:13:44,578 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 08:13:44,594 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 08:13:44,594 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 08:13:44,595 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 08:13:44,595 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 08:13:44,595 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 08:13:44,595 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 08:13:44,595 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 08:13:44,595 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 08:13:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-12-09 08:13:44,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 08:13:44,607 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:13:44,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:13:44,607 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:13:44,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:13:44,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1282425306, now seen corresponding path program 1 times [2020-12-09 08:13:44,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:13:44,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781816046] [2020-12-09 08:13:44,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:13:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:13:44,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781816046] [2020-12-09 08:13:44,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:13:44,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 08:13:44,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120009352] [2020-12-09 08:13:44,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-09 08:13:44,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:13:44,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-09 08:13:44,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-09 08:13:44,729 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2020-12-09 08:13:44,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:13:44,740 INFO L93 Difference]: Finished difference Result 37 states and 55 transitions. [2020-12-09 08:13:44,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-09 08:13:44,740 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-12-09 08:13:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:13:44,746 INFO L225 Difference]: With dead ends: 37 [2020-12-09 08:13:44,746 INFO L226 Difference]: Without dead ends: 17 [2020-12-09 08:13:44,748 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-09 08:13:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-12-09 08:13:44,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-12-09 08:13:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-09 08:13:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-12-09 08:13:44,769 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2020-12-09 08:13:44,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:13:44,769 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-12-09 08:13:44,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-09 08:13:44,769 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-12-09 08:13:44,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 08:13:44,769 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:13:44,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:13:44,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 08:13:44,770 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:13:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:13:44,770 INFO L82 PathProgramCache]: Analyzing trace with hash 994915230, now seen corresponding path program 1 times [2020-12-09 08:13:44,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:13:44,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270844486] [2020-12-09 08:13:44,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:13:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:13:44,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270844486] [2020-12-09 08:13:44,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:13:44,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 08:13:44,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429880524] [2020-12-09 08:13:44,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 08:13:44,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:13:44,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 08:13:44,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:13:44,853 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 5 states. [2020-12-09 08:13:44,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:13:44,926 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2020-12-09 08:13:44,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 08:13:44,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-12-09 08:13:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:13:44,928 INFO L225 Difference]: With dead ends: 40 [2020-12-09 08:13:44,928 INFO L226 Difference]: Without dead ends: 36 [2020-12-09 08:13:44,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 08:13:44,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-09 08:13:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2020-12-09 08:13:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 08:13:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2020-12-09 08:13:44,933 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 14 [2020-12-09 08:13:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:13:44,933 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-12-09 08:13:44,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 08:13:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-12-09 08:13:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 08:13:44,934 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:13:44,934 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:13:44,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 08:13:44,935 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:13:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:13:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1615494695, now seen corresponding path program 1 times [2020-12-09 08:13:44,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:13:44,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817589111] [2020-12-09 08:13:44,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:13:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:13:44,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817589111] [2020-12-09 08:13:44,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:13:44,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 08:13:44,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803668733] [2020-12-09 08:13:44,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 08:13:44,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:13:44,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 08:13:44,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:13:44,985 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 5 states. [2020-12-09 08:13:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:13:45,050 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-12-09 08:13:45,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 08:13:45,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 08:13:45,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:13:45,051 INFO L225 Difference]: With dead ends: 42 [2020-12-09 08:13:45,051 INFO L226 Difference]: Without dead ends: 34 [2020-12-09 08:13:45,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 08:13:45,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-12-09 08:13:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2020-12-09 08:13:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-12-09 08:13:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-12-09 08:13:45,055 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2020-12-09 08:13:45,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:13:45,055 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-12-09 08:13:45,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 08:13:45,055 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-12-09 08:13:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 08:13:45,055 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:13:45,055 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:13:45,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 08:13:45,056 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:13:45,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:13:45,056 INFO L82 PathProgramCache]: Analyzing trace with hash -590791719, now seen corresponding path program 1 times [2020-12-09 08:13:45,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:13:45,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232821005] [2020-12-09 08:13:45,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:13:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:13:45,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232821005] [2020-12-09 08:13:45,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:13:45,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 08:13:45,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500072487] [2020-12-09 08:13:45,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 08:13:45,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:13:45,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 08:13:45,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:13:45,106 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 5 states. [2020-12-09 08:13:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:13:45,163 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-12-09 08:13:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 08:13:45,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 08:13:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:13:45,164 INFO L225 Difference]: With dead ends: 42 [2020-12-09 08:13:45,165 INFO L226 Difference]: Without dead ends: 31 [2020-12-09 08:13:45,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 08:13:45,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-12-09 08:13:45,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2020-12-09 08:13:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-12-09 08:13:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-12-09 08:13:45,169 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 16 [2020-12-09 08:13:45,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:13:45,169 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-12-09 08:13:45,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 08:13:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-12-09 08:13:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 08:13:45,170 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:13:45,170 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:13:45,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 08:13:45,170 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:13:45,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:13:45,171 INFO L82 PathProgramCache]: Analyzing trace with hash -226603951, now seen corresponding path program 1 times [2020-12-09 08:13:45,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:13:45,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187319696] [2020-12-09 08:13:45,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:13:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:13:45,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187319696] [2020-12-09 08:13:45,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427546355] [2020-12-09 08:13:45,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:13:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:45,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-09 08:13:45,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:13:45,369 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 08:13:45,370 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 08:13:45,379 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 08:13:45,380 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 08:13:45,380 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-12-09 08:13:45,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 08:13:45,411 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-09 08:13:45,412 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 08:13:45,417 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 08:13:45,417 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 08:13:45,418 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2020-12-09 08:13:45,457 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 08:13:45,458 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2020-12-09 08:13:45,460 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 08:13:45,474 INFO L625 ElimStorePlain]: treesize reduction 12, result has 64.7 percent of original size [2020-12-09 08:13:45,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:13:45,479 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 08:13:45,479 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2020-12-09 08:13:45,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:13:45,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:13:45,550 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-12-09 08:13:45,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:13:45,577 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-09 08:13:45,578 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 08:13:45,579 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 08:13:45,579 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 08:13:45,580 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-12-09 08:13:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:13:45,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:13:46,601 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~p~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_int| ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 3)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2020-12-09 08:13:46,622 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 08:13:46,629 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 08:13:46,630 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 08:13:46,630 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:71 [2020-12-09 08:13:47,825 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~p~0.base_36 Int) (v_DerPreprocessor_1 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_1)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_36 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_36) c_ULTIMATE.start_main_~t~0.offset 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= 2 .cse0) (= 3 .cse0)))) is different from false [2020-12-09 08:13:47,839 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1951 treesize of output 1887 [2020-12-09 08:13:47,857 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:13:47,857 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:13:47,858 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 08:13:47,859 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 08:13:47,860 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 08:13:47,862 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:13:47,862 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 08:13:47,865 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:13:47,865 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 08:13:47,866 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 08:13:47,867 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 08:13:47,868 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:13:47,869 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 08:13:47,871 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 08:13:47,872 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 08:13:47,872 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 08:13:47,873 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 08:13:47,874 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 08:13:47,875 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:13:47,876 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 08:13:47,878 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:13:47,880 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 08:13:47,881 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 08:13:47,881 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-12-09 08:13:47,883 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 08:13:47,886 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 08:13:47,887 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-12-09 08:13:47,890 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 08:13:47,891 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:13:47,893 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 08:13:47,894 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 08:13:47,895 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-12-09 08:13:47,897 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 08:13:47,900 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 08:13:47,901 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-12-09 08:13:47,904 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:13:47,906 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 08:13:47,913 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 08:13:47,972 INFO L625 ElimStorePlain]: treesize reduction 94, result has 29.3 percent of original size [2020-12-09 08:13:47,974 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 08:13:47,974 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 08:13:47,976 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-09 08:13:47,976 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:7 [2020-12-09 08:13:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-12-09 08:13:47,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [168688821] [2020-12-09 08:13:48,009 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2020-12-09 08:13:48,009 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:13:48,013 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:13:48,016 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:13:48,017 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:13:48,140 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:13:48,289 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:13:48,445 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:13:48,560 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 08:13:49,797 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 08:13:49,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:13:49,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2020-12-09 08:13:49,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530032789] [2020-12-09 08:13:49,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 08:13:49,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:13:49,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 08:13:49,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=904, Unknown=2, NotChecked=126, Total=1190 [2020-12-09 08:13:49,800 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 22 states. [2020-12-09 08:13:51,876 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~a~0.offset c_ULTIMATE.start_main_~p~0.offset) (= c_ULTIMATE.start_main_~a~0.offset 0) (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~p~0.base) (not (= c_ULTIMATE.start_main_~t~0.base c_ULTIMATE.start_main_~p~0.base)) (= c_ULTIMATE.start_main_~t~0.offset 0) (forall ((v_ULTIMATE.start_main_~p~0.base_36 Int) (v_DerPreprocessor_1 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_1)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_36 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_36) c_ULTIMATE.start_main_~t~0.offset 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= 2 .cse0) (= 3 .cse0)))) (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset) 2) (= (select |c_#valid| c_ULTIMATE.start_main_~p~0.base) 1)) is different from false [2020-12-09 08:13:53,880 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~a~0.offset 0) (= c_ULTIMATE.start_main_~p~0.offset 0) (forall ((ULTIMATE.start_main_~p~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_int| ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 3)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 3) (= .cse0 2)))) (= 2 (select (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset)) (= (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 3)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 2)) is different from false [2020-12-09 08:13:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:13:54,002 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2020-12-09 08:13:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 08:13:54,002 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2020-12-09 08:13:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:13:54,003 INFO L225 Difference]: With dead ends: 63 [2020-12-09 08:13:54,003 INFO L226 Difference]: Without dead ends: 57 [2020-12-09 08:13:54,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=200, Invalid=1218, Unknown=4, NotChecked=300, Total=1722 [2020-12-09 08:13:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-12-09 08:13:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 27. [2020-12-09 08:13:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-09 08:13:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2020-12-09 08:13:54,009 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 17 [2020-12-09 08:13:54,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:13:54,009 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2020-12-09 08:13:54,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 08:13:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-12-09 08:13:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 08:13:54,010 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:13:54,010 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:13:54,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:13:54,211 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:13:54,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:13:54,212 INFO L82 PathProgramCache]: Analyzing trace with hash -38960199, now seen corresponding path program 1 times [2020-12-09 08:13:54,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:13:54,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772417647] [2020-12-09 08:13:54,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:13:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:13:54,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772417647] [2020-12-09 08:13:54,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698323783] [2020-12-09 08:13:54,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:13:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:54,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-09 08:13:54,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:13:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:13:54,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:13:56,607 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~p~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_int| ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 3)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 3) (= .cse0 1)))) is different from false [2020-12-09 08:13:57,880 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~p~0.base_47 Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_2)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_47 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_47) c_ULTIMATE.start_main_~t~0.offset 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= 3 .cse0) (= .cse0 1)))) is different from false [2020-12-09 08:13:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-12-09 08:13:57,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2146896681] [2020-12-09 08:13:57,976 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2020-12-09 08:13:57,976 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:13:57,977 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:13:57,977 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:13:57,977 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:13:58,079 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:13:58,194 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:13:58,451 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:13:58,585 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:13:59,545 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 08:13:59,844 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 08:13:59,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:13:59,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2020-12-09 08:13:59,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992414059] [2020-12-09 08:13:59,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 08:13:59,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:13:59,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 08:13:59,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=768, Unknown=2, NotChecked=114, Total=992 [2020-12-09 08:13:59,846 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 22 states. [2020-12-09 08:14:00,930 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~a~0.offset c_ULTIMATE.start_main_~p~0.offset) (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset) 1) (= c_ULTIMATE.start_main_~a~0.offset 0) (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~p~0.base) (not (= c_ULTIMATE.start_main_~t~0.base c_ULTIMATE.start_main_~p~0.base)) (= c_ULTIMATE.start_main_~t~0.offset 0) (= (select |c_#valid| c_ULTIMATE.start_main_~p~0.base) 1) (forall ((v_ULTIMATE.start_main_~p~0.base_47 Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_2)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_47 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_47) c_ULTIMATE.start_main_~t~0.offset 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= 3 .cse0) (= .cse0 1))))) is different from false [2020-12-09 08:14:02,933 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~a~0.offset 0) (= c_ULTIMATE.start_main_~p~0.offset 0) (forall ((ULTIMATE.start_main_~p~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_int| ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 3)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 3) (= .cse0 1)))) (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1) (= (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 3)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1)) is different from false [2020-12-09 08:14:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:14:03,108 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2020-12-09 08:14:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 08:14:03,109 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2020-12-09 08:14:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:14:03,109 INFO L225 Difference]: With dead ends: 70 [2020-12-09 08:14:03,109 INFO L226 Difference]: Without dead ends: 66 [2020-12-09 08:14:03,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=139, Invalid=995, Unknown=4, NotChecked=268, Total=1406 [2020-12-09 08:14:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-12-09 08:14:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 37. [2020-12-09 08:14:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-09 08:14:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2020-12-09 08:14:03,116 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 17 [2020-12-09 08:14:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:14:03,116 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2020-12-09 08:14:03,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 08:14:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2020-12-09 08:14:03,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 08:14:03,117 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:14:03,117 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:14:03,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-12-09 08:14:03,319 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:14:03,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:14:03,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1944652852, now seen corresponding path program 1 times [2020-12-09 08:14:03,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:14:03,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365478383] [2020-12-09 08:14:03,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:14:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:14:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:14:03,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365478383] [2020-12-09 08:14:03,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665481817] [2020-12-09 08:14:03,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:14:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:14:03,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 40 conjunts are in the unsatisfiable core [2020-12-09 08:14:03,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:14:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:14:03,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:14:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:14:04,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1079969262] [2020-12-09 08:14:04,142 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2020-12-09 08:14:04,142 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:14:04,142 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:14:04,142 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:14:04,142 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:14:04,188 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:14:04,287 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:14:04,408 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:14:04,540 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 08:14:05,154 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 08:14:05,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:14:05,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2020-12-09 08:14:05,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529173166] [2020-12-09 08:14:05,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 08:14:05,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:14:05,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 08:14:05,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 08:14:05,156 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 22 states. [2020-12-09 08:14:05,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:14:05,687 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2020-12-09 08:14:05,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 08:14:05,687 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 19 [2020-12-09 08:14:05,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:14:05,687 INFO L225 Difference]: With dead ends: 65 [2020-12-09 08:14:05,687 INFO L226 Difference]: Without dead ends: 57 [2020-12-09 08:14:05,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=367, Invalid=1985, Unknown=0, NotChecked=0, Total=2352 [2020-12-09 08:14:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-12-09 08:14:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2020-12-09 08:14:05,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-09 08:14:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2020-12-09 08:14:05,692 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 19 [2020-12-09 08:14:05,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:14:05,692 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2020-12-09 08:14:05,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 08:14:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2020-12-09 08:14:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 08:14:05,692 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:14:05,692 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:14:05,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2020-12-09 08:14:05,894 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:14:05,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:14:05,895 INFO L82 PathProgramCache]: Analyzing trace with hash 753373886, now seen corresponding path program 2 times [2020-12-09 08:14:05,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:14:05,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264288662] [2020-12-09 08:14:05,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:14:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:14:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:14:06,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264288662] [2020-12-09 08:14:06,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997440305] [2020-12-09 08:14:06,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:14:06,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 08:14:06,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 08:14:06,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 43 conjunts are in the unsatisfiable core [2020-12-09 08:14:06,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:14:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:14:08,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:14:09,835 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~p~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_int| ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 3)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2020-12-09 08:14:11,663 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~p~0.base_74 Int) (v_DerPreprocessor_5 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_5)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_74 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_74) c_ULTIMATE.start_main_~t~0.offset 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= 3 .cse0) (= 2 .cse0)))) is different from false [2020-12-09 08:14:13,613 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~p~0.base_74 Int) (v_DerPreprocessor_5 Int) (ULTIMATE.start_main_~p~0.offset Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset 2) (+ ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_5)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_74 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_74) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= 3 .cse0) (= 2 .cse0)))) is different from false [2020-12-09 08:14:15,631 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~p~0.base_74 Int) (v_DerPreprocessor_6 Int) (v_ULTIMATE.start_main_~p~0.offset_69 Int) (v_DerPreprocessor_5 Int)) (let ((.cse0 (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_6)))) (store .cse2 c_ULTIMATE.start_main_~t~0.base (store (store (select .cse2 c_ULTIMATE.start_main_~t~0.base) v_ULTIMATE.start_main_~p~0.offset_69 2) (+ v_ULTIMATE.start_main_~p~0.offset_69 4) v_DerPreprocessor_5))))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_74 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_74) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 2) (= .cse0 3)))) is different from false [2020-12-09 08:16:14,133 WARN L197 SmtUtils]: Spent 1.04 m on a formula simplification. DAG size of input: 570 DAG size of output: 741 [2020-12-09 08:16:16,115 WARN L197 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 744 DAG size of output: 48 [2020-12-09 08:16:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2020-12-09 08:16:16,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [995901678] [2020-12-09 08:16:16,213 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2020-12-09 08:16:16,214 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:16:16,214 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:16:16,214 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:16:16,214 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:16:16,284 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:16:16,363 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:16:16,456 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:16:16,542 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 08:16:17,315 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 08:16:17,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:16:17,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2020-12-09 08:16:17,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987127643] [2020-12-09 08:16:17,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 08:16:17,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:16:17,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 08:16:17,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=975, Unknown=5, NotChecked=268, Total=1406 [2020-12-09 08:16:17,317 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 25 states. [2020-12-09 08:16:19,353 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_main_~a~0.offset c_ULTIMATE.start_main_~p~0.offset)) (.cse1 (= c_ULTIMATE.start_main_~a~0.offset 0)) (.cse2 (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~p~0.base))) (and .cse0 .cse1 (let ((.cse3 (= (select |c_#valid| c_ULTIMATE.start_main_~a~0.base) 1)) (.cse4 (select |c_#valid| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 0) (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (not (= |#t~string0.base| |#t~string1.base|)) (= (select |c_#valid| |#t~string0.base|) 1) (= (select |c_#valid| |#t~string1.base|) 1)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((|#t~string1.base| Int)) (and (= (select |c_#valid| |#t~string1.base|) 1) (not (= |#t~string1.base| 0)))) (= .cse4 1)))) .cse2 (not (= c_ULTIMATE.start_main_~t~0.base c_ULTIMATE.start_main_~p~0.base)) (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset) 2) (forall ((v_ULTIMATE.start_main_~p~0.base_74 Int) (v_DerPreprocessor_6 Int) (v_ULTIMATE.start_main_~p~0.offset_69 Int) (v_DerPreprocessor_5 Int)) (let ((.cse5 (select (select (let ((.cse6 (let ((.cse7 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_6)))) (store .cse7 c_ULTIMATE.start_main_~t~0.base (store (store (select .cse7 c_ULTIMATE.start_main_~t~0.base) v_ULTIMATE.start_main_~p~0.offset_69 2) (+ v_ULTIMATE.start_main_~p~0.offset_69 4) v_DerPreprocessor_5))))) (store .cse6 v_ULTIMATE.start_main_~p~0.base_74 (store (select .cse6 v_ULTIMATE.start_main_~p~0.base_74) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse5 2) (= .cse5 3)))))) is different from false [2020-12-09 08:16:20,963 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~a~0.offset 0) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~p~0.base)) (= (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 2)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 2) (forall ((v_ULTIMATE.start_main_~p~0.base_74 Int) (v_DerPreprocessor_5 Int) (ULTIMATE.start_main_~p~0.offset Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset 2) (+ ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_5)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_74 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_74) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= 3 .cse0) (= 2 .cse0))))) is different from false [2020-12-09 08:16:22,973 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~a~0.offset 0) (= c_ULTIMATE.start_main_~t~0.offset 0) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~p~0.base)) (= 2 (select (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset)) (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset) 2) (forall ((v_ULTIMATE.start_main_~p~0.base_74 Int) (v_DerPreprocessor_5 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_5)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_74 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_74) c_ULTIMATE.start_main_~t~0.offset 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= 3 .cse0) (= 2 .cse0))))) is different from false [2020-12-09 08:16:25,007 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~a~0.offset 0) (= c_ULTIMATE.start_main_~p~0.offset 0) (forall ((ULTIMATE.start_main_~p~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_int| ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 3)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 3) (= .cse0 2)))) (= 2 (select (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset)) (exists ((v_ULTIMATE.start_main_~p~0.offset_62 Int) (v_ULTIMATE.start_main_~p~0.base_68 Int)) (and (not (= v_ULTIMATE.start_main_~p~0.base_68 c_ULTIMATE.start_main_~a~0.base)) (= (select (select |c_#memory_int| v_ULTIMATE.start_main_~p~0.base_68) v_ULTIMATE.start_main_~p~0.offset_62) 2)))) is different from false [2020-12-09 08:16:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:16:25,197 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2020-12-09 08:16:25,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 08:16:25,198 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 20 [2020-12-09 08:16:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:16:25,198 INFO L225 Difference]: With dead ends: 86 [2020-12-09 08:16:25,198 INFO L226 Difference]: Without dead ends: 82 [2020-12-09 08:16:25,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 23 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=205, Invalid=1300, Unknown=9, NotChecked=648, Total=2162 [2020-12-09 08:16:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-12-09 08:16:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 47. [2020-12-09 08:16:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-09 08:16:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2020-12-09 08:16:25,203 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 20 [2020-12-09 08:16:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:16:25,203 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2020-12-09 08:16:25,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 08:16:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2020-12-09 08:16:25,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 08:16:25,204 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:16:25,204 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:16:25,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:16:25,406 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:16:25,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:16:25,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1199029674, now seen corresponding path program 1 times [2020-12-09 08:16:25,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:16:25,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23107128] [2020-12-09 08:16:25,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:16:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:16:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:16:25,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23107128] [2020-12-09 08:16:25,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505768522] [2020-12-09 08:16:25,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:16:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:16:25,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-09 08:16:25,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:16:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:16:26,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:16:27,854 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~p~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_int| ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 3)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 3) (= .cse0 1)))) is different from false [2020-12-09 08:16:29,870 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~p~0.base_87 Int) (v_DerPreprocessor_7 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_7)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_87 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_87) c_ULTIMATE.start_main_~t~0.offset 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= 1 .cse0) (= 3 .cse0)))) is different from false [2020-12-09 08:16:31,561 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~p~0.base_87 Int) (v_DerPreprocessor_7 Int) (ULTIMATE.start_main_~p~0.offset Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset 2) (+ ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_7)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_87 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_87) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2020-12-09 08:16:32,826 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~p~0.offset_82 Int) (v_ULTIMATE.start_main_~p~0.base_87 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_7 Int)) (let ((.cse0 (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_8)))) (store .cse2 c_ULTIMATE.start_main_~t~0.base (store (store (select .cse2 c_ULTIMATE.start_main_~t~0.base) v_ULTIMATE.start_main_~p~0.offset_82 2) (+ v_ULTIMATE.start_main_~p~0.offset_82 4) v_DerPreprocessor_7))))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_87 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_87) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= 3 .cse0) (= .cse0 1)))) is different from false [2020-12-09 08:16:32,940 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 325 DAG size of output: 118 [2020-12-09 08:17:12,170 WARN L197 SmtUtils]: Spent 33.24 s on a formula simplification. DAG size of input: 588 DAG size of output: 379 [2020-12-09 08:17:13,067 WARN L197 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 48 [2020-12-09 08:17:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2020-12-09 08:17:13,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1242529112] [2020-12-09 08:17:13,126 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 08:17:13,126 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:17:13,126 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:17:13,126 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:17:13,126 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:17:13,169 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:13,258 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:13,264 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:13,270 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:13,444 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:13,546 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:13,613 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:13,684 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 08:17:14,095 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 08:17:14,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:17:14,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2020-12-09 08:17:14,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229097565] [2020-12-09 08:17:14,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 08:17:14,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:17:14,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 08:17:14,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=943, Unknown=4, NotChecked=260, Total=1332 [2020-12-09 08:17:14,096 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 25 states. [2020-12-09 08:17:14,849 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_main_~a~0.offset c_ULTIMATE.start_main_~p~0.offset)) (.cse1 (= c_ULTIMATE.start_main_~a~0.offset 0)) (.cse2 (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~p~0.base))) (and .cse0 (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset) 1) .cse1 (let ((.cse3 (= (select |c_#valid| c_ULTIMATE.start_main_~a~0.base) 1)) (.cse4 (select |c_#valid| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 0)) (and .cse0 .cse1 .cse2 .cse3 (= .cse4 1)))) .cse2 (not (= c_ULTIMATE.start_main_~t~0.base c_ULTIMATE.start_main_~p~0.base)) (forall ((v_ULTIMATE.start_main_~p~0.offset_82 Int) (v_ULTIMATE.start_main_~p~0.base_87 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_7 Int)) (let ((.cse5 (select (select (let ((.cse6 (let ((.cse7 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_8)))) (store .cse7 c_ULTIMATE.start_main_~t~0.base (store (store (select .cse7 c_ULTIMATE.start_main_~t~0.base) v_ULTIMATE.start_main_~p~0.offset_82 2) (+ v_ULTIMATE.start_main_~p~0.offset_82 4) v_DerPreprocessor_7))))) (store .cse6 v_ULTIMATE.start_main_~p~0.base_87 (store (select .cse6 v_ULTIMATE.start_main_~p~0.base_87) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= 3 .cse5) (= .cse5 1)))))) is different from false [2020-12-09 08:17:16,624 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~a~0.offset 0) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~p~0.base)) (forall ((v_ULTIMATE.start_main_~p~0.base_87 Int) (v_DerPreprocessor_7 Int) (ULTIMATE.start_main_~p~0.offset Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset 2) (+ ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_7)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_87 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_87) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 1) (= 3 .cse0)))) (= (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 2)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1)) is different from false [2020-12-09 08:17:18,659 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~a~0.offset 0) (= c_ULTIMATE.start_main_~t~0.offset 0) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~p~0.base)) (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset) 2) (forall ((v_ULTIMATE.start_main_~p~0.base_87 Int) (v_DerPreprocessor_7 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_7)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_87 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_87) c_ULTIMATE.start_main_~t~0.offset 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= 1 .cse0) (= 3 .cse0)))) (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1)) is different from false [2020-12-09 08:17:19,991 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~a~0.offset 0) (= c_ULTIMATE.start_main_~p~0.offset 0) (exists ((v_ULTIMATE.start_main_~p~0.offset_75 Int) (v_ULTIMATE.start_main_~p~0.base_81 Int)) (and (= (select (select |c_#memory_int| v_ULTIMATE.start_main_~p~0.base_81) v_ULTIMATE.start_main_~p~0.offset_75) 2) (not (= v_ULTIMATE.start_main_~p~0.base_81 c_ULTIMATE.start_main_~a~0.base)))) (forall ((ULTIMATE.start_main_~p~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_int| ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 3)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 3) (= .cse0 1)))) (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1)) is different from false [2020-12-09 08:17:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:17:20,215 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2020-12-09 08:17:20,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 08:17:20,215 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 20 [2020-12-09 08:17:20,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:17:20,216 INFO L225 Difference]: With dead ends: 94 [2020-12-09 08:17:20,216 INFO L226 Difference]: Without dead ends: 90 [2020-12-09 08:17:20,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=166, Invalid=1190, Unknown=8, NotChecked=616, Total=1980 [2020-12-09 08:17:20,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-12-09 08:17:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 47. [2020-12-09 08:17:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-09 08:17:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2020-12-09 08:17:20,221 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 20 [2020-12-09 08:17:20,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:17:20,221 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2020-12-09 08:17:20,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 08:17:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2020-12-09 08:17:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 08:17:20,222 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:17:20,222 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:17:20,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable171 [2020-12-09 08:17:20,423 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:17:20,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:17:20,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1011385922, now seen corresponding path program 2 times [2020-12-09 08:17:20,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:17:20,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136153616] [2020-12-09 08:17:20,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:17:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:17:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:17:20,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136153616] [2020-12-09 08:17:20,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82294147] [2020-12-09 08:17:20,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:17:20,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 08:17:20,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 08:17:20,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-09 08:17:20,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:17:21,347 WARN L197 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-12-09 08:17:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:17:21,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:17:23,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~p~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_int| ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 3)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 3) (= .cse0 1)))) is different from false [2020-12-09 08:17:25,413 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (v_ULTIMATE.start_main_~p~0.base_102 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_9)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_102 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_102) c_ULTIMATE.start_main_~t~0.offset 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2020-12-09 08:17:27,419 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (v_ULTIMATE.start_main_~p~0.base_102 Int) (ULTIMATE.start_main_~p~0.offset Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset 1) (+ ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_9)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_102 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_102) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2020-12-09 08:17:29,441 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~p~0.offset_97 Int) (v_DerPreprocessor_9 Int) (v_ULTIMATE.start_main_~p~0.base_102 Int) (v_DerPreprocessor_10 Int)) (let ((.cse0 (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_10)))) (store .cse2 c_ULTIMATE.start_main_~t~0.base (store (store (select .cse2 c_ULTIMATE.start_main_~t~0.base) v_ULTIMATE.start_main_~p~0.offset_97 1) (+ v_ULTIMATE.start_main_~p~0.offset_97 4) v_DerPreprocessor_9))))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_102 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_102) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2020-12-09 08:17:29,723 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 47 [2020-12-09 08:17:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2020-12-09 08:17:29,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1895182597] [2020-12-09 08:17:29,797 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2020-12-09 08:17:29,797 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:17:29,797 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:17:29,797 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:17:29,797 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:17:29,871 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:29,949 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:29,963 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:29,969 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:30,131 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:30,233 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:30,280 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 08:17:30,660 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 08:17:30,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:17:30,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2020-12-09 08:17:30,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282170743] [2020-12-09 08:17:30,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 08:17:30,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:17:30,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 08:17:30,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=880, Unknown=4, NotChecked=252, Total=1260 [2020-12-09 08:17:30,661 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 25 states. [2020-12-09 08:17:33,459 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_main_~a~0.offset c_ULTIMATE.start_main_~p~0.offset)) (.cse1 (= c_ULTIMATE.start_main_~a~0.offset 0)) (.cse2 (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~p~0.base))) (and .cse0 (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset) 1) .cse1 (let ((.cse3 (= (select |c_#valid| c_ULTIMATE.start_main_~a~0.base) 1)) (.cse4 (select |c_#valid| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 0)) (and .cse0 .cse1 .cse2 .cse3 (= .cse4 1)))) .cse2 (not (= c_ULTIMATE.start_main_~t~0.base c_ULTIMATE.start_main_~p~0.base)) (forall ((v_ULTIMATE.start_main_~p~0.offset_97 Int) (v_DerPreprocessor_9 Int) (v_ULTIMATE.start_main_~p~0.base_102 Int) (v_DerPreprocessor_10 Int)) (let ((.cse5 (select (select (let ((.cse6 (let ((.cse7 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_10)))) (store .cse7 c_ULTIMATE.start_main_~t~0.base (store (store (select .cse7 c_ULTIMATE.start_main_~t~0.base) v_ULTIMATE.start_main_~p~0.offset_97 1) (+ v_ULTIMATE.start_main_~p~0.offset_97 4) v_DerPreprocessor_9))))) (store .cse6 v_ULTIMATE.start_main_~p~0.base_102 (store (select .cse6 v_ULTIMATE.start_main_~p~0.base_102) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse5 1) (= 3 .cse5)))))) is different from false [2020-12-09 08:17:35,419 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 1)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1) (= c_ULTIMATE.start_main_~a~0.offset 0) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~p~0.base)) (forall ((v_DerPreprocessor_9 Int) (v_ULTIMATE.start_main_~p~0.base_102 Int) (ULTIMATE.start_main_~p~0.offset Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset 1) (+ ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_9)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_102 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_102) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 1) (= 3 .cse0))))) is different from false [2020-12-09 08:17:36,915 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset) 1) (= c_ULTIMATE.start_main_~a~0.offset 0) (= c_ULTIMATE.start_main_~t~0.offset 0) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~p~0.base)) (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1) (forall ((v_DerPreprocessor_9 Int) (v_ULTIMATE.start_main_~p~0.base_102 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_9)))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_102 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_102) c_ULTIMATE.start_main_~t~0.offset 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 1) (= 3 .cse0))))) is different from false [2020-12-09 08:17:38,242 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~a~0.offset 0) (= c_ULTIMATE.start_main_~p~0.offset 0) (exists ((v_ULTIMATE.start_main_~p~0.base_96 Int) (v_ULTIMATE.start_main_~p~0.offset_90 Int)) (and (not (= v_ULTIMATE.start_main_~p~0.base_96 c_ULTIMATE.start_main_~a~0.base)) (= (select (select |c_#memory_int| v_ULTIMATE.start_main_~p~0.base_96) v_ULTIMATE.start_main_~p~0.offset_90) 1))) (forall ((ULTIMATE.start_main_~p~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_int| ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 3)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset))) (or (= .cse0 3) (= .cse0 1)))) (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1)) is different from false [2020-12-09 08:17:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:17:38,512 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2020-12-09 08:17:38,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 08:17:38,512 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 20 [2020-12-09 08:17:38,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:17:38,513 INFO L225 Difference]: With dead ends: 104 [2020-12-09 08:17:38,513 INFO L226 Difference]: Without dead ends: 100 [2020-12-09 08:17:38,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=165, Invalid=1119, Unknown=8, NotChecked=600, Total=1892 [2020-12-09 08:17:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-12-09 08:17:38,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 50. [2020-12-09 08:17:38,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-12-09 08:17:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2020-12-09 08:17:38,519 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 20 [2020-12-09 08:17:38,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:17:38,519 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2020-12-09 08:17:38,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 08:17:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2020-12-09 08:17:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 08:17:38,519 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:17:38,519 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:17:38,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable234 [2020-12-09 08:17:38,721 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:17:38,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:17:38,722 INFO L82 PathProgramCache]: Analyzing trace with hash -451940729, now seen corresponding path program 1 times [2020-12-09 08:17:38,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:17:38,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889979868] [2020-12-09 08:17:38,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:17:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:17:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:17:38,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889979868] [2020-12-09 08:17:38,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206809787] [2020-12-09 08:17:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:17:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:17:38,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 39 conjunts are in the unsatisfiable core [2020-12-09 08:17:38,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:17:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:17:39,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:17:39,305 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 08:17:39,493 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2020-12-09 08:17:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:17:39,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1723256100] [2020-12-09 08:17:39,632 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2020-12-09 08:17:39,632 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:17:39,632 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:17:39,632 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:17:39,632 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:17:39,681 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:39,770 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:39,860 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:39,963 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 08:17:40,606 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 08:17:40,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:17:40,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2020-12-09 08:17:40,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620339285] [2020-12-09 08:17:40,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 08:17:40,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:17:40,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 08:17:40,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1097, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 08:17:40,607 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 24 states. [2020-12-09 08:17:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:17:41,733 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2020-12-09 08:17:41,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 08:17:41,733 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2020-12-09 08:17:41,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:17:41,733 INFO L225 Difference]: With dead ends: 76 [2020-12-09 08:17:41,734 INFO L226 Difference]: Without dead ends: 62 [2020-12-09 08:17:41,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=373, Invalid=2177, Unknown=0, NotChecked=0, Total=2550 [2020-12-09 08:17:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-12-09 08:17:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2020-12-09 08:17:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-09 08:17:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2020-12-09 08:17:41,738 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 21 [2020-12-09 08:17:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:17:41,739 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2020-12-09 08:17:41,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 08:17:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2020-12-09 08:17:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 08:17:41,739 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:17:41,739 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:17:41,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:17:41,941 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:17:41,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:17:41,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1808492295, now seen corresponding path program 1 times [2020-12-09 08:17:41,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:17:41,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048276318] [2020-12-09 08:17:41,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:17:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:17:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:17:42,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048276318] [2020-12-09 08:17:42,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117604922] [2020-12-09 08:17:42,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:17:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:17:42,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-09 08:17:42,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:17:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:17:42,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:17:44,399 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~p~0.base Int)) (not (= (select (select (store |c_#memory_int| ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 3)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1))) is different from false [2020-12-09 08:17:45,835 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 Int) (v_ULTIMATE.start_main_~p~0.base_133 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_13)))) (store .cse0 v_ULTIMATE.start_main_~p~0.base_133 (store (select .cse0 v_ULTIMATE.start_main_~p~0.base_133) c_ULTIMATE.start_main_~t~0.offset 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1))) is different from false [2020-12-09 08:17:47,605 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 Int) (v_ULTIMATE.start_main_~p~0.base_133 Int) (ULTIMATE.start_main_~p~0.offset Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset 2) (+ ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_13)))) (store .cse0 v_ULTIMATE.start_main_~p~0.base_133 (store (select .cse0 v_ULTIMATE.start_main_~p~0.base_133) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1))) is different from false [2020-12-09 08:17:49,620 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (v_ULTIMATE.start_main_~p~0.base_133 Int) (v_ULTIMATE.start_main_~p~0.offset_128 Int)) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_14)))) (store .cse1 c_ULTIMATE.start_main_~t~0.base (store (store (select .cse1 c_ULTIMATE.start_main_~t~0.base) v_ULTIMATE.start_main_~p~0.offset_128 2) (+ v_ULTIMATE.start_main_~p~0.offset_128 4) v_DerPreprocessor_13))))) (store .cse0 v_ULTIMATE.start_main_~p~0.base_133 (store (select .cse0 v_ULTIMATE.start_main_~p~0.base_133) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1))) is different from false [2020-12-09 08:17:49,807 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2020-12-09 08:17:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2020-12-09 08:17:49,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1878280484] [2020-12-09 08:17:49,905 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2020-12-09 08:17:49,905 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:17:49,905 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:17:49,905 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:17:49,905 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:17:49,945 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:50,039 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:50,045 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:50,051 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:50,148 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:17:50,248 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 08:17:50,844 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 08:17:50,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:17:50,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2020-12-09 08:17:50,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420407492] [2020-12-09 08:17:50,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-12-09 08:17:50,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:17:50,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-12-09 08:17:50,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=926, Unknown=4, NotChecked=260, Total=1332 [2020-12-09 08:17:50,846 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 26 states. [2020-12-09 08:17:52,881 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_main_~a~0.offset c_ULTIMATE.start_main_~p~0.offset)) (.cse3 (= c_ULTIMATE.start_main_~a~0.offset 0)) (.cse4 (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~p~0.base))) (and .cse0 (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (v_ULTIMATE.start_main_~p~0.base_133 Int) (v_ULTIMATE.start_main_~p~0.offset_128 Int)) (not (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_14)))) (store .cse2 c_ULTIMATE.start_main_~t~0.base (store (store (select .cse2 c_ULTIMATE.start_main_~t~0.base) v_ULTIMATE.start_main_~p~0.offset_128 2) (+ v_ULTIMATE.start_main_~p~0.offset_128 4) v_DerPreprocessor_13))))) (store .cse1 v_ULTIMATE.start_main_~p~0.base_133 (store (select .cse1 v_ULTIMATE.start_main_~p~0.base_133) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1))) .cse3 (let ((.cse5 (= (select |c_#valid| c_ULTIMATE.start_main_~a~0.base) 1)) (.cse6 (select |c_#valid| 0))) (or (and .cse0 .cse3 .cse4 .cse5 (= .cse6 0)) (and .cse0 .cse3 .cse4 .cse5 (= .cse6 1)))) .cse4 (not (= c_ULTIMATE.start_main_~t~0.base c_ULTIMATE.start_main_~p~0.base)) (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset) 2))) is different from false [2020-12-09 08:17:54,810 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~a~0.offset 0) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~p~0.base)) (= (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 2)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 2) (forall ((v_DerPreprocessor_13 Int) (v_ULTIMATE.start_main_~p~0.base_133 Int) (ULTIMATE.start_main_~p~0.offset Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset 2) (+ ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_13)))) (store .cse0 v_ULTIMATE.start_main_~p~0.base_133 (store (select .cse0 v_ULTIMATE.start_main_~p~0.base_133) 0 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1)))) is different from false [2020-12-09 08:17:56,820 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~a~0.offset 0) (= c_ULTIMATE.start_main_~t~0.offset 0) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~p~0.base)) (= 2 (select (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset)) (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset) 2) (forall ((v_DerPreprocessor_13 Int) (v_ULTIMATE.start_main_~p~0.base_133 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) (+ c_ULTIMATE.start_main_~p~0.offset 4) v_DerPreprocessor_13)))) (store .cse0 v_ULTIMATE.start_main_~p~0.base_133 (store (select .cse0 v_ULTIMATE.start_main_~p~0.base_133) c_ULTIMATE.start_main_~t~0.offset 3))) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1)))) is different from false [2020-12-09 08:17:58,865 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~a~0.offset 0) (= c_ULTIMATE.start_main_~p~0.offset 0) (= 2 (select (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset)) (forall ((ULTIMATE.start_main_~p~0.base Int)) (not (= (select (select (store |c_#memory_int| ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 3)) c_ULTIMATE.start_main_~a~0.base) c_ULTIMATE.start_main_~a~0.offset) 1))) (exists ((v_ULTIMATE.start_main_~p~0.base_126 Int) (v_ULTIMATE.start_main_~p~0.offset_120 Int)) (and (= 2 (select (select |c_#memory_int| v_ULTIMATE.start_main_~p~0.base_126) v_ULTIMATE.start_main_~p~0.offset_120)) (not (= v_ULTIMATE.start_main_~p~0.base_126 c_ULTIMATE.start_main_~a~0.base))))) is different from false [2020-12-09 08:18:01,007 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 41 [2020-12-09 08:18:03,061 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 43 [2020-12-09 08:18:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:18:03,102 INFO L93 Difference]: Finished difference Result 105 states and 123 transitions. [2020-12-09 08:18:03,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 08:18:03,102 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 22 [2020-12-09 08:18:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:18:03,102 INFO L225 Difference]: With dead ends: 105 [2020-12-09 08:18:03,102 INFO L226 Difference]: Without dead ends: 97 [2020-12-09 08:18:03,103 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=196, Invalid=1234, Unknown=8, NotChecked=632, Total=2070 [2020-12-09 08:18:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-12-09 08:18:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2020-12-09 08:18:03,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 08:18:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2020-12-09 08:18:03,108 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 22 [2020-12-09 08:18:03,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:18:03,109 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2020-12-09 08:18:03,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-12-09 08:18:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2020-12-09 08:18:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 08:18:03,113 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:18:03,113 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:18:03,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable326 [2020-12-09 08:18:03,314 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:18:03,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:18:03,317 INFO L82 PathProgramCache]: Analyzing trace with hash -783789319, now seen corresponding path program 2 times [2020-12-09 08:18:03,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:18:03,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119619136] [2020-12-09 08:18:03,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:18:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:18:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:18:03,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119619136] [2020-12-09 08:18:03,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424165362] [2020-12-09 08:18:03,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:18:03,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 08:18:03,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 08:18:03,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 55 conjunts are in the unsatisfiable core [2020-12-09 08:18:03,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:18:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:18:04,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:18:06,560 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int)) (let ((.cse0 (let ((.cse1 (+ c_ULTIMATE.start_main_~a~0.offset 4))) (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset 3)) (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset v_DerPreprocessor_16)) c_ULTIMATE.start_main_~a~0.base) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~p~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~p~0.base) c_ULTIMATE.start_main_~p~0.offset v_DerPreprocessor_15)) c_ULTIMATE.start_main_~a~0.base) .cse1))))) (or (= 2 .cse0) (= 3 .cse0)))) is different from false [2020-12-09 08:18:07,035 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2020-12-09 08:18:08,537 WARN L197 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2020-12-09 08:18:09,448 WARN L197 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 81 [2020-12-09 08:18:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2020-12-09 08:18:09,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1238817885] [2020-12-09 08:18:09,941 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2020-12-09 08:18:09,941 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:18:09,941 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:18:09,942 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:18:09,942 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:18:10,013 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:18:10,083 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:18:10,176 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:18:10,279 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 08:18:11,068 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 08:18:11,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:18:11,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 31 [2020-12-09 08:18:11,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933769906] [2020-12-09 08:18:11,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-09 08:18:11,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:18:11,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-09 08:18:11,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1638, Unknown=1, NotChecked=82, Total=1892 [2020-12-09 08:18:11,069 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 32 states. [2020-12-09 08:18:29,886 WARN L197 SmtUtils]: Spent 14.51 s on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2020-12-09 08:18:50,149 WARN L197 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 114 DAG size of output: 85 [2020-12-09 08:18:54,112 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2020-12-09 08:18:58,664 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 53 [2020-12-09 08:19:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:19:41,020 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2020-12-09 08:19:41,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 08:19:41,024 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 22 [2020-12-09 08:19:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:19:41,025 INFO L225 Difference]: With dead ends: 110 [2020-12-09 08:19:41,025 INFO L226 Difference]: Without dead ends: 102 [2020-12-09 08:19:41,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 49.2s TimeCoverageRelationStatistics Valid=421, Invalid=3358, Unknown=7, NotChecked=120, Total=3906 [2020-12-09 08:19:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-12-09 08:19:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 68. [2020-12-09 08:19:41,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-09 08:19:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2020-12-09 08:19:41,035 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 22 [2020-12-09 08:19:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:19:41,036 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2020-12-09 08:19:41,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-09 08:19:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2020-12-09 08:19:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 08:19:41,036 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:19:41,037 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:19:41,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable365 [2020-12-09 08:19:41,237 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:19:41,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:19:41,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1167605103, now seen corresponding path program 1 times [2020-12-09 08:19:41,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:19:41,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990708435] [2020-12-09 08:19:41,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:19:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 08:19:41,277 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 08:19:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 08:19:41,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 08:19:41,305 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 08:19:41,305 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 08:19:41,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable404 [2020-12-09 08:19:41,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:19:41 BoogieIcfgContainer [2020-12-09 08:19:41,327 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 08:19:41,328 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 08:19:41,328 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 08:19:41,328 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 08:19:41,328 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:13:44" (3/4) ... [2020-12-09 08:19:41,329 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 08:19:41,356 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_51c175e5-79e7-4e40-ab1a-a32c8d033250/bin/utaipan/witness.graphml [2020-12-09 08:19:41,356 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 08:19:41,357 INFO L168 Benchmark]: Toolchain (without parser) took 357427.58 ms. Allocated memory was 96.5 MB in the beginning and 906.0 MB in the end (delta: 809.5 MB). Free memory was 53.8 MB in the beginning and 397.3 MB in the end (delta: -343.5 MB). Peak memory consumption was 466.1 MB. Max. memory is 16.1 GB. [2020-12-09 08:19:41,357 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 96.5 MB. Free memory is still 71.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 08:19:41,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.33 ms. Allocated memory is still 96.5 MB. Free memory was 53.5 MB in the beginning and 55.5 MB in the end (delta: -2.0 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2020-12-09 08:19:41,357 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.93 ms. Allocated memory is still 96.5 MB. Free memory was 55.5 MB in the beginning and 53.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 08:19:41,357 INFO L168 Benchmark]: Boogie Preprocessor took 20.72 ms. Allocated memory is still 96.5 MB. Free memory was 53.6 MB in the beginning and 52.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 08:19:41,357 INFO L168 Benchmark]: RCFGBuilder took 282.91 ms. Allocated memory is still 96.5 MB. Free memory was 52.2 MB in the beginning and 53.7 MB in the end (delta: -1.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 08:19:41,357 INFO L168 Benchmark]: TraceAbstraction took 356779.24 ms. Allocated memory was 96.5 MB in the beginning and 906.0 MB in the end (delta: 809.5 MB). Free memory was 53.5 MB in the beginning and 400.4 MB in the end (delta: -346.9 MB). Peak memory consumption was 465.7 MB. Max. memory is 16.1 GB. [2020-12-09 08:19:41,357 INFO L168 Benchmark]: Witness Printer took 28.71 ms. Allocated memory is still 906.0 MB. Free memory was 399.4 MB in the beginning and 397.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 08:19:41,358 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 96.5 MB. Free memory is still 71.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 282.33 ms. Allocated memory is still 96.5 MB. Free memory was 53.5 MB in the beginning and 55.5 MB in the end (delta: -2.0 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 28.93 ms. Allocated memory is still 96.5 MB. Free memory was 55.5 MB in the beginning and 53.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.72 ms. Allocated memory is still 96.5 MB. Free memory was 53.6 MB in the beginning and 52.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 282.91 ms. Allocated memory is still 96.5 MB. Free memory was 52.2 MB in the beginning and 53.7 MB in the end (delta: -1.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 356779.24 ms. Allocated memory was 96.5 MB in the beginning and 906.0 MB in the end (delta: 809.5 MB). Free memory was 53.5 MB in the beginning and 400.4 MB in the end (delta: -346.9 MB). Peak memory consumption was 465.7 MB. Max. memory is 16.1 GB. * Witness Printer took 28.71 ms. Allocated memory is still 906.0 MB. Free memory was 399.4 MB in the beginning and 397.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 557]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) [L534] List t; [L535] List p = a; [L536] COND TRUE __VERIFIER_nondet_int() [L537] p->h = 1 [L538] t = (List) malloc(sizeof(struct node)) [L539] COND FALSE !(t == 0) [L540] p->n = t [L541] EXPR p->n [L541] p = p->n [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND TRUE __VERIFIER_nondet_int() [L544] p->h = 2 [L545] t = (List) malloc(sizeof(struct node)) [L546] COND FALSE !(t == 0) [L547] p->n = t [L548] EXPR p->n [L548] p = p->n [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 [L551] p = a [L552] EXPR p->h [L552] COND FALSE !(p->h == 2) [L554] EXPR p->h [L554] COND TRUE p->h == 1 [L555] EXPR p->n [L555] p = p->n [L554] EXPR p->h [L554] COND FALSE !(p->h == 1) [L556] EXPR p->h [L556] COND TRUE p->h != 3 [L557] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 356.7s, OverallIterations: 14, TraceHistogramMax: 3, AutomataDifference: 133.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 212 SDtfs, 827 SDslu, 1687 SDs, 0 SdLazy, 2620 SolverSat, 395 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 47.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 723 GetRequests, 252 SyntacticMatches, 49 SemanticMatches, 422 ConstructedPredicates, 41 IntricatePredicates, 0 DeprecatedPredicates, 4554 ImplicationChecksByTransitivity, 133.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 324 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 209.8s InterpolantComputationTime, 434 NumberOfCodeBlocks, 434 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 559 ConstructedInterpolants, 129 QuantifiedInterpolants, 228933 SizeOfPredicates, 168 NumberOfNonLiveVariables, 989 ConjunctsInSsa, 358 ConjunctsInUnsatCore, 31 InterpolantComputations, 4 PerfectInterpolantSequences, 17/154 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...