./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc_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_6c020fcc-d88d-4d8a-b5da-3182e2466959/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c020fcc-d88d-4d8a-b5da-3182e2466959/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c020fcc-d88d-4d8a-b5da-3182e2466959/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c020fcc-d88d-4d8a-b5da-3182e2466959/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6c020fcc-d88d-4d8a-b5da-3182e2466959/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c020fcc-d88d-4d8a-b5da-3182e2466959/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 63a54ca8657aa4e3c30e7aab69439afef5cd6bf9 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 12:32:07,673 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:32:07,674 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:32:07,680 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:32:07,680 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:32:07,680 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:32:07,681 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:32:07,682 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:32:07,683 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:32:07,683 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:32:07,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:32:07,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:32:07,684 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:32:07,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:32:07,685 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:32:07,685 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:32:07,686 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:32:07,687 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:32:07,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:32:07,688 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:32:07,689 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:32:07,689 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:32:07,691 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:32:07,691 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:32:07,691 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:32:07,691 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:32:07,692 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:32:07,692 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:32:07,693 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:32:07,693 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:32:07,693 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:32:07,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:32:07,694 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:32:07,694 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:32:07,694 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:32:07,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:32:07,695 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c020fcc-d88d-4d8a-b5da-3182e2466959/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 12:32:07,702 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:32:07,702 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:32:07,703 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:32:07,703 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:32:07,703 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 12:32:07,703 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 12:32:07,703 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 12:32:07,703 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:32:07,703 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:32:07,704 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:32:07,704 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:32:07,704 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:32:07,704 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:32:07,704 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:32:07,704 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:32:07,704 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:32:07,704 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:32:07,704 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 12:32:07,704 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:32:07,704 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:32:07,705 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:32:07,705 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:32:07,705 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:32:07,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:32:07,705 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:32:07,705 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:32:07,705 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:32:07,705 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 12:32:07,705 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:32:07,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:32:07,705 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_6c020fcc-d88d-4d8a-b5da-3182e2466959/bin-2019/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 63a54ca8657aa4e3c30e7aab69439afef5cd6bf9 [2018-12-09 12:32:07,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:32:07,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:32:07,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:32:07,732 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:32:07,733 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:32:07,733 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c020fcc-d88d-4d8a-b5da-3182e2466959/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc_false-unreach-call.i [2018-12-09 12:32:07,768 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c020fcc-d88d-4d8a-b5da-3182e2466959/bin-2019/uautomizer/data/8d0fcfead/f7a91a7c2a374bf4855c8096619a01cd/FLAG787e6707b [2018-12-09 12:32:08,214 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:32:08,214 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c020fcc-d88d-4d8a-b5da-3182e2466959/sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc_false-unreach-call.i [2018-12-09 12:32:08,222 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c020fcc-d88d-4d8a-b5da-3182e2466959/bin-2019/uautomizer/data/8d0fcfead/f7a91a7c2a374bf4855c8096619a01cd/FLAG787e6707b [2018-12-09 12:32:08,231 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c020fcc-d88d-4d8a-b5da-3182e2466959/bin-2019/uautomizer/data/8d0fcfead/f7a91a7c2a374bf4855c8096619a01cd [2018-12-09 12:32:08,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:32:08,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:32:08,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:32:08,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:32:08,236 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:32:08,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:32:08" (1/1) ... [2018-12-09 12:32:08,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:08, skipping insertion in model container [2018-12-09 12:32:08,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:32:08" (1/1) ... [2018-12-09 12:32:08,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:32:08,264 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:32:08,446 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:32:08,454 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:32:08,525 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:32:08,553 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:32:08,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:08 WrapperNode [2018-12-09 12:32:08,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:32:08,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:32:08,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:32:08,554 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:32:08,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:08" (1/1) ... [2018-12-09 12:32:08,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:08" (1/1) ... [2018-12-09 12:32:08,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:32:08,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:32:08,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:32:08,585 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:32:08,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:08" (1/1) ... [2018-12-09 12:32:08,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:08" (1/1) ... [2018-12-09 12:32:08,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:08" (1/1) ... [2018-12-09 12:32:08,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:08" (1/1) ... [2018-12-09 12:32:08,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:08" (1/1) ... [2018-12-09 12:32:08,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:08" (1/1) ... [2018-12-09 12:32:08,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:08" (1/1) ... [2018-12-09 12:32:08,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:32:08,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:32:08,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:32:08,603 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:32:08,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c020fcc-d88d-4d8a-b5da-3182e2466959/bin-2019/uautomizer/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-09 12:32:08,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:32:08,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 12:32:08,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 12:32:08,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 12:32:08,635 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 12:32:08,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 12:32:08,635 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 12:32:08,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 12:32:08,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 12:32:08,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:32:08,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:32:08,636 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 12:32:08,908 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:32:08,908 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 12:32:08,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:32:08 BoogieIcfgContainer [2018-12-09 12:32:08,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:32:08,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:32:08,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:32:08,911 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:32:08,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:32:08" (1/3) ... [2018-12-09 12:32:08,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bf0a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:32:08, skipping insertion in model container [2018-12-09 12:32:08,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:08" (2/3) ... [2018-12-09 12:32:08,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bf0a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:32:08, skipping insertion in model container [2018-12-09 12:32:08,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:32:08" (3/3) ... [2018-12-09 12:32:08,913 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_rmo.oepc_false-unreach-call.i [2018-12-09 12:32:08,935 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,935 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,936 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,936 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,936 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,936 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,936 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,936 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,936 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,936 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,936 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,940 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,940 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:32:08,955 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 12:32:08,955 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:32:08,960 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 12:32:08,969 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 12:32:08,983 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 12:32:08,983 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:32:08,984 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 12:32:08,984 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:32:08,984 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:32:08,984 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:32:08,984 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:32:08,984 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:32:08,984 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:32:08,990 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-09 12:32:10,561 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-09 12:32:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-09 12:32:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 12:32:10,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:10,567 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] [2018-12-09 12:32:10,568 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:10,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash 375373260, now seen corresponding path program 1 times [2018-12-09 12:32:10,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:10,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:10,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:10,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:10,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:10,706 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-09 12:32:10,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:10,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:32:10,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:32:10,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:32:10,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:32:10,719 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-09 12:32:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:11,205 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-09 12:32:11,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:32:11,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-09 12:32:11,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:11,375 INFO L225 Difference]: With dead ends: 60791 [2018-12-09 12:32:11,375 INFO L226 Difference]: Without dead ends: 44271 [2018-12-09 12:32:11,376 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-09 12:32:11,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-09 12:32:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-09 12:32:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-09 12:32:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-09 12:32:12,145 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-09 12:32:12,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:12,146 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-09 12:32:12,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:32:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-09 12:32:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 12:32:12,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:12,153 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-09 12:32:12,153 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:12,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:12,153 INFO L82 PathProgramCache]: Analyzing trace with hash 510140563, now seen corresponding path program 1 times [2018-12-09 12:32:12,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:12,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:12,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:12,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:12,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:12,219 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-09 12:32:12,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:12,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:32:12,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:32:12,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:32:12,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:32:12,221 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-09 12:32:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:12,873 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-09 12:32:12,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:32:12,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 12:32:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:13,021 INFO L225 Difference]: With dead ends: 64005 [2018-12-09 12:32:13,021 INFO L226 Difference]: Without dead ends: 63453 [2018-12-09 12:32:13,022 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-09 12:32:13,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-09 12:32:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-09 12:32:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-09 12:32:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-09 12:32:13,831 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-09 12:32:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:13,832 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-09 12:32:13,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:32:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-09 12:32:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 12:32:13,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:13,835 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] [2018-12-09 12:32:13,835 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:13,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:13,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1974914378, now seen corresponding path program 1 times [2018-12-09 12:32:13,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:13,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:13,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:13,879 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-09 12:32:13,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:13,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:32:13,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:32:13,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:32:13,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:32:13,879 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-09 12:32:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:14,329 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-09 12:32:14,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:32:14,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 12:32:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:14,488 INFO L225 Difference]: With dead ends: 81367 [2018-12-09 12:32:14,488 INFO L226 Difference]: Without dead ends: 80855 [2018-12-09 12:32:14,488 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-09 12:32:14,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-09 12:32:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-09 12:32:15,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-09 12:32:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-09 12:32:15,485 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-09 12:32:15,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:15,485 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-09 12:32:15,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:32:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-09 12:32:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 12:32:15,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:15,490 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] [2018-12-09 12:32:15,490 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:15,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash 489356304, now seen corresponding path program 1 times [2018-12-09 12:32:15,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:15,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:15,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:15,512 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-09 12:32:15,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:15,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:32:15,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:32:15,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:32:15,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:32:15,513 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-09 12:32:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:15,734 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-09 12:32:15,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:32:15,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 12:32:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:15,848 INFO L225 Difference]: With dead ends: 65251 [2018-12-09 12:32:15,848 INFO L226 Difference]: Without dead ends: 65251 [2018-12-09 12:32:15,848 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-09 12:32:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-09 12:32:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-09 12:32:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-09 12:32:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-09 12:32:16,768 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-09 12:32:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:16,769 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-09 12:32:16,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:32:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-09 12:32:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 12:32:16,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:16,779 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-09 12:32:16,779 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:16,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:16,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1592139769, now seen corresponding path program 1 times [2018-12-09 12:32:16,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:16,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:16,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:16,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:16,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:16,866 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-09 12:32:16,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:16,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:32:16,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:32:16,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:32:16,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:16,867 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-09 12:32:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:17,390 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-09 12:32:17,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:32:17,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 12:32:17,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:17,508 INFO L225 Difference]: With dead ends: 67511 [2018-12-09 12:32:17,508 INFO L226 Difference]: Without dead ends: 67511 [2018-12-09 12:32:17,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:32:17,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-09 12:32:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-09 12:32:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-09 12:32:18,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-09 12:32:18,550 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-09 12:32:18,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:18,550 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-09 12:32:18,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:32:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-09 12:32:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 12:32:18,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:18,559 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-09 12:32:18,560 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:18,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash 905876168, now seen corresponding path program 1 times [2018-12-09 12:32:18,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:18,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:18,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:18,628 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-09 12:32:18,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:18,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:32:18,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:32:18,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:32:18,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:32:18,629 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-09 12:32:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:19,442 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-09 12:32:19,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 12:32:19,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-09 12:32:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:19,592 INFO L225 Difference]: With dead ends: 88528 [2018-12-09 12:32:19,592 INFO L226 Difference]: Without dead ends: 88528 [2018-12-09 12:32:19,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:32:19,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-09 12:32:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-09 12:32:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-09 12:32:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-09 12:32:20,812 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-09 12:32:20,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:20,813 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-09 12:32:20,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:32:20,813 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-09 12:32:20,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 12:32:20,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:20,822 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-09 12:32:20,822 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:20,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:20,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1793379849, now seen corresponding path program 1 times [2018-12-09 12:32:20,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:20,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:20,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:20,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:20,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:20,859 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-09 12:32:20,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:20,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:32:20,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:32:20,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:32:20,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:32:20,860 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 4 states. [2018-12-09 12:32:20,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:20,924 INFO L93 Difference]: Finished difference Result 15375 states and 48826 transitions. [2018-12-09 12:32:20,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:32:20,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-09 12:32:20,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:20,941 INFO L225 Difference]: With dead ends: 15375 [2018-12-09 12:32:20,941 INFO L226 Difference]: Without dead ends: 13789 [2018-12-09 12:32:20,942 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-09 12:32:20,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2018-12-09 12:32:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 13740. [2018-12-09 12:32:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2018-12-09 12:32:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 43352 transitions. [2018-12-09 12:32:21,085 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 43352 transitions. Word has length 53 [2018-12-09 12:32:21,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:21,085 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 43352 transitions. [2018-12-09 12:32:21,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:32:21,085 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 43352 transitions. [2018-12-09 12:32:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 12:32:21,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:21,086 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-09 12:32:21,086 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:21,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:21,086 INFO L82 PathProgramCache]: Analyzing trace with hash 35134875, now seen corresponding path program 1 times [2018-12-09 12:32:21,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:21,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:21,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:21,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:21,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:21,156 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-09 12:32:21,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:21,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:32:21,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:32:21,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:32:21,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:21,158 INFO L87 Difference]: Start difference. First operand 13740 states and 43352 transitions. Second operand 6 states. [2018-12-09 12:32:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:21,442 INFO L93 Difference]: Finished difference Result 19970 states and 62589 transitions. [2018-12-09 12:32:21,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:32:21,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 12:32:21,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:21,465 INFO L225 Difference]: With dead ends: 19970 [2018-12-09 12:32:21,466 INFO L226 Difference]: Without dead ends: 19898 [2018-12-09 12:32:21,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 12:32:21,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19898 states. [2018-12-09 12:32:21,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19898 to 14314. [2018-12-09 12:32:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14314 states. [2018-12-09 12:32:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 45049 transitions. [2018-12-09 12:32:21,643 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 45049 transitions. Word has length 53 [2018-12-09 12:32:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:21,643 INFO L480 AbstractCegarLoop]: Abstraction has 14314 states and 45049 transitions. [2018-12-09 12:32:21,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:32:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 45049 transitions. [2018-12-09 12:32:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 12:32:21,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:21,646 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] [2018-12-09 12:32:21,646 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:21,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:21,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1993804535, now seen corresponding path program 1 times [2018-12-09 12:32:21,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:21,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:21,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:21,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:21,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:21,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-09 12:32:21,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:21,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:32:21,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:32:21,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:32:21,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:32:21,694 INFO L87 Difference]: Start difference. First operand 14314 states and 45049 transitions. Second operand 4 states. [2018-12-09 12:32:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:21,799 INFO L93 Difference]: Finished difference Result 16617 states and 52377 transitions. [2018-12-09 12:32:21,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:32:21,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-09 12:32:21,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:21,821 INFO L225 Difference]: With dead ends: 16617 [2018-12-09 12:32:21,821 INFO L226 Difference]: Without dead ends: 16617 [2018-12-09 12:32:21,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09 12:32:21,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2018-12-09 12:32:21,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 15134. [2018-12-09 12:32:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2018-12-09 12:32:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 47639 transitions. [2018-12-09 12:32:22,045 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 47639 transitions. Word has length 61 [2018-12-09 12:32:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:22,045 INFO L480 AbstractCegarLoop]: Abstraction has 15134 states and 47639 transitions. [2018-12-09 12:32:22,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:32:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 47639 transitions. [2018-12-09 12:32:22,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 12:32:22,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:22,048 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] [2018-12-09 12:32:22,048 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:22,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:22,048 INFO L82 PathProgramCache]: Analyzing trace with hash -558352426, now seen corresponding path program 1 times [2018-12-09 12:32:22,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:22,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:22,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:22,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:22,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:22,100 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-09 12:32:22,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:22,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:32:22,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:32:22,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:32:22,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:22,101 INFO L87 Difference]: Start difference. First operand 15134 states and 47639 transitions. Second operand 6 states. [2018-12-09 12:32:22,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:22,354 INFO L93 Difference]: Finished difference Result 28106 states and 88147 transitions. [2018-12-09 12:32:22,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:32:22,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-09 12:32:22,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:22,389 INFO L225 Difference]: With dead ends: 28106 [2018-12-09 12:32:22,390 INFO L226 Difference]: Without dead ends: 28035 [2018-12-09 12:32:22,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:32:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2018-12-09 12:32:22,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 17412. [2018-12-09 12:32:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2018-12-09 12:32:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 54313 transitions. [2018-12-09 12:32:22,625 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 54313 transitions. Word has length 61 [2018-12-09 12:32:22,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:22,625 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 54313 transitions. [2018-12-09 12:32:22,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:32:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 54313 transitions. [2018-12-09 12:32:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 12:32:22,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:22,630 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] [2018-12-09 12:32:22,630 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:22,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:22,630 INFO L82 PathProgramCache]: Analyzing trace with hash 962407834, now seen corresponding path program 1 times [2018-12-09 12:32:22,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:22,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:22,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:22,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:22,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:22,650 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-09 12:32:22,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:22,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:32:22,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:32:22,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:32:22,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:32:22,651 INFO L87 Difference]: Start difference. First operand 17412 states and 54313 transitions. Second operand 3 states. [2018-12-09 12:32:22,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:22,788 INFO L93 Difference]: Finished difference Result 18092 states and 56145 transitions. [2018-12-09 12:32:22,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:32:22,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-09 12:32:22,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:22,809 INFO L225 Difference]: With dead ends: 18092 [2018-12-09 12:32:22,809 INFO L226 Difference]: Without dead ends: 18092 [2018-12-09 12:32:22,809 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-09 12:32:22,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18092 states. [2018-12-09 12:32:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18092 to 17752. [2018-12-09 12:32:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17752 states. [2018-12-09 12:32:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 55229 transitions. [2018-12-09 12:32:22,991 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 55229 transitions. Word has length 65 [2018-12-09 12:32:22,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:22,991 INFO L480 AbstractCegarLoop]: Abstraction has 17752 states and 55229 transitions. [2018-12-09 12:32:22,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:32:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 55229 transitions. [2018-12-09 12:32:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 12:32:22,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:22,996 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] [2018-12-09 12:32:22,996 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:22,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:22,996 INFO L82 PathProgramCache]: Analyzing trace with hash -901897063, now seen corresponding path program 1 times [2018-12-09 12:32:22,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:22,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:22,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:22,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:22,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:23,021 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-09 12:32:23,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:23,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:32:23,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:32:23,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:32:23,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:32:23,022 INFO L87 Difference]: Start difference. First operand 17752 states and 55229 transitions. Second operand 4 states. [2018-12-09 12:32:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:23,197 INFO L93 Difference]: Finished difference Result 21696 states and 66718 transitions. [2018-12-09 12:32:23,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:32:23,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 12:32:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:23,220 INFO L225 Difference]: With dead ends: 21696 [2018-12-09 12:32:23,220 INFO L226 Difference]: Without dead ends: 21696 [2018-12-09 12:32:23,221 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-09 12:32:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2018-12-09 12:32:23,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 19646. [2018-12-09 12:32:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2018-12-09 12:32:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 60608 transitions. [2018-12-09 12:32:23,430 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 60608 transitions. Word has length 65 [2018-12-09 12:32:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:23,430 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 60608 transitions. [2018-12-09 12:32:23,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:32:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 60608 transitions. [2018-12-09 12:32:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 12:32:23,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:23,437 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] [2018-12-09 12:32:23,437 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:23,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:23,437 INFO L82 PathProgramCache]: Analyzing trace with hash -987757598, now seen corresponding path program 1 times [2018-12-09 12:32:23,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:23,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:23,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:23,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:23,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:23,488 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-09 12:32:23,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:23,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:32:23,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:32:23,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:32:23,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:23,489 INFO L87 Difference]: Start difference. First operand 19646 states and 60608 transitions. Second operand 6 states. [2018-12-09 12:32:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:24,111 INFO L93 Difference]: Finished difference Result 23814 states and 72326 transitions. [2018-12-09 12:32:24,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:32:24,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 12:32:24,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:24,137 INFO L225 Difference]: With dead ends: 23814 [2018-12-09 12:32:24,137 INFO L226 Difference]: Without dead ends: 23814 [2018-12-09 12:32:24,138 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-09 12:32:24,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2018-12-09 12:32:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22474. [2018-12-09 12:32:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22474 states. [2018-12-09 12:32:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 68748 transitions. [2018-12-09 12:32:24,375 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 68748 transitions. Word has length 67 [2018-12-09 12:32:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:24,375 INFO L480 AbstractCegarLoop]: Abstraction has 22474 states and 68748 transitions. [2018-12-09 12:32:24,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:32:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 68748 transitions. [2018-12-09 12:32:24,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 12:32:24,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:24,382 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] [2018-12-09 12:32:24,382 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:24,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:24,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1230000355, now seen corresponding path program 1 times [2018-12-09 12:32:24,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:24,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:24,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:24,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:24,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:24,458 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-09 12:32:24,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:24,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:32:24,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:32:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:32:24,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:24,459 INFO L87 Difference]: Start difference. First operand 22474 states and 68748 transitions. Second operand 6 states. [2018-12-09 12:32:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:24,755 INFO L93 Difference]: Finished difference Result 25702 states and 76208 transitions. [2018-12-09 12:32:24,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:32:24,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 12:32:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:24,781 INFO L225 Difference]: With dead ends: 25702 [2018-12-09 12:32:24,782 INFO L226 Difference]: Without dead ends: 25702 [2018-12-09 12:32:24,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:32:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2018-12-09 12:32:25,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 22858. [2018-12-09 12:32:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22858 states. [2018-12-09 12:32:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22858 states to 22858 states and 68854 transitions. [2018-12-09 12:32:25,039 INFO L78 Accepts]: Start accepts. Automaton has 22858 states and 68854 transitions. Word has length 67 [2018-12-09 12:32:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:25,040 INFO L480 AbstractCegarLoop]: Abstraction has 22858 states and 68854 transitions. [2018-12-09 12:32:25,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:32:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 22858 states and 68854 transitions. [2018-12-09 12:32:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 12:32:25,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:25,046 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] [2018-12-09 12:32:25,047 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:25,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:25,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1441351268, now seen corresponding path program 1 times [2018-12-09 12:32:25,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:25,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:25,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:25,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:25,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:25,093 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-09 12:32:25,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:25,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:32:25,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:32:25,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:32:25,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:32:25,094 INFO L87 Difference]: Start difference. First operand 22858 states and 68854 transitions. Second operand 5 states. [2018-12-09 12:32:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:25,334 INFO L93 Difference]: Finished difference Result 29793 states and 89419 transitions. [2018-12-09 12:32:25,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:32:25,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 12:32:25,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:25,369 INFO L225 Difference]: With dead ends: 29793 [2018-12-09 12:32:25,369 INFO L226 Difference]: Without dead ends: 29793 [2018-12-09 12:32:25,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:32:25,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2018-12-09 12:32:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 26814. [2018-12-09 12:32:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26814 states. [2018-12-09 12:32:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26814 states to 26814 states and 80363 transitions. [2018-12-09 12:32:25,668 INFO L78 Accepts]: Start accepts. Automaton has 26814 states and 80363 transitions. Word has length 67 [2018-12-09 12:32:25,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:25,668 INFO L480 AbstractCegarLoop]: Abstraction has 26814 states and 80363 transitions. [2018-12-09 12:32:25,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:32:25,668 INFO L276 IsEmpty]: Start isEmpty. Operand 26814 states and 80363 transitions. [2018-12-09 12:32:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 12:32:25,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:25,677 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] [2018-12-09 12:32:25,677 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:25,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:25,677 INFO L82 PathProgramCache]: Analyzing trace with hash 930817091, now seen corresponding path program 1 times [2018-12-09 12:32:25,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:25,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:25,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:25,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:25,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:25,718 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-09 12:32:25,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:25,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:32:25,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:32:25,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:32:25,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:32:25,719 INFO L87 Difference]: Start difference. First operand 26814 states and 80363 transitions. Second operand 5 states. [2018-12-09 12:32:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:26,031 INFO L93 Difference]: Finished difference Result 36420 states and 108433 transitions. [2018-12-09 12:32:26,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:32:26,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 12:32:26,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:26,073 INFO L225 Difference]: With dead ends: 36420 [2018-12-09 12:32:26,074 INFO L226 Difference]: Without dead ends: 36420 [2018-12-09 12:32:26,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-09 12:32:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36420 states. [2018-12-09 12:32:26,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36420 to 29428. [2018-12-09 12:32:26,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29428 states. [2018-12-09 12:32:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29428 states to 29428 states and 87839 transitions. [2018-12-09 12:32:26,434 INFO L78 Accepts]: Start accepts. Automaton has 29428 states and 87839 transitions. Word has length 67 [2018-12-09 12:32:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:26,434 INFO L480 AbstractCegarLoop]: Abstraction has 29428 states and 87839 transitions. [2018-12-09 12:32:26,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:32:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 29428 states and 87839 transitions. [2018-12-09 12:32:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 12:32:26,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:26,443 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] [2018-12-09 12:32:26,443 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:26,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:26,443 INFO L82 PathProgramCache]: Analyzing trace with hash -876637372, now seen corresponding path program 1 times [2018-12-09 12:32:26,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:26,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:26,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:26,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:26,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:26,479 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-09 12:32:26,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:26,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:32:26,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:32:26,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:32:26,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:32:26,480 INFO L87 Difference]: Start difference. First operand 29428 states and 87839 transitions. Second operand 5 states. [2018-12-09 12:32:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:26,533 INFO L93 Difference]: Finished difference Result 9076 states and 21915 transitions. [2018-12-09 12:32:26,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:32:26,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 12:32:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:26,539 INFO L225 Difference]: With dead ends: 9076 [2018-12-09 12:32:26,539 INFO L226 Difference]: Without dead ends: 7224 [2018-12-09 12:32:26,539 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-09 12:32:26,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2018-12-09 12:32:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 6121. [2018-12-09 12:32:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6121 states. [2018-12-09 12:32:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 14386 transitions. [2018-12-09 12:32:26,588 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 14386 transitions. Word has length 67 [2018-12-09 12:32:26,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:26,588 INFO L480 AbstractCegarLoop]: Abstraction has 6121 states and 14386 transitions. [2018-12-09 12:32:26,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:32:26,588 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 14386 transitions. [2018-12-09 12:32:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 12:32:26,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:26,592 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] [2018-12-09 12:32:26,592 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:26,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:26,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1392892313, now seen corresponding path program 1 times [2018-12-09 12:32:26,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:26,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:26,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:26,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:26,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:26,606 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-09 12:32:26,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:26,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:32:26,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:32:26,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:32:26,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:32:26,607 INFO L87 Difference]: Start difference. First operand 6121 states and 14386 transitions. Second operand 3 states. [2018-12-09 12:32:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:26,635 INFO L93 Difference]: Finished difference Result 8340 states and 19493 transitions. [2018-12-09 12:32:26,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:32:26,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-09 12:32:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:26,640 INFO L225 Difference]: With dead ends: 8340 [2018-12-09 12:32:26,640 INFO L226 Difference]: Without dead ends: 8340 [2018-12-09 12:32:26,640 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-09 12:32:26,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8340 states. [2018-12-09 12:32:26,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8340 to 6060. [2018-12-09 12:32:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6060 states. [2018-12-09 12:32:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6060 states to 6060 states and 13926 transitions. [2018-12-09 12:32:26,688 INFO L78 Accepts]: Start accepts. Automaton has 6060 states and 13926 transitions. Word has length 67 [2018-12-09 12:32:26,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:26,688 INFO L480 AbstractCegarLoop]: Abstraction has 6060 states and 13926 transitions. [2018-12-09 12:32:26,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:32:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 6060 states and 13926 transitions. [2018-12-09 12:32:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 12:32:26,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:26,692 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-09 12:32:26,692 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:26,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:26,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1912290010, now seen corresponding path program 1 times [2018-12-09 12:32:26,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:26,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:26,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:26,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:26,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:26,724 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-09 12:32:26,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:26,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:32:26,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:32:26,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:32:26,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:32:26,725 INFO L87 Difference]: Start difference. First operand 6060 states and 13926 transitions. Second operand 5 states. [2018-12-09 12:32:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:26,827 INFO L93 Difference]: Finished difference Result 7230 states and 16567 transitions. [2018-12-09 12:32:26,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:32:26,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-09 12:32:26,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:26,832 INFO L225 Difference]: With dead ends: 7230 [2018-12-09 12:32:26,832 INFO L226 Difference]: Without dead ends: 7230 [2018-12-09 12:32:26,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:32:26,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2018-12-09 12:32:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 6504. [2018-12-09 12:32:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6504 states. [2018-12-09 12:32:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6504 states to 6504 states and 14930 transitions. [2018-12-09 12:32:26,879 INFO L78 Accepts]: Start accepts. Automaton has 6504 states and 14930 transitions. Word has length 73 [2018-12-09 12:32:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:26,880 INFO L480 AbstractCegarLoop]: Abstraction has 6504 states and 14930 transitions. [2018-12-09 12:32:26,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:32:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 6504 states and 14930 transitions. [2018-12-09 12:32:26,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 12:32:26,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:26,884 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-09 12:32:26,884 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:26,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:26,884 INFO L82 PathProgramCache]: Analyzing trace with hash -639866951, now seen corresponding path program 1 times [2018-12-09 12:32:26,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:26,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:26,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:26,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:26,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:26,924 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-09 12:32:26,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:26,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:32:26,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:32:26,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:32:26,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:32:26,925 INFO L87 Difference]: Start difference. First operand 6504 states and 14930 transitions. Second operand 7 states. [2018-12-09 12:32:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:27,149 INFO L93 Difference]: Finished difference Result 7577 states and 17192 transitions. [2018-12-09 12:32:27,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 12:32:27,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-09 12:32:27,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:27,154 INFO L225 Difference]: With dead ends: 7577 [2018-12-09 12:32:27,155 INFO L226 Difference]: Without dead ends: 7458 [2018-12-09 12:32:27,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-09 12:32:27,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7458 states. [2018-12-09 12:32:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7458 to 6601. [2018-12-09 12:32:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6601 states. [2018-12-09 12:32:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 15023 transitions. [2018-12-09 12:32:27,209 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 15023 transitions. Word has length 73 [2018-12-09 12:32:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:27,209 INFO L480 AbstractCegarLoop]: Abstraction has 6601 states and 15023 transitions. [2018-12-09 12:32:27,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:32:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 15023 transitions. [2018-12-09 12:32:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 12:32:27,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:27,214 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-09 12:32:27,214 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:27,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1900952980, now seen corresponding path program 1 times [2018-12-09 12:32:27,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:27,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:27,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:27,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:27,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:27,244 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-09 12:32:27,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:27,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:32:27,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:32:27,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:32:27,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:32:27,245 INFO L87 Difference]: Start difference. First operand 6601 states and 15023 transitions. Second operand 4 states. [2018-12-09 12:32:27,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:27,406 INFO L93 Difference]: Finished difference Result 10288 states and 23294 transitions. [2018-12-09 12:32:27,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:32:27,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 12:32:27,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:27,413 INFO L225 Difference]: With dead ends: 10288 [2018-12-09 12:32:27,413 INFO L226 Difference]: Without dead ends: 10288 [2018-12-09 12:32:27,413 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-09 12:32:27,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10288 states. [2018-12-09 12:32:27,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10288 to 7721. [2018-12-09 12:32:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7721 states. [2018-12-09 12:32:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7721 states to 7721 states and 17357 transitions. [2018-12-09 12:32:27,478 INFO L78 Accepts]: Start accepts. Automaton has 7721 states and 17357 transitions. Word has length 92 [2018-12-09 12:32:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:27,478 INFO L480 AbstractCegarLoop]: Abstraction has 7721 states and 17357 transitions. [2018-12-09 12:32:27,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:32:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 7721 states and 17357 transitions. [2018-12-09 12:32:27,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 12:32:27,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:27,484 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-09 12:32:27,484 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:27,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:27,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1742447813, now seen corresponding path program 1 times [2018-12-09 12:32:27,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:27,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:27,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:27,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:27,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:27,510 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-09 12:32:27,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:27,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:32:27,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:32:27,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:32:27,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:32:27,511 INFO L87 Difference]: Start difference. First operand 7721 states and 17357 transitions. Second operand 4 states. [2018-12-09 12:32:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:27,575 INFO L93 Difference]: Finished difference Result 8286 states and 18650 transitions. [2018-12-09 12:32:27,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:32:27,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 12:32:27,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:27,582 INFO L225 Difference]: With dead ends: 8286 [2018-12-09 12:32:27,583 INFO L226 Difference]: Without dead ends: 8286 [2018-12-09 12:32:27,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:32:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8286 states. [2018-12-09 12:32:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8286 to 7627. [2018-12-09 12:32:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7627 states. [2018-12-09 12:32:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7627 states to 7627 states and 17252 transitions. [2018-12-09 12:32:27,667 INFO L78 Accepts]: Start accepts. Automaton has 7627 states and 17252 transitions. Word has length 92 [2018-12-09 12:32:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:27,667 INFO L480 AbstractCegarLoop]: Abstraction has 7627 states and 17252 transitions. [2018-12-09 12:32:27,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:32:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 7627 states and 17252 transitions. [2018-12-09 12:32:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:32:27,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:27,674 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-09 12:32:27,674 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:27,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:27,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1344279218, now seen corresponding path program 1 times [2018-12-09 12:32:27,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:27,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:27,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:27,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:27,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:27,728 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-09 12:32:27,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:27,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:32:27,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:32:27,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:32:27,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:32:27,729 INFO L87 Difference]: Start difference. First operand 7627 states and 17252 transitions. Second operand 5 states. [2018-12-09 12:32:27,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:27,914 INFO L93 Difference]: Finished difference Result 7193 states and 16104 transitions. [2018-12-09 12:32:27,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:32:27,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 12:32:27,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:27,919 INFO L225 Difference]: With dead ends: 7193 [2018-12-09 12:32:27,919 INFO L226 Difference]: Without dead ends: 7193 [2018-12-09 12:32:27,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7193 states. [2018-12-09 12:32:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7193 to 6761. [2018-12-09 12:32:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6761 states. [2018-12-09 12:32:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 15167 transitions. [2018-12-09 12:32:27,983 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 15167 transitions. Word has length 94 [2018-12-09 12:32:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:27,984 INFO L480 AbstractCegarLoop]: Abstraction has 6761 states and 15167 transitions. [2018-12-09 12:32:27,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:32:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 15167 transitions. [2018-12-09 12:32:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:32:27,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:27,990 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-09 12:32:27,990 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:27,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:27,990 INFO L82 PathProgramCache]: Analyzing trace with hash 895526994, now seen corresponding path program 1 times [2018-12-09 12:32:27,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:27,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:27,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:27,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:27,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:28,070 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-09 12:32:28,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:28,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 12:32:28,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 12:32:28,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 12:32:28,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:32:28,071 INFO L87 Difference]: Start difference. First operand 6761 states and 15167 transitions. Second operand 9 states. [2018-12-09 12:32:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:29,618 INFO L93 Difference]: Finished difference Result 18736 states and 41902 transitions. [2018-12-09 12:32:29,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-09 12:32:29,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-09 12:32:29,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:29,636 INFO L225 Difference]: With dead ends: 18736 [2018-12-09 12:32:29,636 INFO L226 Difference]: Without dead ends: 18617 [2018-12-09 12:32:29,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=354, Invalid=1206, Unknown=0, NotChecked=0, Total=1560 [2018-12-09 12:32:29,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18617 states. [2018-12-09 12:32:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18617 to 10167. [2018-12-09 12:32:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10167 states. [2018-12-09 12:32:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10167 states to 10167 states and 23043 transitions. [2018-12-09 12:32:29,751 INFO L78 Accepts]: Start accepts. Automaton has 10167 states and 23043 transitions. Word has length 94 [2018-12-09 12:32:29,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:29,751 INFO L480 AbstractCegarLoop]: Abstraction has 10167 states and 23043 transitions. [2018-12-09 12:32:29,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 12:32:29,751 INFO L276 IsEmpty]: Start isEmpty. Operand 10167 states and 23043 transitions. [2018-12-09 12:32:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:32:29,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:29,759 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-09 12:32:29,759 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:29,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:29,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2140291475, now seen corresponding path program 1 times [2018-12-09 12:32:29,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:29,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:29,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:29,820 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-09 12:32:29,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:29,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:32:29,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:32:29,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:32:29,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:29,821 INFO L87 Difference]: Start difference. First operand 10167 states and 23043 transitions. Second operand 6 states. [2018-12-09 12:32:29,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:29,938 INFO L93 Difference]: Finished difference Result 10856 states and 24055 transitions. [2018-12-09 12:32:29,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:32:29,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 12:32:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:29,945 INFO L225 Difference]: With dead ends: 10856 [2018-12-09 12:32:29,945 INFO L226 Difference]: Without dead ends: 10816 [2018-12-09 12:32:29,945 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-09 12:32:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10816 states. [2018-12-09 12:32:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10816 to 9286. [2018-12-09 12:32:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2018-12-09 12:32:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 20765 transitions. [2018-12-09 12:32:30,016 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 20765 transitions. Word has length 94 [2018-12-09 12:32:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:30,016 INFO L480 AbstractCegarLoop]: Abstraction has 9286 states and 20765 transitions. [2018-12-09 12:32:30,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:32:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 20765 transitions. [2018-12-09 12:32:30,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:32:30,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:30,023 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-09 12:32:30,024 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:30,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:30,024 INFO L82 PathProgramCache]: Analyzing trace with hash -538468846, now seen corresponding path program 1 times [2018-12-09 12:32:30,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:30,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:30,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:30,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:30,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:30,077 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-09 12:32:30,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:30,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:32:30,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:32:30,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:32:30,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:32:30,078 INFO L87 Difference]: Start difference. First operand 9286 states and 20765 transitions. Second operand 5 states. [2018-12-09 12:32:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:30,311 INFO L93 Difference]: Finished difference Result 11493 states and 25484 transitions. [2018-12-09 12:32:30,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:32:30,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 12:32:30,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:30,318 INFO L225 Difference]: With dead ends: 11493 [2018-12-09 12:32:30,318 INFO L226 Difference]: Without dead ends: 11313 [2018-12-09 12:32:30,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:30,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11313 states. [2018-12-09 12:32:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11313 to 10119. [2018-12-09 12:32:30,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10119 states. [2018-12-09 12:32:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10119 states to 10119 states and 22559 transitions. [2018-12-09 12:32:30,397 INFO L78 Accepts]: Start accepts. Automaton has 10119 states and 22559 transitions. Word has length 94 [2018-12-09 12:32:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:30,397 INFO L480 AbstractCegarLoop]: Abstraction has 10119 states and 22559 transitions. [2018-12-09 12:32:30,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:32:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 10119 states and 22559 transitions. [2018-12-09 12:32:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:32:30,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 12:32:30,405 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:30,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:30,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1679289107, now seen corresponding path program 1 times [2018-12-09 12:32:30,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:30,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:30,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:30,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:30,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:30,440 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-09 12:32:30,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:30,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:32:30,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:32:30,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:32:30,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:32:30,441 INFO L87 Difference]: Start difference. First operand 10119 states and 22559 transitions. Second operand 5 states. [2018-12-09 12:32:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:30,615 INFO L93 Difference]: Finished difference Result 12637 states and 27963 transitions. [2018-12-09 12:32:30,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:32:30,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 12:32:30,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:30,624 INFO L225 Difference]: With dead ends: 12637 [2018-12-09 12:32:30,624 INFO L226 Difference]: Without dead ends: 12504 [2018-12-09 12:32:30,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:32:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12504 states. [2018-12-09 12:32:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12504 to 10284. [2018-12-09 12:32:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10284 states. [2018-12-09 12:32:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10284 states to 10284 states and 22897 transitions. [2018-12-09 12:32:30,707 INFO L78 Accepts]: Start accepts. Automaton has 10284 states and 22897 transitions. Word has length 94 [2018-12-09 12:32:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:30,707 INFO L480 AbstractCegarLoop]: Abstraction has 10284 states and 22897 transitions. [2018-12-09 12:32:30,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:32:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 10284 states and 22897 transitions. [2018-12-09 12:32:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:32:30,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:30,714 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-09 12:32:30,714 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:30,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:30,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1759786015, now seen corresponding path program 1 times [2018-12-09 12:32:30,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:30,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:30,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:30,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:30,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:30,749 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-09 12:32:30,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:30,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:32:30,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:32:30,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:32:30,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:32:30,750 INFO L87 Difference]: Start difference. First operand 10284 states and 22897 transitions. Second operand 5 states. [2018-12-09 12:32:30,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:30,813 INFO L93 Difference]: Finished difference Result 8323 states and 18531 transitions. [2018-12-09 12:32:30,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:32:30,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 12:32:30,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:30,819 INFO L225 Difference]: With dead ends: 8323 [2018-12-09 12:32:30,819 INFO L226 Difference]: Without dead ends: 8323 [2018-12-09 12:32:30,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:32:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8323 states. [2018-12-09 12:32:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8323 to 6728. [2018-12-09 12:32:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6728 states. [2018-12-09 12:32:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6728 states to 6728 states and 15087 transitions. [2018-12-09 12:32:30,874 INFO L78 Accepts]: Start accepts. Automaton has 6728 states and 15087 transitions. Word has length 94 [2018-12-09 12:32:30,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:30,875 INFO L480 AbstractCegarLoop]: Abstraction has 6728 states and 15087 transitions. [2018-12-09 12:32:30,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:32:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 6728 states and 15087 transitions. [2018-12-09 12:32:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:32:30,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:30,879 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-09 12:32:30,879 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:30,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:30,880 INFO L82 PathProgramCache]: Analyzing trace with hash -809700384, now seen corresponding path program 2 times [2018-12-09 12:32:30,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:30,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:30,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:30,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:30,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:30,944 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-09 12:32:30,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:30,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:32:30,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:32:30,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:32:30,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:32:30,945 INFO L87 Difference]: Start difference. First operand 6728 states and 15087 transitions. Second operand 7 states. [2018-12-09 12:32:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:31,152 INFO L93 Difference]: Finished difference Result 8442 states and 18687 transitions. [2018-12-09 12:32:31,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:32:31,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 12:32:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:31,157 INFO L225 Difference]: With dead ends: 8442 [2018-12-09 12:32:31,157 INFO L226 Difference]: Without dead ends: 8442 [2018-12-09 12:32:31,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:32:31,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8442 states. [2018-12-09 12:32:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8442 to 6841. [2018-12-09 12:32:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2018-12-09 12:32:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15326 transitions. [2018-12-09 12:32:31,210 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15326 transitions. Word has length 94 [2018-12-09 12:32:31,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:31,211 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15326 transitions. [2018-12-09 12:32:31,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:32:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15326 transitions. [2018-12-09 12:32:31,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:32:31,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:31,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] [2018-12-09 12:32:31,215 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:31,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:31,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1408057569, now seen corresponding path program 2 times [2018-12-09 12:32:31,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:31,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:31,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:31,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:32:31,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:31,281 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-09 12:32:31,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:31,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:32:31,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:32:31,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:32:31,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:32:31,282 INFO L87 Difference]: Start difference. First operand 6841 states and 15326 transitions. Second operand 7 states. [2018-12-09 12:32:31,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:31,478 INFO L93 Difference]: Finished difference Result 9658 states and 21670 transitions. [2018-12-09 12:32:31,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:32:31,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 12:32:31,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:31,484 INFO L225 Difference]: With dead ends: 9658 [2018-12-09 12:32:31,485 INFO L226 Difference]: Without dead ends: 9626 [2018-12-09 12:32:31,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:32:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9626 states. [2018-12-09 12:32:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9626 to 8903. [2018-12-09 12:32:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8903 states. [2018-12-09 12:32:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8903 states to 8903 states and 19928 transitions. [2018-12-09 12:32:31,553 INFO L78 Accepts]: Start accepts. Automaton has 8903 states and 19928 transitions. Word has length 94 [2018-12-09 12:32:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:31,553 INFO L480 AbstractCegarLoop]: Abstraction has 8903 states and 19928 transitions. [2018-12-09 12:32:31,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:32:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 8903 states and 19928 transitions. [2018-12-09 12:32:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:32:31,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:31,559 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-09 12:32:31,560 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:31,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:31,560 INFO L82 PathProgramCache]: Analyzing trace with hash -388893790, now seen corresponding path program 1 times [2018-12-09 12:32:31,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:31,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:31,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:31,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:32:31,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:31,639 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-09 12:32:31,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:31,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 12:32:31,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:32:31,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:32:31,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:32:31,639 INFO L87 Difference]: Start difference. First operand 8903 states and 19928 transitions. Second operand 8 states. [2018-12-09 12:32:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:31,908 INFO L93 Difference]: Finished difference Result 14507 states and 33306 transitions. [2018-12-09 12:32:31,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 12:32:31,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-09 12:32:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:31,917 INFO L225 Difference]: With dead ends: 14507 [2018-12-09 12:32:31,918 INFO L226 Difference]: Without dead ends: 14507 [2018-12-09 12:32:31,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 12:32:31,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14507 states. [2018-12-09 12:32:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14507 to 9598. [2018-12-09 12:32:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9598 states. [2018-12-09 12:32:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9598 states to 9598 states and 21764 transitions. [2018-12-09 12:32:32,007 INFO L78 Accepts]: Start accepts. Automaton has 9598 states and 21764 transitions. Word has length 94 [2018-12-09 12:32:32,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:32,007 INFO L480 AbstractCegarLoop]: Abstraction has 9598 states and 21764 transitions. [2018-12-09 12:32:32,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:32:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 9598 states and 21764 transitions. [2018-12-09 12:32:32,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:32:32,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:32,014 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-09 12:32:32,014 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:32,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:32,014 INFO L82 PathProgramCache]: Analyzing trace with hash 498609891, now seen corresponding path program 1 times [2018-12-09 12:32:32,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:32,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:32,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:32,075 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-09 12:32:32,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:32,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:32:32,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:32:32,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:32:32,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:32,076 INFO L87 Difference]: Start difference. First operand 9598 states and 21764 transitions. Second operand 6 states. [2018-12-09 12:32:32,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:32,119 INFO L93 Difference]: Finished difference Result 11871 states and 27171 transitions. [2018-12-09 12:32:32,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:32:32,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 12:32:32,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:32,127 INFO L225 Difference]: With dead ends: 11871 [2018-12-09 12:32:32,127 INFO L226 Difference]: Without dead ends: 11871 [2018-12-09 12:32:32,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:32,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11871 states. [2018-12-09 12:32:32,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11871 to 9768. [2018-12-09 12:32:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9768 states. [2018-12-09 12:32:32,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9768 states to 9768 states and 22014 transitions. [2018-12-09 12:32:32,206 INFO L78 Accepts]: Start accepts. Automaton has 9768 states and 22014 transitions. Word has length 94 [2018-12-09 12:32:32,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:32,207 INFO L480 AbstractCegarLoop]: Abstraction has 9768 states and 22014 transitions. [2018-12-09 12:32:32,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:32:32,207 INFO L276 IsEmpty]: Start isEmpty. Operand 9768 states and 22014 transitions. [2018-12-09 12:32:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:32:32,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:32,214 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-09 12:32:32,214 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:32,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:32,214 INFO L82 PathProgramCache]: Analyzing trace with hash 431603138, now seen corresponding path program 1 times [2018-12-09 12:32:32,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:32,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:32,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:32,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:32,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:32,273 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-09 12:32:32,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:32,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:32:32,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:32:32,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:32:32,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:32:32,274 INFO L87 Difference]: Start difference. First operand 9768 states and 22014 transitions. Second operand 7 states. [2018-12-09 12:32:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:32,360 INFO L93 Difference]: Finished difference Result 12819 states and 29299 transitions. [2018-12-09 12:32:32,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:32:32,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 12:32:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:32,368 INFO L225 Difference]: With dead ends: 12819 [2018-12-09 12:32:32,368 INFO L226 Difference]: Without dead ends: 12819 [2018-12-09 12:32:32,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:32:32,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12819 states. [2018-12-09 12:32:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12819 to 9437. [2018-12-09 12:32:32,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9437 states. [2018-12-09 12:32:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9437 states to 9437 states and 21147 transitions. [2018-12-09 12:32:32,449 INFO L78 Accepts]: Start accepts. Automaton has 9437 states and 21147 transitions. Word has length 94 [2018-12-09 12:32:32,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:32,449 INFO L480 AbstractCegarLoop]: Abstraction has 9437 states and 21147 transitions. [2018-12-09 12:32:32,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:32:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 9437 states and 21147 transitions. [2018-12-09 12:32:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:32:32,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:32,456 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-09 12:32:32,456 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:32,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:32,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1300372414, now seen corresponding path program 1 times [2018-12-09 12:32:32,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:32,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:32,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:32,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:32,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:32,515 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-09 12:32:32,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:32,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:32:32,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:32:32,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:32:32,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:32,516 INFO L87 Difference]: Start difference. First operand 9437 states and 21147 transitions. Second operand 6 states. [2018-12-09 12:32:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:32,583 INFO L93 Difference]: Finished difference Result 9165 states and 20163 transitions. [2018-12-09 12:32:32,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:32:32,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 12:32:32,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:32,588 INFO L225 Difference]: With dead ends: 9165 [2018-12-09 12:32:32,588 INFO L226 Difference]: Without dead ends: 9165 [2018-12-09 12:32:32,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:32:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9165 states. [2018-12-09 12:32:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9165 to 5482. [2018-12-09 12:32:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5482 states. [2018-12-09 12:32:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5482 states to 5482 states and 11983 transitions. [2018-12-09 12:32:32,641 INFO L78 Accepts]: Start accepts. Automaton has 5482 states and 11983 transitions. Word has length 94 [2018-12-09 12:32:32,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:32,641 INFO L480 AbstractCegarLoop]: Abstraction has 5482 states and 11983 transitions. [2018-12-09 12:32:32,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:32:32,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5482 states and 11983 transitions. [2018-12-09 12:32:32,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:32:32,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:32,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, 1, 1, 1, 1] [2018-12-09 12:32:32,645 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:32,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:32,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1206757213, now seen corresponding path program 1 times [2018-12-09 12:32:32,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:32,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:32,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:32,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:32,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:32,689 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-09 12:32:32,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:32,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:32:32,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:32:32,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:32:32,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:32:32,690 INFO L87 Difference]: Start difference. First operand 5482 states and 11983 transitions. Second operand 7 states. [2018-12-09 12:32:32,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:32,872 INFO L93 Difference]: Finished difference Result 6672 states and 14436 transitions. [2018-12-09 12:32:32,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:32:32,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 12:32:32,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:32,876 INFO L225 Difference]: With dead ends: 6672 [2018-12-09 12:32:32,877 INFO L226 Difference]: Without dead ends: 6672 [2018-12-09 12:32:32,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:32:32,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6672 states. [2018-12-09 12:32:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6672 to 5531. [2018-12-09 12:32:32,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5531 states. [2018-12-09 12:32:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5531 states to 5531 states and 12086 transitions. [2018-12-09 12:32:32,914 INFO L78 Accepts]: Start accepts. Automaton has 5531 states and 12086 transitions. Word has length 96 [2018-12-09 12:32:32,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:32,914 INFO L480 AbstractCegarLoop]: Abstraction has 5531 states and 12086 transitions. [2018-12-09 12:32:32,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:32:32,914 INFO L276 IsEmpty]: Start isEmpty. Operand 5531 states and 12086 transitions. [2018-12-09 12:32:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:32:32,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:32,918 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-09 12:32:32,918 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:32,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:32,919 INFO L82 PathProgramCache]: Analyzing trace with hash -811380418, now seen corresponding path program 1 times [2018-12-09 12:32:32,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:32,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:32,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:32,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:32,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:32,988 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-09 12:32:32,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:32,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 12:32:32,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:32:32,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:32:32,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:32:32,989 INFO L87 Difference]: Start difference. First operand 5531 states and 12086 transitions. Second operand 8 states. [2018-12-09 12:32:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:33,169 INFO L93 Difference]: Finished difference Result 6611 states and 14366 transitions. [2018-12-09 12:32:33,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 12:32:33,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-09 12:32:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:33,173 INFO L225 Difference]: With dead ends: 6611 [2018-12-09 12:32:33,174 INFO L226 Difference]: Without dead ends: 6611 [2018-12-09 12:32:33,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-09 12:32:33,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6611 states. [2018-12-09 12:32:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6611 to 6521. [2018-12-09 12:32:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6521 states. [2018-12-09 12:32:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6521 states to 6521 states and 14180 transitions. [2018-12-09 12:32:33,217 INFO L78 Accepts]: Start accepts. Automaton has 6521 states and 14180 transitions. Word has length 96 [2018-12-09 12:32:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:33,217 INFO L480 AbstractCegarLoop]: Abstraction has 6521 states and 14180 transitions. [2018-12-09 12:32:33,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:32:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 6521 states and 14180 transitions. [2018-12-09 12:32:33,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:32:33,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:33,222 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-09 12:32:33,222 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:33,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:33,222 INFO L82 PathProgramCache]: Analyzing trace with hash 76123263, now seen corresponding path program 1 times [2018-12-09 12:32:33,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:33,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:33,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:33,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:33,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:33,322 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-09 12:32:33,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:33,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 12:32:33,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 12:32:33,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 12:32:33,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:32:33,323 INFO L87 Difference]: Start difference. First operand 6521 states and 14180 transitions. Second operand 11 states. [2018-12-09 12:32:34,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:34,085 INFO L93 Difference]: Finished difference Result 12225 states and 26787 transitions. [2018-12-09 12:32:34,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 12:32:34,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-09 12:32:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:34,090 INFO L225 Difference]: With dead ends: 12225 [2018-12-09 12:32:34,090 INFO L226 Difference]: Without dead ends: 7823 [2018-12-09 12:32:34,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 12:32:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7823 states. [2018-12-09 12:32:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7823 to 5902. [2018-12-09 12:32:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5902 states. [2018-12-09 12:32:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5902 states to 5902 states and 12818 transitions. [2018-12-09 12:32:34,135 INFO L78 Accepts]: Start accepts. Automaton has 5902 states and 12818 transitions. Word has length 96 [2018-12-09 12:32:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:34,135 INFO L480 AbstractCegarLoop]: Abstraction has 5902 states and 12818 transitions. [2018-12-09 12:32:34,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 12:32:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5902 states and 12818 transitions. [2018-12-09 12:32:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:32:34,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:34,140 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-09 12:32:34,140 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:34,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash -126110537, now seen corresponding path program 1 times [2018-12-09 12:32:34,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:34,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:34,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:34,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:34,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:34,179 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-09 12:32:34,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:34,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:32:34,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:32:34,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:32:34,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:34,180 INFO L87 Difference]: Start difference. First operand 5902 states and 12818 transitions. Second operand 6 states. [2018-12-09 12:32:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:34,337 INFO L93 Difference]: Finished difference Result 6737 states and 14653 transitions. [2018-12-09 12:32:34,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:32:34,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 12:32:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:34,342 INFO L225 Difference]: With dead ends: 6737 [2018-12-09 12:32:34,342 INFO L226 Difference]: Without dead ends: 6737 [2018-12-09 12:32:34,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:32:34,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6737 states. [2018-12-09 12:32:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6737 to 6085. [2018-12-09 12:32:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6085 states. [2018-12-09 12:32:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 13215 transitions. [2018-12-09 12:32:34,386 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 13215 transitions. Word has length 96 [2018-12-09 12:32:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:34,386 INFO L480 AbstractCegarLoop]: Abstraction has 6085 states and 13215 transitions. [2018-12-09 12:32:34,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:32:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 13215 transitions. [2018-12-09 12:32:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:32:34,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:34,391 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-09 12:32:34,391 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:34,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:34,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2028968089, now seen corresponding path program 2 times [2018-12-09 12:32:34,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:32:34,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:32:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:34,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:32:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:32:34,446 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 12:32:34,522 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 12:32:34,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:32:34 BasicIcfg [2018-12-09 12:32:34,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:32:34,523 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:32:34,523 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:32:34,523 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:32:34,523 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:32:08" (3/4) ... [2018-12-09 12:32:34,525 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 12:32:34,599 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6c020fcc-d88d-4d8a-b5da-3182e2466959/bin-2019/uautomizer/witness.graphml [2018-12-09 12:32:34,599 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:32:34,599 INFO L168 Benchmark]: Toolchain (without parser) took 26366.56 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.1 GB). Free memory was 951.7 MB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 793.9 MB. Max. memory is 11.5 GB. [2018-12-09 12:32:34,600 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:32:34,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-09 12:32:34,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.23 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 12:32:34,601 INFO L168 Benchmark]: Boogie Preprocessor took 18.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:32:34,601 INFO L168 Benchmark]: RCFGBuilder took 305.16 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: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2018-12-09 12:32:34,601 INFO L168 Benchmark]: TraceAbstraction took 25613.76 ms. Allocated memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 707.9 MB. Max. memory is 11.5 GB. [2018-12-09 12:32:34,601 INFO L168 Benchmark]: Witness Printer took 75.94 ms. Allocated memory is still 4.1 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 59.2 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. [2018-12-09 12:32:34,602 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.23 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 305.16 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: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25613.76 ms. Allocated memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 707.9 MB. Max. memory is 11.5 GB. * Witness Printer took 75.94 ms. Allocated memory is still 4.1 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 59.2 MB). Peak memory consumption was 59.2 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] [L681] -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, y=0] [L683] -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, y=0, z=0] [L684] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L685] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L686] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L687] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L688] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L689] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L690] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L691] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L692] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L693] -1 int *z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L694] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L695] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L696] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L697] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] -1 pthread_t t1099; 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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] FCALL, FORK -1 pthread_create(&t1099, ((void *)0), P0, ((void *)0)) 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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] 0 z$w_buff1 = z$w_buff0 [L704] 0 z$w_buff0 = 1 [L705] 0 z$w_buff1_used = z$w_buff0_used [L706] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) 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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L708] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L709] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L710] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L711] 0 z$r_buff0_thd1 = (_Bool)1 [L714] 0 x = 1 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] -1 pthread_t t1100; 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] FCALL, FORK -1 pthread_create(&t1100, ((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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 x = 2 [L734] 1 y = 1 [L737] 1 __unbuffered_p1_EAX = y [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 z$flush_delayed = weak$$choice2 [L743] 1 z$mem_tmp = z 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=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __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=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L745] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) 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=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L746] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) 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=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L747] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) 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=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) 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=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = z 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=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] EXPR 1 z$flush_delayed ? z$mem_tmp : z 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=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L752] 1 z = z$flush_delayed ? z$mem_tmp : z [L753] 1 z$flush_delayed = (_Bool)0 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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) 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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z 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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) 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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L763] 1 __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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L718] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L718] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L719] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L719] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L720] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L720] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L721] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L721] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L724] 0 __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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] -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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) 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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z 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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) 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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L788] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L789] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L790] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L791] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L794] -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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 25.5s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 12.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10452 SDtfs, 13033 SDslu, 24495 SDs, 0 SdLazy, 10955 SolverSat, 762 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 409 GetRequests, 99 SyntacticMatches, 35 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, 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: 9.4s AutomataMinimizationTime, 38 MinimizatonAttempts, 184574 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2980 NumberOfCodeBlocks, 2980 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2846 ConstructedInterpolants, 0 QuantifiedInterpolants, 654174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...