./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ffab8842-9e5e-4482-91f7-362b6405e781/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ffab8842-9e5e-4482-91f7-362b6405e781/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ffab8842-9e5e-4482-91f7-362b6405e781/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ffab8842-9e5e-4482-91f7-362b6405e781/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ffab8842-9e5e-4482-91f7-362b6405e781/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ffab8842-9e5e-4482-91f7-362b6405e781/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f7f00b8a2e26669f3416c65156e30bcc7eb97f9e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.1.23-635dfa2 [2018-12-02 03:38:15,326 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:38:15,327 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:38:15,333 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:38:15,333 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:38:15,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:38:15,334 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:38:15,335 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:38:15,335 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:38:15,336 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:38:15,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:38:15,336 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:38:15,337 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:38:15,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:38:15,338 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:38:15,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:38:15,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:38:15,339 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:38:15,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:38:15,341 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:38:15,341 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:38:15,342 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:38:15,343 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:38:15,343 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:38:15,343 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:38:15,344 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:38:15,344 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:38:15,345 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:38:15,345 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:38:15,346 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:38:15,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:38:15,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:38:15,346 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:38:15,346 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:38:15,347 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:38:15,347 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:38:15,347 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ffab8842-9e5e-4482-91f7-362b6405e781/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 03:38:15,355 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:38:15,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:38:15,355 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 03:38:15,355 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 03:38:15,356 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 03:38:15,356 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 03:38:15,356 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 03:38:15,356 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 03:38:15,356 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 03:38:15,356 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 03:38:15,356 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 03:38:15,356 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 03:38:15,357 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 03:38:15,357 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:38:15,357 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:38:15,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:38:15,357 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:38:15,358 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:38:15,358 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 03:38:15,358 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 03:38:15,358 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 03:38:15,358 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:38:15,358 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 03:38:15,358 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 03:38:15,358 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:38:15,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:38:15,359 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 03:38:15,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 03:38:15,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 03:38:15,359 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:38:15,359 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 03:38:15,359 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 03:38:15,359 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 03:38:15,360 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 03:38:15,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 03:38:15,360 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 03:38:15,360 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_ffab8842-9e5e-4482-91f7-362b6405e781/bin-2019/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(__VERIFIER_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 -> f7f00b8a2e26669f3416c65156e30bcc7eb97f9e [2018-12-02 03:38:15,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:38:15,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:38:15,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:38:15,391 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:38:15,391 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:38:15,391 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ffab8842-9e5e-4482-91f7-362b6405e781/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix041_rmo.opt_false-unreach-call.i [2018-12-02 03:38:15,433 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ffab8842-9e5e-4482-91f7-362b6405e781/bin-2019/utaipan/data/a7b1748dd/7ce34e72118d4054b4a29dd3a20c6f6d/FLAGb710e5d21 [2018-12-02 03:38:15,809 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:38:15,810 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ffab8842-9e5e-4482-91f7-362b6405e781/sv-benchmarks/c/pthread-wmm/mix041_rmo.opt_false-unreach-call.i [2018-12-02 03:38:15,817 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ffab8842-9e5e-4482-91f7-362b6405e781/bin-2019/utaipan/data/a7b1748dd/7ce34e72118d4054b4a29dd3a20c6f6d/FLAGb710e5d21 [2018-12-02 03:38:16,173 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ffab8842-9e5e-4482-91f7-362b6405e781/bin-2019/utaipan/data/a7b1748dd/7ce34e72118d4054b4a29dd3a20c6f6d [2018-12-02 03:38:16,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:38:16,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:38:16,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:38:16,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:38:16,185 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:38:16,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:38:16" (1/1) ... [2018-12-02 03:38:16,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e31f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:38:16, skipping insertion in model container [2018-12-02 03:38:16,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:38:16" (1/1) ... [2018-12-02 03:38:16,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:38:16,221 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:38:16,404 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:38:16,412 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:38:16,486 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:38:16,515 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:38:16,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:38:16 WrapperNode [2018-12-02 03:38:16,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:38:16,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 03:38:16,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 03:38:16,516 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 03:38:16,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:38:16" (1/1) ... [2018-12-02 03:38:16,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:38:16" (1/1) ... [2018-12-02 03:38:16,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 03:38:16,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:38:16,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:38:16,549 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:38:16,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:38:16" (1/1) ... [2018-12-02 03:38:16,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:38:16" (1/1) ... [2018-12-02 03:38:16,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:38:16" (1/1) ... [2018-12-02 03:38:16,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:38:16" (1/1) ... [2018-12-02 03:38:16,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:38:16" (1/1) ... [2018-12-02 03:38:16,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:38:16" (1/1) ... [2018-12-02 03:38:16,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:38:16" (1/1) ... [2018-12-02 03:38:16,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:38:16,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:38:16,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:38:16,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:38:16,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:38:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffab8842-9e5e-4482-91f7-362b6405e781/bin-2019/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 [2018-12-02 03:38:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 03:38:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 03:38:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 03:38:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 03:38:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 03:38:16,605 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 03:38:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 03:38:16,605 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 03:38:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 03:38:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:38:16,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:38:16,607 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 03:38:16,941 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:38:16,942 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 03:38:16,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:38:16 BoogieIcfgContainer [2018-12-02 03:38:16,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:38:16,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 03:38:16,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 03:38:16,945 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 03:38:16,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:38:16" (1/3) ... [2018-12-02 03:38:16,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd076e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:38:16, skipping insertion in model container [2018-12-02 03:38:16,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:38:16" (2/3) ... [2018-12-02 03:38:16,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd076e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:38:16, skipping insertion in model container [2018-12-02 03:38:16,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:38:16" (3/3) ... [2018-12-02 03:38:16,948 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_rmo.opt_false-unreach-call.i [2018-12-02 03:38:16,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,974 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,974 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,980 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,980 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,980 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,980 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,981 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:38:16,993 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 03:38:16,993 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 03:38:17,000 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 03:38:17,012 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 03:38:17,026 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 03:38:17,026 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 03:38:17,026 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 03:38:17,026 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 03:38:17,027 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 03:38:17,027 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 03:38:17,027 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 03:38:17,027 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 03:38:17,033 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-02 03:38:17,867 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-02 03:38:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-02 03:38:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 03:38:17,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:17,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:17,876 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:17,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:17,879 INFO L82 PathProgramCache]: Analyzing trace with hash 224065163, now seen corresponding path program 1 times [2018-12-02 03:38:17,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:17,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:17,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:17,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:17,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:18,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:18,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:38:18,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:18,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:38:18,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:38:18,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:38:18,028 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-02 03:38:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:18,400 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-02 03:38:18,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:38:18,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-02 03:38:18,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:18,536 INFO L225 Difference]: With dead ends: 45389 [2018-12-02 03:38:18,536 INFO L226 Difference]: Without dead ends: 40629 [2018-12-02 03:38:18,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:38:18,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-02 03:38:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-02 03:38:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-02 03:38:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-02 03:38:19,212 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-02 03:38:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:19,212 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-02 03:38:19,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:38:19,212 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-02 03:38:19,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 03:38:19,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:19,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:19,215 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:19,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:19,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2113194510, now seen corresponding path program 1 times [2018-12-02 03:38:19,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:19,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:19,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:19,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:19,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:19,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:19,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:38:19,253 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:19,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:38:19,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:38:19,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:38:19,254 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-02 03:38:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:19,395 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-02 03:38:19,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:38:19,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-02 03:38:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:19,535 INFO L225 Difference]: With dead ends: 23663 [2018-12-02 03:38:19,536 INFO L226 Difference]: Without dead ends: 23663 [2018-12-02 03:38:19,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:38:19,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-02 03:38:19,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-02 03:38:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-02 03:38:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-02 03:38:19,876 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-02 03:38:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:19,877 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-02 03:38:19,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:38:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-02 03:38:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 03:38:19,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:19,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:19,878 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:19,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:19,878 INFO L82 PathProgramCache]: Analyzing trace with hash 384821427, now seen corresponding path program 1 times [2018-12-02 03:38:19,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:19,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:19,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:19,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:19,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:19,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:19,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:38:19,938 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:19,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:38:19,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:38:19,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:38:19,939 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-02 03:38:20,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:20,516 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-02 03:38:20,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:38:20,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-02 03:38:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:20,642 INFO L225 Difference]: With dead ends: 64831 [2018-12-02 03:38:20,642 INFO L226 Difference]: Without dead ends: 64671 [2018-12-02 03:38:20,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:38:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-02 03:38:21,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-02 03:38:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-02 03:38:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-02 03:38:21,402 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-02 03:38:21,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:21,402 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-02 03:38:21,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:38:21,403 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-02 03:38:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 03:38:21,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:21,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:21,406 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:21,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:21,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1508997083, now seen corresponding path program 1 times [2018-12-02 03:38:21,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:21,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:21,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:21,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:21,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:21,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:21,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:38:21,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:21,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:38:21,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:38:21,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:38:21,445 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 3 states. [2018-12-02 03:38:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:21,606 INFO L93 Difference]: Finished difference Result 37143 states and 137892 transitions. [2018-12-02 03:38:21,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:38:21,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-02 03:38:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:21,664 INFO L225 Difference]: With dead ends: 37143 [2018-12-02 03:38:21,665 INFO L226 Difference]: Without dead ends: 37143 [2018-12-02 03:38:21,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:38:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37143 states. [2018-12-02 03:38:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37143 to 37143. [2018-12-02 03:38:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-02 03:38:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137892 transitions. [2018-12-02 03:38:22,298 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137892 transitions. Word has length 46 [2018-12-02 03:38:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:22,299 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137892 transitions. [2018-12-02 03:38:22,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:38:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137892 transitions. [2018-12-02 03:38:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 03:38:22,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:22,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:22,301 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:22,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:22,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1043159878, now seen corresponding path program 1 times [2018-12-02 03:38:22,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:22,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:22,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:22,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:22,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:22,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:22,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:38:22,331 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:22,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:38:22,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:38:22,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:38:22,332 INFO L87 Difference]: Start difference. First operand 37143 states and 137892 transitions. Second operand 5 states. [2018-12-02 03:38:22,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:22,712 INFO L93 Difference]: Finished difference Result 66627 states and 246193 transitions. [2018-12-02 03:38:22,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:38:22,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 03:38:22,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:22,822 INFO L225 Difference]: With dead ends: 66627 [2018-12-02 03:38:22,822 INFO L226 Difference]: Without dead ends: 66459 [2018-12-02 03:38:22,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:38:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2018-12-02 03:38:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2018-12-02 03:38:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-02 03:38:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143650 transitions. [2018-12-02 03:38:23,615 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143650 transitions. Word has length 46 [2018-12-02 03:38:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:23,615 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143650 transitions. [2018-12-02 03:38:23,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:38:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143650 transitions. [2018-12-02 03:38:23,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 03:38:23,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:23,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:23,621 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:23,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:23,621 INFO L82 PathProgramCache]: Analyzing trace with hash 897528764, now seen corresponding path program 1 times [2018-12-02 03:38:23,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:23,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:23,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:23,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:23,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:23,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:23,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:38:23,653 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:23,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:38:23,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:38:23,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:38:23,653 INFO L87 Difference]: Start difference. First operand 38835 states and 143650 transitions. Second operand 4 states. [2018-12-02 03:38:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:23,706 INFO L93 Difference]: Finished difference Result 14217 states and 47061 transitions. [2018-12-02 03:38:23,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:38:23,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-02 03:38:23,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:23,723 INFO L225 Difference]: With dead ends: 14217 [2018-12-02 03:38:23,724 INFO L226 Difference]: Without dead ends: 13696 [2018-12-02 03:38:23,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:38:23,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13696 states. [2018-12-02 03:38:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13696 to 13696. [2018-12-02 03:38:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13696 states. [2018-12-02 03:38:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13696 states to 13696 states and 45509 transitions. [2018-12-02 03:38:23,868 INFO L78 Accepts]: Start accepts. Automaton has 13696 states and 45509 transitions. Word has length 53 [2018-12-02 03:38:23,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:23,868 INFO L480 AbstractCegarLoop]: Abstraction has 13696 states and 45509 transitions. [2018-12-02 03:38:23,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:38:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 13696 states and 45509 transitions. [2018-12-02 03:38:23,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 03:38:23,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:23,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:23,871 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:23,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:23,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1116900446, now seen corresponding path program 1 times [2018-12-02 03:38:23,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:23,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:23,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:23,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:23,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:23,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:23,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:38:23,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:23,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:38:23,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:38:23,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:38:23,920 INFO L87 Difference]: Start difference. First operand 13696 states and 45509 transitions. Second operand 4 states. [2018-12-02 03:38:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:24,071 INFO L93 Difference]: Finished difference Result 19084 states and 62264 transitions. [2018-12-02 03:38:24,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:38:24,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-02 03:38:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:24,093 INFO L225 Difference]: With dead ends: 19084 [2018-12-02 03:38:24,093 INFO L226 Difference]: Without dead ends: 19084 [2018-12-02 03:38:24,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:38:24,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19084 states. [2018-12-02 03:38:24,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19084 to 14780. [2018-12-02 03:38:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14780 states. [2018-12-02 03:38:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14780 states to 14780 states and 48764 transitions. [2018-12-02 03:38:24,266 INFO L78 Accepts]: Start accepts. Automaton has 14780 states and 48764 transitions. Word has length 59 [2018-12-02 03:38:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:24,267 INFO L480 AbstractCegarLoop]: Abstraction has 14780 states and 48764 transitions. [2018-12-02 03:38:24,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:38:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 14780 states and 48764 transitions. [2018-12-02 03:38:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 03:38:24,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:24,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:24,270 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:24,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:24,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1435256515, now seen corresponding path program 1 times [2018-12-02 03:38:24,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:24,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:24,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:24,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:24,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:24,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:24,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:38:24,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:24,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:38:24,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:38:24,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:38:24,308 INFO L87 Difference]: Start difference. First operand 14780 states and 48764 transitions. Second operand 4 states. [2018-12-02 03:38:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:24,649 INFO L93 Difference]: Finished difference Result 20683 states and 67222 transitions. [2018-12-02 03:38:24,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:38:24,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-02 03:38:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:24,672 INFO L225 Difference]: With dead ends: 20683 [2018-12-02 03:38:24,673 INFO L226 Difference]: Without dead ends: 20683 [2018-12-02 03:38:24,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:38:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20683 states. [2018-12-02 03:38:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20683 to 18616. [2018-12-02 03:38:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18616 states. [2018-12-02 03:38:24,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18616 states to 18616 states and 60973 transitions. [2018-12-02 03:38:24,873 INFO L78 Accepts]: Start accepts. Automaton has 18616 states and 60973 transitions. Word has length 59 [2018-12-02 03:38:24,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:24,873 INFO L480 AbstractCegarLoop]: Abstraction has 18616 states and 60973 transitions. [2018-12-02 03:38:24,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:38:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 18616 states and 60973 transitions. [2018-12-02 03:38:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 03:38:24,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:24,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:24,877 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:24,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:24,877 INFO L82 PathProgramCache]: Analyzing trace with hash -81946818, now seen corresponding path program 1 times [2018-12-02 03:38:24,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:24,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:24,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:24,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:24,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:24,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:24,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:38:24,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:24,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:38:24,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:38:24,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:38:24,923 INFO L87 Difference]: Start difference. First operand 18616 states and 60973 transitions. Second operand 6 states. [2018-12-02 03:38:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:25,231 INFO L93 Difference]: Finished difference Result 24160 states and 78371 transitions. [2018-12-02 03:38:25,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 03:38:25,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-02 03:38:25,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:25,259 INFO L225 Difference]: With dead ends: 24160 [2018-12-02 03:38:25,259 INFO L226 Difference]: Without dead ends: 24128 [2018-12-02 03:38:25,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-02 03:38:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24128 states. [2018-12-02 03:38:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24128 to 18248. [2018-12-02 03:38:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18248 states. [2018-12-02 03:38:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18248 states to 18248 states and 59757 transitions. [2018-12-02 03:38:25,489 INFO L78 Accepts]: Start accepts. Automaton has 18248 states and 59757 transitions. Word has length 59 [2018-12-02 03:38:25,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:25,489 INFO L480 AbstractCegarLoop]: Abstraction has 18248 states and 59757 transitions. [2018-12-02 03:38:25,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:38:25,489 INFO L276 IsEmpty]: Start isEmpty. Operand 18248 states and 59757 transitions. [2018-12-02 03:38:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 03:38:25,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:25,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:25,499 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:25,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:25,499 INFO L82 PathProgramCache]: Analyzing trace with hash 249431144, now seen corresponding path program 1 times [2018-12-02 03:38:25,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:25,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:25,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:25,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:25,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:25,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:25,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:38:25,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:25,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:38:25,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:38:25,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:38:25,546 INFO L87 Difference]: Start difference. First operand 18248 states and 59757 transitions. Second operand 4 states. [2018-12-02 03:38:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:25,849 INFO L93 Difference]: Finished difference Result 29316 states and 94246 transitions. [2018-12-02 03:38:25,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:38:25,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-02 03:38:25,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:25,885 INFO L225 Difference]: With dead ends: 29316 [2018-12-02 03:38:25,885 INFO L226 Difference]: Without dead ends: 29120 [2018-12-02 03:38:25,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:38:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29120 states. [2018-12-02 03:38:26,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29120 to 24768. [2018-12-02 03:38:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24768 states. [2018-12-02 03:38:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24768 states to 24768 states and 80579 transitions. [2018-12-02 03:38:26,189 INFO L78 Accepts]: Start accepts. Automaton has 24768 states and 80579 transitions. Word has length 73 [2018-12-02 03:38:26,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:26,189 INFO L480 AbstractCegarLoop]: Abstraction has 24768 states and 80579 transitions. [2018-12-02 03:38:26,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:38:26,189 INFO L276 IsEmpty]: Start isEmpty. Operand 24768 states and 80579 transitions. [2018-12-02 03:38:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 03:38:26,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:26,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:26,203 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:26,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:26,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1602740841, now seen corresponding path program 1 times [2018-12-02 03:38:26,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:26,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:26,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:26,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:26,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:26,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:26,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:38:26,232 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:26,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:38:26,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:38:26,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:38:26,232 INFO L87 Difference]: Start difference. First operand 24768 states and 80579 transitions. Second operand 5 states. [2018-12-02 03:38:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:26,259 INFO L93 Difference]: Finished difference Result 3748 states and 9938 transitions. [2018-12-02 03:38:26,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:38:26,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-02 03:38:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:26,262 INFO L225 Difference]: With dead ends: 3748 [2018-12-02 03:38:26,262 INFO L226 Difference]: Without dead ends: 3248 [2018-12-02 03:38:26,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:38:26,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2018-12-02 03:38:26,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 3141. [2018-12-02 03:38:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2018-12-02 03:38:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 8313 transitions. [2018-12-02 03:38:26,286 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 8313 transitions. Word has length 73 [2018-12-02 03:38:26,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:26,286 INFO L480 AbstractCegarLoop]: Abstraction has 3141 states and 8313 transitions. [2018-12-02 03:38:26,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:38:26,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 8313 transitions. [2018-12-02 03:38:26,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 03:38:26,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:26,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:26,289 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:26,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:26,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1291396420, now seen corresponding path program 1 times [2018-12-02 03:38:26,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:26,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:26,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:26,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:26,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:26,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:26,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:38:26,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:26,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:38:26,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:38:26,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:38:26,328 INFO L87 Difference]: Start difference. First operand 3141 states and 8313 transitions. Second operand 4 states. [2018-12-02 03:38:26,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:26,412 INFO L93 Difference]: Finished difference Result 3727 states and 9684 transitions. [2018-12-02 03:38:26,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:38:26,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 03:38:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:26,416 INFO L225 Difference]: With dead ends: 3727 [2018-12-02 03:38:26,416 INFO L226 Difference]: Without dead ends: 3699 [2018-12-02 03:38:26,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:38:26,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3699 states. [2018-12-02 03:38:26,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3699 to 3646. [2018-12-02 03:38:26,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3646 states. [2018-12-02 03:38:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 3646 states and 9520 transitions. [2018-12-02 03:38:26,442 INFO L78 Accepts]: Start accepts. Automaton has 3646 states and 9520 transitions. Word has length 92 [2018-12-02 03:38:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:26,442 INFO L480 AbstractCegarLoop]: Abstraction has 3646 states and 9520 transitions. [2018-12-02 03:38:26,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:38:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3646 states and 9520 transitions. [2018-12-02 03:38:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 03:38:26,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:26,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:26,445 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:26,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:26,445 INFO L82 PathProgramCache]: Analyzing trace with hash -2033989853, now seen corresponding path program 1 times [2018-12-02 03:38:26,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:26,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:26,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:26,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:26,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:26,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:26,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:38:26,480 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:26,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:38:26,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:38:26,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:38:26,481 INFO L87 Difference]: Start difference. First operand 3646 states and 9520 transitions. Second operand 4 states. [2018-12-02 03:38:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:26,611 INFO L93 Difference]: Finished difference Result 4650 states and 12206 transitions. [2018-12-02 03:38:26,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:38:26,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 03:38:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:26,614 INFO L225 Difference]: With dead ends: 4650 [2018-12-02 03:38:26,614 INFO L226 Difference]: Without dead ends: 4650 [2018-12-02 03:38:26,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:38:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2018-12-02 03:38:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 3527. [2018-12-02 03:38:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3527 states. [2018-12-02 03:38:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 9165 transitions. [2018-12-02 03:38:26,641 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 9165 transitions. Word has length 92 [2018-12-02 03:38:26,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:26,642 INFO L480 AbstractCegarLoop]: Abstraction has 3527 states and 9165 transitions. [2018-12-02 03:38:26,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:38:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 9165 transitions. [2018-12-02 03:38:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 03:38:26,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:26,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:26,645 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:26,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1525134517, now seen corresponding path program 2 times [2018-12-02 03:38:26,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:26,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:26,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:26,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:26,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:26,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:26,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:38:26,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:26,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:38:26,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:38:26,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:38:26,694 INFO L87 Difference]: Start difference. First operand 3527 states and 9165 transitions. Second operand 5 states. [2018-12-02 03:38:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:26,828 INFO L93 Difference]: Finished difference Result 4013 states and 10322 transitions. [2018-12-02 03:38:26,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:38:26,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-02 03:38:26,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:26,831 INFO L225 Difference]: With dead ends: 4013 [2018-12-02 03:38:26,831 INFO L226 Difference]: Without dead ends: 3985 [2018-12-02 03:38:26,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:38:26,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2018-12-02 03:38:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3532. [2018-12-02 03:38:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3532 states. [2018-12-02 03:38:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 9167 transitions. [2018-12-02 03:38:26,857 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 9167 transitions. Word has length 92 [2018-12-02 03:38:26,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:26,857 INFO L480 AbstractCegarLoop]: Abstraction has 3532 states and 9167 transitions. [2018-12-02 03:38:26,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:38:26,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 9167 transitions. [2018-12-02 03:38:26,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 03:38:26,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:26,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:26,860 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:26,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:26,860 INFO L82 PathProgramCache]: Analyzing trace with hash -979424162, now seen corresponding path program 1 times [2018-12-02 03:38:26,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:26,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:26,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:38:26,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:26,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:26,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:26,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:38:26,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:26,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:38:26,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:38:26,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:38:26,888 INFO L87 Difference]: Start difference. First operand 3532 states and 9167 transitions. Second operand 4 states. [2018-12-02 03:38:26,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:26,962 INFO L93 Difference]: Finished difference Result 6717 states and 17595 transitions. [2018-12-02 03:38:26,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:38:26,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 03:38:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:26,967 INFO L225 Difference]: With dead ends: 6717 [2018-12-02 03:38:26,968 INFO L226 Difference]: Without dead ends: 6689 [2018-12-02 03:38:26,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:38:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6689 states. [2018-12-02 03:38:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6689 to 3454. [2018-12-02 03:38:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3454 states. [2018-12-02 03:38:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 8931 transitions. [2018-12-02 03:38:27,002 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 8931 transitions. Word has length 94 [2018-12-02 03:38:27,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:27,003 INFO L480 AbstractCegarLoop]: Abstraction has 3454 states and 8931 transitions. [2018-12-02 03:38:27,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:38:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 8931 transitions. [2018-12-02 03:38:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 03:38:27,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:27,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:27,005 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:27,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash 482155837, now seen corresponding path program 1 times [2018-12-02 03:38:27,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:27,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:27,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:27,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:27,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:27,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:27,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:38:27,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:27,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:38:27,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:38:27,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:38:27,071 INFO L87 Difference]: Start difference. First operand 3454 states and 8931 transitions. Second operand 6 states. [2018-12-02 03:38:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:27,276 INFO L93 Difference]: Finished difference Result 3807 states and 9607 transitions. [2018-12-02 03:38:27,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:38:27,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 03:38:27,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:27,279 INFO L225 Difference]: With dead ends: 3807 [2018-12-02 03:38:27,279 INFO L226 Difference]: Without dead ends: 3697 [2018-12-02 03:38:27,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:38:27,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2018-12-02 03:38:27,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3608. [2018-12-02 03:38:27,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3608 states. [2018-12-02 03:38:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 9227 transitions. [2018-12-02 03:38:27,304 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 9227 transitions. Word has length 94 [2018-12-02 03:38:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:27,304 INFO L480 AbstractCegarLoop]: Abstraction has 3608 states and 9227 transitions. [2018-12-02 03:38:27,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:38:27,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 9227 transitions. [2018-12-02 03:38:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 03:38:27,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:27,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:27,307 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:27,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2112070980, now seen corresponding path program 1 times [2018-12-02 03:38:27,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:27,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:27,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:27,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:27,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:27,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:27,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:27,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:38:27,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:27,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:38:27,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:38:27,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:38:27,368 INFO L87 Difference]: Start difference. First operand 3608 states and 9227 transitions. Second operand 7 states. [2018-12-02 03:38:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:27,553 INFO L93 Difference]: Finished difference Result 3885 states and 9919 transitions. [2018-12-02 03:38:27,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:38:27,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 03:38:27,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:27,556 INFO L225 Difference]: With dead ends: 3885 [2018-12-02 03:38:27,556 INFO L226 Difference]: Without dead ends: 3885 [2018-12-02 03:38:27,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:38:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2018-12-02 03:38:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 3585. [2018-12-02 03:38:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3585 states. [2018-12-02 03:38:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 9183 transitions. [2018-12-02 03:38:27,591 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 9183 transitions. Word has length 94 [2018-12-02 03:38:27,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:27,591 INFO L480 AbstractCegarLoop]: Abstraction has 3585 states and 9183 transitions. [2018-12-02 03:38:27,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:38:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 9183 transitions. [2018-12-02 03:38:27,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 03:38:27,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:27,594 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:27,594 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:27,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:27,594 INFO L82 PathProgramCache]: Analyzing trace with hash -701191460, now seen corresponding path program 1 times [2018-12-02 03:38:27,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:27,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:27,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:27,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:27,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:27,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:27,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:38:27,656 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:27,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:38:27,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:38:27,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:38:27,656 INFO L87 Difference]: Start difference. First operand 3585 states and 9183 transitions. Second operand 5 states. [2018-12-02 03:38:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:27,724 INFO L93 Difference]: Finished difference Result 3191 states and 8207 transitions. [2018-12-02 03:38:27,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:38:27,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 03:38:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:27,727 INFO L225 Difference]: With dead ends: 3191 [2018-12-02 03:38:27,727 INFO L226 Difference]: Without dead ends: 3191 [2018-12-02 03:38:27,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:38:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3191 states. [2018-12-02 03:38:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3191 to 3103. [2018-12-02 03:38:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3103 states. [2018-12-02 03:38:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 8024 transitions. [2018-12-02 03:38:27,749 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 8024 transitions. Word has length 94 [2018-12-02 03:38:27,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:27,749 INFO L480 AbstractCegarLoop]: Abstraction has 3103 states and 8024 transitions. [2018-12-02 03:38:27,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:38:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 8024 transitions. [2018-12-02 03:38:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 03:38:27,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:27,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:27,752 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:27,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:27,753 INFO L82 PathProgramCache]: Analyzing trace with hash -153509389, now seen corresponding path program 1 times [2018-12-02 03:38:27,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:27,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:27,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:27,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:27,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:27,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:27,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:38:27,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:27,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:38:27,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:38:27,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:38:27,785 INFO L87 Difference]: Start difference. First operand 3103 states and 8024 transitions. Second operand 5 states. [2018-12-02 03:38:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:27,897 INFO L93 Difference]: Finished difference Result 5807 states and 15294 transitions. [2018-12-02 03:38:27,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:38:27,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 03:38:27,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:27,902 INFO L225 Difference]: With dead ends: 5807 [2018-12-02 03:38:27,902 INFO L226 Difference]: Without dead ends: 5807 [2018-12-02 03:38:27,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:38:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5807 states. [2018-12-02 03:38:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5807 to 3139. [2018-12-02 03:38:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2018-12-02 03:38:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 8104 transitions. [2018-12-02 03:38:27,931 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 8104 transitions. Word has length 94 [2018-12-02 03:38:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:27,932 INFO L480 AbstractCegarLoop]: Abstraction has 3139 states and 8104 transitions. [2018-12-02 03:38:27,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:38:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 8104 transitions. [2018-12-02 03:38:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 03:38:27,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:27,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:27,934 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:27,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:27,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1782150898, now seen corresponding path program 1 times [2018-12-02 03:38:27,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:27,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:27,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:27,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:27,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:28,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:28,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:38:28,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:28,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:38:28,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:38:28,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:38:28,001 INFO L87 Difference]: Start difference. First operand 3139 states and 8104 transitions. Second operand 6 states. [2018-12-02 03:38:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:28,079 INFO L93 Difference]: Finished difference Result 2899 states and 7344 transitions. [2018-12-02 03:38:28,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:38:28,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 03:38:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:28,081 INFO L225 Difference]: With dead ends: 2899 [2018-12-02 03:38:28,081 INFO L226 Difference]: Without dead ends: 2899 [2018-12-02 03:38:28,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:38:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2018-12-02 03:38:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2546. [2018-12-02 03:38:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2546 states. [2018-12-02 03:38:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 6508 transitions. [2018-12-02 03:38:28,099 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 6508 transitions. Word has length 94 [2018-12-02 03:38:28,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:28,099 INFO L480 AbstractCegarLoop]: Abstraction has 2546 states and 6508 transitions. [2018-12-02 03:38:28,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:38:28,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 6508 transitions. [2018-12-02 03:38:28,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 03:38:28,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:28,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:28,101 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:28,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:28,101 INFO L82 PathProgramCache]: Analyzing trace with hash -671890958, now seen corresponding path program 1 times [2018-12-02 03:38:28,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:28,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:28,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:28,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:28,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:28,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:28,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:38:28,152 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:28,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:38:28,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:38:28,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:38:28,152 INFO L87 Difference]: Start difference. First operand 2546 states and 6508 transitions. Second operand 6 states. [2018-12-02 03:38:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:28,194 INFO L93 Difference]: Finished difference Result 2672 states and 6722 transitions. [2018-12-02 03:38:28,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:38:28,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 03:38:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:28,196 INFO L225 Difference]: With dead ends: 2672 [2018-12-02 03:38:28,196 INFO L226 Difference]: Without dead ends: 2636 [2018-12-02 03:38:28,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:38:28,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2018-12-02 03:38:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2495. [2018-12-02 03:38:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2018-12-02 03:38:28,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 6373 transitions. [2018-12-02 03:38:28,213 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 6373 transitions. Word has length 96 [2018-12-02 03:38:28,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:28,213 INFO L480 AbstractCegarLoop]: Abstraction has 2495 states and 6373 transitions. [2018-12-02 03:38:28,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:38:28,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 6373 transitions. [2018-12-02 03:38:28,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 03:38:28,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:28,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:28,215 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:28,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:28,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1687416051, now seen corresponding path program 1 times [2018-12-02 03:38:28,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:28,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:28,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:28,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:28,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:28,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:28,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:38:28,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:28,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:38:28,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:38:28,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:38:28,263 INFO L87 Difference]: Start difference. First operand 2495 states and 6373 transitions. Second operand 5 states. [2018-12-02 03:38:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:28,374 INFO L93 Difference]: Finished difference Result 2847 states and 7237 transitions. [2018-12-02 03:38:28,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:38:28,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 03:38:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:28,377 INFO L225 Difference]: With dead ends: 2847 [2018-12-02 03:38:28,377 INFO L226 Difference]: Without dead ends: 2815 [2018-12-02 03:38:28,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:38:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2018-12-02 03:38:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2543. [2018-12-02 03:38:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2543 states. [2018-12-02 03:38:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 6477 transitions. [2018-12-02 03:38:28,397 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 6477 transitions. Word has length 96 [2018-12-02 03:38:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:28,397 INFO L480 AbstractCegarLoop]: Abstraction has 2543 states and 6477 transitions. [2018-12-02 03:38:28,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:38:28,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 6477 transitions. [2018-12-02 03:38:28,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 03:38:28,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:28,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:28,399 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:28,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1362786764, now seen corresponding path program 1 times [2018-12-02 03:38:28,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:28,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:28,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:28,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:28,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:38:28,454 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:28,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:38:28,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:38:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:38:28,455 INFO L87 Difference]: Start difference. First operand 2543 states and 6477 transitions. Second operand 5 states. [2018-12-02 03:38:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:28,475 INFO L93 Difference]: Finished difference Result 4047 states and 10518 transitions. [2018-12-02 03:38:28,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:38:28,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 03:38:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:28,478 INFO L225 Difference]: With dead ends: 4047 [2018-12-02 03:38:28,478 INFO L226 Difference]: Without dead ends: 4047 [2018-12-02 03:38:28,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:38:28,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4047 states. [2018-12-02 03:38:28,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4047 to 2519. [2018-12-02 03:38:28,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2519 states. [2018-12-02 03:38:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 6370 transitions. [2018-12-02 03:38:28,500 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 6370 transitions. Word has length 96 [2018-12-02 03:38:28,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:28,500 INFO L480 AbstractCegarLoop]: Abstraction has 2519 states and 6370 transitions. [2018-12-02 03:38:28,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:38:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 6370 transitions. [2018-12-02 03:38:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 03:38:28,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:28,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:28,502 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:28,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:28,502 INFO L82 PathProgramCache]: Analyzing trace with hash -393205741, now seen corresponding path program 1 times [2018-12-02 03:38:28,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:28,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:28,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:28,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:28,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:28,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:28,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 03:38:28,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:28,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 03:38:28,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 03:38:28,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:38:28,577 INFO L87 Difference]: Start difference. First operand 2519 states and 6370 transitions. Second operand 9 states. [2018-12-02 03:38:28,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:28,672 INFO L93 Difference]: Finished difference Result 4226 states and 10894 transitions. [2018-12-02 03:38:28,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 03:38:28,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-02 03:38:28,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:28,673 INFO L225 Difference]: With dead ends: 4226 [2018-12-02 03:38:28,673 INFO L226 Difference]: Without dead ends: 1791 [2018-12-02 03:38:28,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-02 03:38:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2018-12-02 03:38:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1791. [2018-12-02 03:38:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2018-12-02 03:38:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 4670 transitions. [2018-12-02 03:38:28,685 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 4670 transitions. Word has length 96 [2018-12-02 03:38:28,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:28,685 INFO L480 AbstractCegarLoop]: Abstraction has 1791 states and 4670 transitions. [2018-12-02 03:38:28,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 03:38:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 4670 transitions. [2018-12-02 03:38:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 03:38:28,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:28,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:28,687 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:28,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:28,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1013415039, now seen corresponding path program 2 times [2018-12-02 03:38:28,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:28,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:28,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:38:28,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:28,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:38:28,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:38:28,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:38:28,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 03:38:28,793 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:38:28,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 03:38:28,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 03:38:28,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 03:38:28,794 INFO L87 Difference]: Start difference. First operand 1791 states and 4670 transitions. Second operand 12 states. [2018-12-02 03:38:29,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:38:29,162 INFO L93 Difference]: Finished difference Result 3398 states and 8960 transitions. [2018-12-02 03:38:29,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 03:38:29,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-02 03:38:29,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:38:29,164 INFO L225 Difference]: With dead ends: 3398 [2018-12-02 03:38:29,164 INFO L226 Difference]: Without dead ends: 2422 [2018-12-02 03:38:29,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-02 03:38:29,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2018-12-02 03:38:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2270. [2018-12-02 03:38:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2018-12-02 03:38:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 5784 transitions. [2018-12-02 03:38:29,180 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 5784 transitions. Word has length 96 [2018-12-02 03:38:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:38:29,180 INFO L480 AbstractCegarLoop]: Abstraction has 2270 states and 5784 transitions. [2018-12-02 03:38:29,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 03:38:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 5784 transitions. [2018-12-02 03:38:29,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 03:38:29,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:38:29,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:38:29,182 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:38:29,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:38:29,182 INFO L82 PathProgramCache]: Analyzing trace with hash -2137183355, now seen corresponding path program 3 times [2018-12-02 03:38:29,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:38:29,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:29,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:38:29,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:38:29,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:38:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:38:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:38:29,238 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 03:38:29,323 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 03:38:29,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:38:29 BasicIcfg [2018-12-02 03:38:29,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 03:38:29,325 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 03:38:29,325 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 03:38:29,325 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 03:38:29,325 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:38:16" (3/4) ... [2018-12-02 03:38:29,327 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 03:38:29,412 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ffab8842-9e5e-4482-91f7-362b6405e781/bin-2019/utaipan/witness.graphml [2018-12-02 03:38:29,412 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 03:38:29,413 INFO L168 Benchmark]: Toolchain (without parser) took 13236.04 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 949.5 MB in the beginning and 1.8 GB in the end (delta: -853.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-02 03:38:29,414 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:38:29,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2018-12-02 03:38:29,415 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:38:29,415 INFO L168 Benchmark]: Boogie Preprocessor took 21.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:38:29,415 INFO L168 Benchmark]: RCFGBuilder took 371.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2018-12-02 03:38:29,416 INFO L168 Benchmark]: TraceAbstraction took 12381.62 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -801.8 MB). Peak memory consumption was 985.0 MB. Max. memory is 11.5 GB. [2018-12-02 03:38:29,416 INFO L168 Benchmark]: Witness Printer took 87.89 ms. Allocated memory is still 2.9 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:38:29,417 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 371.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12381.62 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -801.8 MB). Peak memory consumption was 985.0 MB. Max. memory is 11.5 GB. * Witness Printer took 87.89 ms. Allocated memory is still 2.9 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] -1 pthread_t t1101; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1101, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] -1 pthread_t t1102; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1102, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L723] 0 x$w_buff1 = x$w_buff0 [L724] 0 x$w_buff0 = 2 [L725] 0 x$w_buff1_used = x$w_buff0_used [L726] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L728] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L729] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L730] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L731] 0 x$r_buff0_thd2 = (_Bool)1 [L734] 0 y = 1 [L737] 0 __unbuffered_p1_EAX = y [L740] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L703] 1 z = 1 [L706] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L709] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L710] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L712] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L712] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L713] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L713] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L776] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L778] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 x$flush_delayed = weak$$choice2 [L784] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L786] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L788] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] -1 x = x$flush_delayed ? x$mem_tmp : x [L794] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 12.3s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5680 SDtfs, 5267 SDslu, 11046 SDs, 0 SdLazy, 3840 SolverSat, 266 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 71 SyntacticMatches, 15 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38835occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 99283 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2012 NumberOfCodeBlocks, 2012 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1891 ConstructedInterpolants, 0 QuantifiedInterpolants, 360931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...