./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix041_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix041_power.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d63aff9b017c63416774dd6f8f2467682d2e239 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-2e94e6a [2018-12-31 21:12:14,822 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 21:12:14,829 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 21:12:14,851 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 21:12:14,852 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 21:12:14,853 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 21:12:14,855 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 21:12:14,858 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 21:12:14,860 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 21:12:14,861 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 21:12:14,870 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 21:12:14,870 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 21:12:14,871 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 21:12:14,874 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 21:12:14,876 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 21:12:14,876 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 21:12:14,881 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 21:12:14,886 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 21:12:14,891 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 21:12:14,893 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 21:12:14,894 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 21:12:14,895 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 21:12:14,897 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 21:12:14,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 21:12:14,898 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 21:12:14,899 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 21:12:14,900 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 21:12:14,900 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 21:12:14,901 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 21:12:14,902 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 21:12:14,902 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 21:12:14,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 21:12:14,903 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 21:12:14,903 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 21:12:14,907 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 21:12:14,908 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 21:12:14,909 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 21:12:14,938 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 21:12:14,939 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 21:12:14,941 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 21:12:14,941 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 21:12:14,941 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 21:12:14,942 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 21:12:14,942 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 21:12:14,942 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 21:12:14,943 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 21:12:14,943 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 21:12:14,943 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 21:12:14,943 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 21:12:14,943 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 21:12:14,944 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 21:12:14,944 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 21:12:14,944 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 21:12:14,944 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 21:12:14,944 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 21:12:14,945 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 21:12:14,946 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 21:12:14,946 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 21:12:14,946 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 21:12:14,947 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 21:12:14,947 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 21:12:14,947 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 21:12:14,947 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 21:12:14,947 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 21:12:14,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 21:12:14,948 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__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 -> 6d63aff9b017c63416774dd6f8f2467682d2e239 [2018-12-31 21:12:15,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 21:12:15,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 21:12:15,042 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 21:12:15,044 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 21:12:15,045 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 21:12:15,045 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix041_power.opt_false-unreach-call.i [2018-12-31 21:12:15,119 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1701badad/fe4d119a184a42c8ad09324b0fd84754/FLAGe7f919665 [2018-12-31 21:12:15,750 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 21:12:15,751 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix041_power.opt_false-unreach-call.i [2018-12-31 21:12:15,769 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1701badad/fe4d119a184a42c8ad09324b0fd84754/FLAGe7f919665 [2018-12-31 21:12:15,977 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1701badad/fe4d119a184a42c8ad09324b0fd84754 [2018-12-31 21:12:15,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 21:12:15,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 21:12:15,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 21:12:15,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 21:12:15,987 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 21:12:15,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:12:15" (1/1) ... [2018-12-31 21:12:15,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a35997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:15, skipping insertion in model container [2018-12-31 21:12:15,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:12:15" (1/1) ... [2018-12-31 21:12:16,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 21:12:16,071 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 21:12:16,550 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 21:12:16,579 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 21:12:16,775 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 21:12:16,881 INFO L195 MainTranslator]: Completed translation [2018-12-31 21:12:16,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:16 WrapperNode [2018-12-31 21:12:16,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 21:12:16,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 21:12:16,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 21:12:16,883 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 21:12:16,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:16" (1/1) ... [2018-12-31 21:12:16,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:16" (1/1) ... [2018-12-31 21:12:16,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 21:12:16,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 21:12:16,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 21:12:16,980 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 21:12:16,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:16" (1/1) ... [2018-12-31 21:12:16,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:16" (1/1) ... [2018-12-31 21:12:16,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:16" (1/1) ... [2018-12-31 21:12:16,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:16" (1/1) ... [2018-12-31 21:12:17,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:16" (1/1) ... [2018-12-31 21:12:17,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:16" (1/1) ... [2018-12-31 21:12:17,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:16" (1/1) ... [2018-12-31 21:12:17,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 21:12:17,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 21:12:17,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 21:12:17,036 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 21:12:17,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-31 21:12:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 21:12:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 21:12:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 21:12:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 21:12:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 21:12:17,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 21:12:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 21:12:17,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 21:12:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 21:12:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 21:12:17,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 21:12:17,124 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 21:12:18,322 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 21:12:18,323 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 21:12:18,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:12:18 BoogieIcfgContainer [2018-12-31 21:12:18,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 21:12:18,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 21:12:18,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 21:12:18,328 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 21:12:18,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:12:15" (1/3) ... [2018-12-31 21:12:18,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1683bcaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:12:18, skipping insertion in model container [2018-12-31 21:12:18,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:16" (2/3) ... [2018-12-31 21:12:18,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1683bcaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:12:18, skipping insertion in model container [2018-12-31 21:12:18,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:12:18" (3/3) ... [2018-12-31 21:12:18,333 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_false-unreach-call.i [2018-12-31 21:12:18,388 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,388 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,388 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,388 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,396 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,399 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,399 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,399 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,399 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,401 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:18,424 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 21:12:18,424 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 21:12:18,434 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 21:12:18,452 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 21:12:18,482 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 21:12:18,483 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 21:12:18,483 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 21:12:18,483 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 21:12:18,483 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 21:12:18,484 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 21:12:18,484 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 21:12:18,484 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 21:12:18,484 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 21:12:18,499 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-31 21:12:20,270 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-31 21:12:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-31 21:12:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 21:12:20,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:20,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:12:20,288 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:20,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:20,295 INFO L82 PathProgramCache]: Analyzing trace with hash 224065163, now seen corresponding path program 1 times [2018-12-31 21:12:20,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:20,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:20,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:20,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:20,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:20,656 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-31 21:12:20,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:20,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:12:20,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:12:20,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:12:20,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:20,687 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-31 21:12:21,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:21,927 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-31 21:12:21,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:12:21,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-31 21:12:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:22,313 INFO L225 Difference]: With dead ends: 45389 [2018-12-31 21:12:22,313 INFO L226 Difference]: Without dead ends: 40629 [2018-12-31 21:12:22,316 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-31 21:12:22,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-31 21:12:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-31 21:12:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-31 21:12:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-31 21:12:24,150 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-31 21:12:24,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:24,151 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-31 21:12:24,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:12:24,151 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-31 21:12:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 21:12:24,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:24,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:12:24,159 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:24,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:24,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1632937034, now seen corresponding path program 1 times [2018-12-31 21:12:24,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:24,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:24,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:24,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:24,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:24,289 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-31 21:12:24,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:24,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:12:24,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:12:24,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:12:24,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:12:24,293 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-31 21:12:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:24,922 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-31 21:12:24,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:12:24,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-31 21:12:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:25,097 INFO L225 Difference]: With dead ends: 23663 [2018-12-31 21:12:25,098 INFO L226 Difference]: Without dead ends: 23663 [2018-12-31 21:12:25,099 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-31 21:12:25,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-31 21:12:26,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-31 21:12:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-31 21:12:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-31 21:12:26,317 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-31 21:12:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:26,318 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-31 21:12:26,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:12:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-31 21:12:26,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 21:12:26,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:26,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:12:26,321 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:26,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:26,322 INFO L82 PathProgramCache]: Analyzing trace with hash -164014325, now seen corresponding path program 1 times [2018-12-31 21:12:26,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:26,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:26,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:26,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:26,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:26,455 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-31 21:12:26,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:26,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:12:26,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:12:26,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:12:26,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:26,459 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-31 21:12:28,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:28,931 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-31 21:12:28,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:12:28,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-31 21:12:28,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:29,236 INFO L225 Difference]: With dead ends: 64831 [2018-12-31 21:12:29,236 INFO L226 Difference]: Without dead ends: 64671 [2018-12-31 21:12:29,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:12:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-31 21:12:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-31 21:12:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-31 21:12:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-31 21:12:30,706 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-31 21:12:30,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:30,708 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-31 21:12:30,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:12:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-31 21:12:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 21:12:30,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:30,712 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-31 21:12:30,712 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:30,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1508997083, now seen corresponding path program 1 times [2018-12-31 21:12:30,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:30,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:30,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:30,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:30,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:30,833 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-31 21:12:30,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:30,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:12:30,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:12:30,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:12:30,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:30,835 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 5 states. [2018-12-31 21:12:32,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:32,384 INFO L93 Difference]: Finished difference Result 66627 states and 246202 transitions. [2018-12-31 21:12:32,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:12:32,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-31 21:12:32,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:32,605 INFO L225 Difference]: With dead ends: 66627 [2018-12-31 21:12:32,605 INFO L226 Difference]: Without dead ends: 66459 [2018-12-31 21:12:32,606 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-31 21:12:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2018-12-31 21:12:33,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2018-12-31 21:12:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-31 21:12:33,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143659 transitions. [2018-12-31 21:12:33,874 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143659 transitions. Word has length 46 [2018-12-31 21:12:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:33,874 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143659 transitions. [2018-12-31 21:12:33,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:12:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143659 transitions. [2018-12-31 21:12:34,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 21:12:34,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:34,663 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-31 21:12:34,663 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:34,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:34,663 INFO L82 PathProgramCache]: Analyzing trace with hash -800575093, now seen corresponding path program 1 times [2018-12-31 21:12:34,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:34,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:34,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:34,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:34,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:34,871 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-31 21:12:34,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:34,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:12:34,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:12:34,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:12:34,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:34,874 INFO L87 Difference]: Start difference. First operand 38835 states and 143659 transitions. Second operand 4 states. [2018-12-31 21:12:34,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:34,972 INFO L93 Difference]: Finished difference Result 14217 states and 47061 transitions. [2018-12-31 21:12:34,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:12:34,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-31 21:12:34,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:35,005 INFO L225 Difference]: With dead ends: 14217 [2018-12-31 21:12:35,006 INFO L226 Difference]: Without dead ends: 13696 [2018-12-31 21:12:35,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13696 states. [2018-12-31 21:12:35,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13696 to 13696. [2018-12-31 21:12:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13696 states. [2018-12-31 21:12:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13696 states to 13696 states and 45509 transitions. [2018-12-31 21:12:35,242 INFO L78 Accepts]: Start accepts. Automaton has 13696 states and 45509 transitions. Word has length 53 [2018-12-31 21:12:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:35,243 INFO L480 AbstractCegarLoop]: Abstraction has 13696 states and 45509 transitions. [2018-12-31 21:12:35,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:12:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 13696 states and 45509 transitions. [2018-12-31 21:12:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-31 21:12:35,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:35,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:12:35,249 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:35,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:35,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1496318134, now seen corresponding path program 1 times [2018-12-31 21:12:35,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:35,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:35,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:35,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:35,450 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-31 21:12:35,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:35,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:12:35,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:12:35,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:12:35,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:35,453 INFO L87 Difference]: Start difference. First operand 13696 states and 45509 transitions. Second operand 4 states. [2018-12-31 21:12:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:36,023 INFO L93 Difference]: Finished difference Result 19084 states and 62264 transitions. [2018-12-31 21:12:36,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:12:36,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-31 21:12:36,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:36,058 INFO L225 Difference]: With dead ends: 19084 [2018-12-31 21:12:36,059 INFO L226 Difference]: Without dead ends: 19084 [2018-12-31 21:12:36,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19084 states. [2018-12-31 21:12:36,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19084 to 14780. [2018-12-31 21:12:36,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14780 states. [2018-12-31 21:12:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14780 states to 14780 states and 48764 transitions. [2018-12-31 21:12:36,339 INFO L78 Accepts]: Start accepts. Automaton has 14780 states and 48764 transitions. Word has length 59 [2018-12-31 21:12:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:36,340 INFO L480 AbstractCegarLoop]: Abstraction has 14780 states and 48764 transitions. [2018-12-31 21:12:36,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:12:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 14780 states and 48764 transitions. [2018-12-31 21:12:36,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-31 21:12:36,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:36,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:12:36,347 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:36,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:36,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1055838827, now seen corresponding path program 1 times [2018-12-31 21:12:36,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:36,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:36,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:36,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:36,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:36,602 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-31 21:12:36,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:36,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:12:36,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:12:36,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:12:36,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:36,608 INFO L87 Difference]: Start difference. First operand 14780 states and 48764 transitions. Second operand 5 states. [2018-12-31 21:12:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:37,034 INFO L93 Difference]: Finished difference Result 2828 states and 7576 transitions. [2018-12-31 21:12:37,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 21:12:37,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-31 21:12:37,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:37,039 INFO L225 Difference]: With dead ends: 2828 [2018-12-31 21:12:37,039 INFO L226 Difference]: Without dead ends: 2416 [2018-12-31 21:12:37,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:12:37,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2018-12-31 21:12:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2313. [2018-12-31 21:12:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2313 states. [2018-12-31 21:12:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 6179 transitions. [2018-12-31 21:12:37,064 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 6179 transitions. Word has length 59 [2018-12-31 21:12:37,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:37,064 INFO L480 AbstractCegarLoop]: Abstraction has 2313 states and 6179 transitions. [2018-12-31 21:12:37,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:12:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 6179 transitions. [2018-12-31 21:12:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 21:12:37,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:37,072 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-31 21:12:37,072 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:37,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash -401390984, now seen corresponding path program 1 times [2018-12-31 21:12:37,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:37,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:37,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:37,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:37,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:37,264 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-31 21:12:37,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:37,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:12:37,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:12:37,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:12:37,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:37,266 INFO L87 Difference]: Start difference. First operand 2313 states and 6179 transitions. Second operand 4 states. [2018-12-31 21:12:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:37,539 INFO L93 Difference]: Finished difference Result 2750 states and 7226 transitions. [2018-12-31 21:12:37,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:12:37,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 21:12:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:37,545 INFO L225 Difference]: With dead ends: 2750 [2018-12-31 21:12:37,545 INFO L226 Difference]: Without dead ends: 2750 [2018-12-31 21:12:37,546 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-31 21:12:37,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2018-12-31 21:12:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2402. [2018-12-31 21:12:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2402 states. [2018-12-31 21:12:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 6381 transitions. [2018-12-31 21:12:37,584 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 6381 transitions. Word has length 92 [2018-12-31 21:12:37,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:37,585 INFO L480 AbstractCegarLoop]: Abstraction has 2402 states and 6381 transitions. [2018-12-31 21:12:37,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:12:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 6381 transitions. [2018-12-31 21:12:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 21:12:37,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:37,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, 1, 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-31 21:12:37,592 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:37,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:37,593 INFO L82 PathProgramCache]: Analyzing trace with hash 568190039, now seen corresponding path program 1 times [2018-12-31 21:12:37,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:37,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:37,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:37,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:37,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:37,792 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-31 21:12:37,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:37,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:12:37,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:12:37,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:12:37,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:37,793 INFO L87 Difference]: Start difference. First operand 2402 states and 6381 transitions. Second operand 4 states. [2018-12-31 21:12:38,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:38,137 INFO L93 Difference]: Finished difference Result 3360 states and 8951 transitions. [2018-12-31 21:12:38,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:12:38,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 21:12:38,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:38,143 INFO L225 Difference]: With dead ends: 3360 [2018-12-31 21:12:38,144 INFO L226 Difference]: Without dead ends: 3360 [2018-12-31 21:12:38,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:38,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2018-12-31 21:12:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 2367. [2018-12-31 21:12:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2018-12-31 21:12:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 6242 transitions. [2018-12-31 21:12:38,177 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 6242 transitions. Word has length 92 [2018-12-31 21:12:38,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:38,178 INFO L480 AbstractCegarLoop]: Abstraction has 2367 states and 6242 transitions. [2018-12-31 21:12:38,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:12:38,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 6242 transitions. [2018-12-31 21:12:38,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 21:12:38,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:38,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:12:38,183 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:38,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:38,183 INFO L82 PathProgramCache]: Analyzing trace with hash -167652887, now seen corresponding path program 2 times [2018-12-31 21:12:38,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:38,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:38,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:38,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:38,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:38,360 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-31 21:12:38,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:38,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:12:38,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:12:38,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:12:38,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:38,361 INFO L87 Difference]: Start difference. First operand 2367 states and 6242 transitions. Second operand 5 states. [2018-12-31 21:12:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:38,660 INFO L93 Difference]: Finished difference Result 2725 states and 7108 transitions. [2018-12-31 21:12:38,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:12:38,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-31 21:12:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:38,666 INFO L225 Difference]: With dead ends: 2725 [2018-12-31 21:12:38,667 INFO L226 Difference]: Without dead ends: 2725 [2018-12-31 21:12:38,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:12:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2018-12-31 21:12:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2363. [2018-12-31 21:12:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2018-12-31 21:12:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 6233 transitions. [2018-12-31 21:12:38,696 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 6233 transitions. Word has length 92 [2018-12-31 21:12:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:38,696 INFO L480 AbstractCegarLoop]: Abstraction has 2363 states and 6233 transitions. [2018-12-31 21:12:38,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:12:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 6233 transitions. [2018-12-31 21:12:38,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 21:12:38,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:38,700 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-31 21:12:38,701 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:38,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:38,701 INFO L82 PathProgramCache]: Analyzing trace with hash -264980909, now seen corresponding path program 1 times [2018-12-31 21:12:38,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:38,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:38,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:38,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 21:12:38,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:38,838 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-31 21:12:38,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:38,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:12:38,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:12:38,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:12:38,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:12:38,841 INFO L87 Difference]: Start difference. First operand 2363 states and 6233 transitions. Second operand 3 states. [2018-12-31 21:12:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:38,999 INFO L93 Difference]: Finished difference Result 2413 states and 6340 transitions. [2018-12-31 21:12:39,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:12:39,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-12-31 21:12:39,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:39,004 INFO L225 Difference]: With dead ends: 2413 [2018-12-31 21:12:39,004 INFO L226 Difference]: Without dead ends: 2413 [2018-12-31 21:12:39,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:12:39,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2018-12-31 21:12:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2375. [2018-12-31 21:12:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2018-12-31 21:12:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 6257 transitions. [2018-12-31 21:12:39,033 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 6257 transitions. Word has length 92 [2018-12-31 21:12:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:39,033 INFO L480 AbstractCegarLoop]: Abstraction has 2375 states and 6257 transitions. [2018-12-31 21:12:39,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:12:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 6257 transitions. [2018-12-31 21:12:39,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:12:39,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:39,038 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-31 21:12:39,038 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:39,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:39,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1400839737, now seen corresponding path program 1 times [2018-12-31 21:12:39,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:39,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:39,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:39,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:39,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:39,220 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-31 21:12:39,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:39,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:12:39,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:12:39,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:12:39,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:39,221 INFO L87 Difference]: Start difference. First operand 2375 states and 6257 transitions. Second operand 4 states. [2018-12-31 21:12:39,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:39,412 INFO L93 Difference]: Finished difference Result 4576 states and 12148 transitions. [2018-12-31 21:12:39,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:12:39,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-31 21:12:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:39,421 INFO L225 Difference]: With dead ends: 4576 [2018-12-31 21:12:39,421 INFO L226 Difference]: Without dead ends: 4576 [2018-12-31 21:12:39,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:39,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2018-12-31 21:12:39,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 2359. [2018-12-31 21:12:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2359 states. [2018-12-31 21:12:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 6176 transitions. [2018-12-31 21:12:39,461 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 6176 transitions. Word has length 94 [2018-12-31 21:12:39,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:39,462 INFO L480 AbstractCegarLoop]: Abstraction has 2359 states and 6176 transitions. [2018-12-31 21:12:39,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:12:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 6176 transitions. [2018-12-31 21:12:39,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:12:39,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:39,467 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-31 21:12:39,467 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:39,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:39,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1730605498, now seen corresponding path program 1 times [2018-12-31 21:12:39,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:39,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:39,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:39,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:39,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:39,935 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-31 21:12:39,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:39,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:12:39,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:12:39,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:12:39,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:12:39,937 INFO L87 Difference]: Start difference. First operand 2359 states and 6176 transitions. Second operand 7 states. [2018-12-31 21:12:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:40,455 INFO L93 Difference]: Finished difference Result 2684 states and 6937 transitions. [2018-12-31 21:12:40,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:12:40,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-31 21:12:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:40,461 INFO L225 Difference]: With dead ends: 2684 [2018-12-31 21:12:40,461 INFO L226 Difference]: Without dead ends: 2684 [2018-12-31 21:12:40,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:12:40,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2018-12-31 21:12:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2437. [2018-12-31 21:12:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2437 states. [2018-12-31 21:12:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 6326 transitions. [2018-12-31 21:12:40,493 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 6326 transitions. Word has length 94 [2018-12-31 21:12:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:40,493 INFO L480 AbstractCegarLoop]: Abstraction has 2437 states and 6326 transitions. [2018-12-31 21:12:40,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:12:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 6326 transitions. [2018-12-31 21:12:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:12:40,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:40,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:12:40,499 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:40,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:40,500 INFO L82 PathProgramCache]: Analyzing trace with hash 547258201, now seen corresponding path program 1 times [2018-12-31 21:12:40,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:40,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:40,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:40,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:40,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:40,982 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-12-31 21:12:41,017 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-31 21:12:41,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:41,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:12:41,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:12:41,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:12:41,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:41,018 INFO L87 Difference]: Start difference. First operand 2437 states and 6326 transitions. Second operand 5 states. [2018-12-31 21:12:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:41,229 INFO L93 Difference]: Finished difference Result 2230 states and 5772 transitions. [2018-12-31 21:12:41,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:12:41,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 21:12:41,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:41,234 INFO L225 Difference]: With dead ends: 2230 [2018-12-31 21:12:41,234 INFO L226 Difference]: Without dead ends: 2230 [2018-12-31 21:12:41,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:12:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2018-12-31 21:12:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2229. [2018-12-31 21:12:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2229 states. [2018-12-31 21:12:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 5770 transitions. [2018-12-31 21:12:41,260 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 5770 transitions. Word has length 94 [2018-12-31 21:12:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:41,260 INFO L480 AbstractCegarLoop]: Abstraction has 2229 states and 5770 transitions. [2018-12-31 21:12:41,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:12:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 5770 transitions. [2018-12-31 21:12:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:12:41,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:41,264 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-31 21:12:41,265 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:41,265 INFO L82 PathProgramCache]: Analyzing trace with hash -375425382, now seen corresponding path program 1 times [2018-12-31 21:12:41,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:41,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:41,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:41,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:41,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:41,690 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 21:12:42,207 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 21:12:42,241 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-31 21:12:42,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:42,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:12:42,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:12:42,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:12:42,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:12:42,244 INFO L87 Difference]: Start difference. First operand 2229 states and 5770 transitions. Second operand 6 states. [2018-12-31 21:12:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:42,706 INFO L93 Difference]: Finished difference Result 1941 states and 4874 transitions. [2018-12-31 21:12:42,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 21:12:42,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 21:12:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:42,710 INFO L225 Difference]: With dead ends: 1941 [2018-12-31 21:12:42,711 INFO L226 Difference]: Without dead ends: 1941 [2018-12-31 21:12:42,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:12:42,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-12-31 21:12:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1624. [2018-12-31 21:12:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2018-12-31 21:12:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 4128 transitions. [2018-12-31 21:12:42,734 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 4128 transitions. Word has length 94 [2018-12-31 21:12:42,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:42,734 INFO L480 AbstractCegarLoop]: Abstraction has 1624 states and 4128 transitions. [2018-12-31 21:12:42,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:12:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 4128 transitions. [2018-12-31 21:12:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:12:42,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:42,738 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-31 21:12:42,738 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:42,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:42,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1696918783, now seen corresponding path program 1 times [2018-12-31 21:12:42,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:42,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:42,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:42,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:42,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:42,882 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-31 21:12:42,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:42,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:12:42,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:12:42,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:12:42,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:12:42,883 INFO L87 Difference]: Start difference. First operand 1624 states and 4128 transitions. Second operand 7 states. [2018-12-31 21:12:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:43,594 INFO L93 Difference]: Finished difference Result 3053 states and 7610 transitions. [2018-12-31 21:12:43,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 21:12:43,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 21:12:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:43,599 INFO L225 Difference]: With dead ends: 3053 [2018-12-31 21:12:43,600 INFO L226 Difference]: Without dead ends: 3053 [2018-12-31 21:12:43,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-31 21:12:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2018-12-31 21:12:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 2358. [2018-12-31 21:12:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2358 states. [2018-12-31 21:12:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 6000 transitions. [2018-12-31 21:12:43,642 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 6000 transitions. Word has length 96 [2018-12-31 21:12:43,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:43,642 INFO L480 AbstractCegarLoop]: Abstraction has 2358 states and 6000 transitions. [2018-12-31 21:12:43,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:12:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 6000 transitions. [2018-12-31 21:12:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:12:43,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:43,649 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-31 21:12:43,649 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:43,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1353284032, now seen corresponding path program 1 times [2018-12-31 21:12:43,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:43,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:43,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:43,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:43,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:43,955 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-31 21:12:43,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:43,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:12:43,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:12:43,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:12:43,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:12:43,956 INFO L87 Difference]: Start difference. First operand 2358 states and 6000 transitions. Second operand 6 states. [2018-12-31 21:12:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:44,210 INFO L93 Difference]: Finished difference Result 2471 states and 6261 transitions. [2018-12-31 21:12:44,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 21:12:44,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 21:12:44,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:44,214 INFO L225 Difference]: With dead ends: 2471 [2018-12-31 21:12:44,215 INFO L226 Difference]: Without dead ends: 2471 [2018-12-31 21:12:44,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-31 21:12:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2018-12-31 21:12:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2411. [2018-12-31 21:12:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2018-12-31 21:12:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 6129 transitions. [2018-12-31 21:12:44,251 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 6129 transitions. Word has length 96 [2018-12-31 21:12:44,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:44,252 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 6129 transitions. [2018-12-31 21:12:44,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:12:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 6129 transitions. [2018-12-31 21:12:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:12:44,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:44,257 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-31 21:12:44,257 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:44,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:44,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2026684544, now seen corresponding path program 1 times [2018-12-31 21:12:44,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:44,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:44,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:44,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:44,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:44,984 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-31 21:12:44,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:44,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:12:44,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:12:44,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:12:44,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:44,986 INFO L87 Difference]: Start difference. First operand 2411 states and 6129 transitions. Second operand 5 states. [2018-12-31 21:12:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:45,516 INFO L93 Difference]: Finished difference Result 2731 states and 6929 transitions. [2018-12-31 21:12:45,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:12:45,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 21:12:45,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:45,521 INFO L225 Difference]: With dead ends: 2731 [2018-12-31 21:12:45,521 INFO L226 Difference]: Without dead ends: 2731 [2018-12-31 21:12:45,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:12:45,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2018-12-31 21:12:45,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 2140. [2018-12-31 21:12:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2018-12-31 21:12:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 5454 transitions. [2018-12-31 21:12:45,551 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 5454 transitions. Word has length 96 [2018-12-31 21:12:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:45,551 INFO L480 AbstractCegarLoop]: Abstraction has 2140 states and 5454 transitions. [2018-12-31 21:12:45,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:12:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 5454 transitions. [2018-12-31 21:12:45,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:12:45,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:45,555 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-31 21:12:45,556 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:45,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:45,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1023518271, now seen corresponding path program 1 times [2018-12-31 21:12:45,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:45,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:45,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:45,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:45,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:45,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:45,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 21:12:45,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 21:12:45,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 21:12:45,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 21:12:45,785 INFO L87 Difference]: Start difference. First operand 2140 states and 5454 transitions. Second operand 10 states. [2018-12-31 21:12:46,027 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-12-31 21:12:46,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:46,612 INFO L93 Difference]: Finished difference Result 3914 states and 10153 transitions. [2018-12-31 21:12:46,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:12:46,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-31 21:12:46,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:46,617 INFO L225 Difference]: With dead ends: 3914 [2018-12-31 21:12:46,618 INFO L226 Difference]: Without dead ends: 1820 [2018-12-31 21:12:46,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-31 21:12:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2018-12-31 21:12:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1820. [2018-12-31 21:12:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1820 states. [2018-12-31 21:12:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 4769 transitions. [2018-12-31 21:12:46,642 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 4769 transitions. Word has length 96 [2018-12-31 21:12:46,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:46,642 INFO L480 AbstractCegarLoop]: Abstraction has 1820 states and 4769 transitions. [2018-12-31 21:12:46,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 21:12:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 4769 transitions. [2018-12-31 21:12:46,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:12:46,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:12:46,646 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:46,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:46,646 INFO L82 PathProgramCache]: Analyzing trace with hash -390127679, now seen corresponding path program 2 times [2018-12-31 21:12:46,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:46,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:46,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:46,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:46,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:46,932 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 21:12:48,205 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-31 21:12:48,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:48,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 21:12:48,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 21:12:48,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 21:12:48,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-31 21:12:48,207 INFO L87 Difference]: Start difference. First operand 1820 states and 4769 transitions. Second operand 12 states. [2018-12-31 21:12:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:48,895 INFO L93 Difference]: Finished difference Result 3454 states and 9140 transitions. [2018-12-31 21:12:48,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 21:12:48,896 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-31 21:12:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:48,901 INFO L225 Difference]: With dead ends: 3454 [2018-12-31 21:12:48,901 INFO L226 Difference]: Without dead ends: 2478 [2018-12-31 21:12:48,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-31 21:12:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2018-12-31 21:12:48,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2326. [2018-12-31 21:12:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2018-12-31 21:12:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 5964 transitions. [2018-12-31 21:12:48,930 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 5964 transitions. Word has length 96 [2018-12-31 21:12:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:48,930 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 5964 transitions. [2018-12-31 21:12:48,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 21:12:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 5964 transitions. [2018-12-31 21:12:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:12:48,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:48,935 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-31 21:12:48,935 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:48,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:48,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1513895995, now seen corresponding path program 3 times [2018-12-31 21:12:48,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:48,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:48,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:48,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 21:12:48,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 21:12:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 21:12:49,030 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 21:12:49,240 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 21:12:49,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:12:49 BasicIcfg [2018-12-31 21:12:49,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 21:12:49,243 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 21:12:49,243 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 21:12:49,243 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 21:12:49,244 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:12:18" (3/4) ... [2018-12-31 21:12:49,249 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 21:12:49,406 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 21:12:49,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 21:12:49,407 INFO L168 Benchmark]: Toolchain (without parser) took 33426.38 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 951.3 MB in the beginning and 1.7 GB in the end (delta: -704.4 MB). Peak memory consumption was 855.9 MB. Max. memory is 11.5 GB. [2018-12-31 21:12:49,409 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 21:12:49,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 899.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-12-31 21:12:49,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 21:12:49,412 INFO L168 Benchmark]: Boogie Preprocessor took 56.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 21:12:49,412 INFO L168 Benchmark]: RCFGBuilder took 1287.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2018-12-31 21:12:49,413 INFO L168 Benchmark]: TraceAbstraction took 30917.81 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -645.7 MB). Peak memory consumption was 792.5 MB. Max. memory is 11.5 GB. [2018-12-31 21:12:49,413 INFO L168 Benchmark]: Witness Printer took 163.59 ms. Allocated memory is still 2.6 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2018-12-31 21:12:49,419 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 899.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1287.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30917.81 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -645.7 MB). Peak memory consumption was 792.5 MB. Max. memory is 11.5 GB. * Witness Printer took 163.59 ms. Allocated memory is still 2.6 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] -1 pthread_t t1093; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1093, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] -1 pthread_t t1094; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1094, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L723] 0 x$w_buff1 = x$w_buff0 [L724] 0 x$w_buff0 = 2 [L725] 0 x$w_buff1_used = x$w_buff0_used [L726] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L728] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L729] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L730] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L731] 0 x$r_buff0_thd2 = (_Bool)1 [L734] 0 y = 1 [L737] 0 __unbuffered_p1_EAX = y [L740] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L703] 1 z = 1 [L706] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L709] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L710] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L712] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L712] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L713] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L713] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L776] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L778] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 x$flush_delayed = weak$$choice2 [L784] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L786] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L788] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] -1 x = x$flush_delayed ? x$mem_tmp : x [L794] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 30.7s OverallTime, 21 OverallIterations, 1 TraceHistogramMax, 13.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4288 SDtfs, 4007 SDslu, 9346 SDs, 0 SdLazy, 3089 SolverSat, 209 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 56 SyntacticMatches, 11 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38835occurred in iteration=4, 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: 6.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 82546 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1665 NumberOfCodeBlocks, 1665 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1549 ConstructedInterpolants, 0 QuantifiedInterpolants, 309275 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...